Near-optimal Hilbert-cube points are close to binary points
Near-optimal Hilbert-cube points are close to binary points
Let have independent entries distributed as , and let denote the binary and Hilbert-cube domains used for the p-spin model. Hilbert-cube localization conjecture. For every , there exists such that, with probability at least for some and all sufficiently large , every satisfying
also satisfies
If true, this would reduce the conjectured OGP for near-optimal points in the Hilbert cube to the established binary-domain OGP; the paper explicitly presents it as an interesting open problem.
Sources & referencesView supporting material
Primary source
David Gamarnik and Aukosh Jagannath, “The Overlap Gap Property and Approximate Message Passing Algorithms for p-spin models”, arXiv:1911.06943 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.