Subexponential optimization and sampling conjecture for the low-temperature CREM
Statement
Consider a continuous random energy model (CREM) with concave covariance function , inverse temperature , \tilde\text{ and } , and . Let and let denote Kullback–Leibler divergence. Low-temperature algorithmic tradeoff conjecture. For and , there is a -time algorithm which, with high probability, both finds satisfying and outputs a distribution satisfying . The conjecture proposes a Pareto tradeoff between running time and optimization and sampling accuracy in the low-temperature regime, while the supplied text does not specify whether it has been proved or disproved.
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.