ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn denote the size of a binary paint shop problem (BPSP) instance, let u(3,γ,β) u(3,\boldsymbol{\gamma},\boldsymbol{\beta}) denote the performance function for the MF-AOA at the relevant variational parameters, and let AMP denote approximate message-passing algorithms. The normalized paint swap ratio is written as EΔC/n\mathbb{E}\Delta_C/n.

MF-AOA asymptotic performance conjecture. In the limit n→∞n\rightarrow\infty, AMP algorithms such as the MF-AOA achieve a performance of approximately

lim⁡n→∞EΔC/n=1−2ν(3,γ,β)3≳0.269.\lim_{n\rightarrow\infty} \mathbb{E}\Delta_C/n = 1-\frac{2\nu(3,\boldsymbol{\gamma},\boldsymbol{\beta})}{\sqrt{3}} \gtrsim 0.269.

This conjecture extrapolates the observed QAOA and MF-AOA performance to the large-instance limit. The authors caution that the fitted value may be an overestimate; numerical simulations report an expected normalized paint swap ratio of approximately 0.279930.27993 for n=10000n=10000, while a rigorous asymptotic analysis remains to be established.

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.