ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a continuous random energy model (CREM) with concave covariance function AA, inverse temperature β>βc\beta>\beta_c, \tilde\text{ and } ?\text{?}, and ?\text{?}. Let OPT=max∣v∣=NXv\text{OPT}=\text{max}_{|v|=N}X_v and let KL\text{KL} denote Kullback–Leibler divergence. Low-temperature algorithmic tradeoff conjecture. For ?\text{?} and ?\text{?}, there is a 2O~ε(Nα)2^{\widetilde{O}_{\varepsilon}(N^\alpha)}-time algorithm which, with high probability, both finds v^\widehat v satisfying Xv^≥OPT−εN1−2αX_{\widehat v}\geq\mathrm{OPT}-\varepsilon N^{1-2\alpha} and outputs a distribution μ^\widehat\mu satisfying KL⁡(μ^∥μβ,N)≤εN1−2α\operatorname{KL}(\widehat\mu\|\mu_{\beta,N})\leq\varepsilon N^{1-2\alpha}. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.