Pith. sign in

REVIEW 6 cited by

Fully lifted random duality theory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.00070 v1 pith:7TGKI46K submitted 2023-11-29 math.PR cs.ITmath.ITmath.OCmath.STstat.TH

classification math.PRcs.ITmath.ITmath.OCmath.STstat.TH
keywords citedualityemphrandomropsfullyliftedstrong
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study a generic class of \emph{random optimization problems} (rops) and their typical behavior. The foundational aspects of the random duality theory (RDT), associated with rops, were discussed in \cite{StojnicRegRndDlt10}, where it was shown that one can often infer rops' behavior even without actually solving them. Moreover, \cite{StojnicRegRndDlt10} uncovered that various quantities relevant to rops (including, for example, their typical objective values) can be determined (in a large dimensional context) even completely analytically. The key observation was that the \emph{strong deterministic duality} implies the, so-called, \emph{strong random duality} and therefore the full exactness of the analytical RDT characterizations. Here, we attack precisely those scenarios where the strong deterministic duality is not necessarily present and connect them to the recent progress made in studying bilinearly indexed (bli) random processes in \cite{Stojnicnflgscompyx23,Stojnicsflgscompyx23}. In particular, utilizing a fully lifted (fl) interpolating comparison mechanism introduced in \cite{Stojnicnflgscompyx23}, we establish corresponding \emph{fully lifted} RDT (fl RDT). We then rely on a stationarized fl interpolation realization introduced in \cite{Stojnicsflgscompyx23} to obtain complete \emph{statitionarized} fl RDT (sfl RDT). A few well known problems are then discussed as illustrations of a wide range of practical applications implied by the generality of the considered rops.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ground state energies of multipartite $p$-spin models -- partially lifted RDT view

    math.PR 2025-09 conditional novelty 6.0 of 10

    The paper uses partially lifted random duality theory to derive matching ground-state-energy bounds for spherical multipartite pure p-spin models and proves the Subag and Dartois-McKenna formulas agree exactly.

  2. Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view

    stat.ML 2025-06 conditional novelty 6.0 of 10

    Optimal spectral initializers at the theoretical phase retrieval threshold sit in flat landscape regions, so roughly 15% oversampling is needed for reliable descending algorithms.

  3. Phase transition of \emph{descending} phase retrieval algorithms

    stat.ML 2025-06 reject novelty 6.0 of 10

    The paper derives RDT-based lower bounds and predicts a phase transition at oversampling ratio α≈1.4 where descending phase retrieval algorithms transition from failing to succeeding, but the key isomorphism with conv...

  4. A CLuP algorithm to practically achieve $\sim 0.76$ SK--model ground state free energy

    cond-mat.dis-nn 2025-07 conditional novelty 5.0 of 10

    The authors propose a CLuP-SK barrier-descent algorithm and report it achieves approximately 0.76 of the SK ground state free energy for n around 2000 to 8000, approaching the theoretical Parisi limit of about 0.763.

  5. Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT

    stat.ML 2025-06 conditional novelty 5.0 of 10

    For the asymmetric binary perceptron, the worst-case local entropy breaks down for constraint density alpha in (0.77, 0.78), matching replica predictions and the range where fast algorithms stop working.

  6. Phase retrieval with rank $d$ measurements -- \emph{descending} algorithms phase transitions

    stat.ML 2025-06 conditional novelty 5.0 of 10

    For rank d phase retrieval with Gaussian measurements, descending gradient algorithms are predicted to succeed above a sample complexity ratio near 2.79 for d=2, with lifted bounds lowering this estimate and simulatio...

Pith tools