Polynomial runtime scaling conjecture for reluctant dynamics in the Sherrington–Kirkpatrick model
Statement
Let be a “sufficiently nice” probability measure on with and , let , and suppose that has i.i.d. entries distributed as . Let be the random runtime of reluctant dynamics on an random matrix . Polynomial runtime scaling conjecture. There exist constants and such that
in probability as . This strengthens prior evidence for polynomial runtime scaling in the classical Sherrington–Kirkpatrick model with Gaussian entries to sufficiently nice entry distributions more generally; the statement remains conjectural.
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.