Machine-learning tasks are often computationally intractable, while practical algorithms lack provable guarantees on running time or solution quality.
Statement
Machine-learning tasks are often computationally intractable, while practical algorithms lack provable guarantees on running time or solution quality. Can one develop algorithms for such tasks with provable running-time and solution-quality guarantees?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.