A large deviation view of stationarized fully lifted blirp interpolation
Not on the map. Why?
Abstract (arXiv)
We consider bilinearly indexed random processes (blirp) and study their interpolating comparative mechanisms. Generic introduction of the fully lifted (fl) blirp interpolation in [105] was followed by a corresponding stationarization counterpart in [103]. A large deviation upgrade of [105] introduced in companion paper [106] is complemented here with the corresponding one of [103]. Similarly to [106], the mechanism that we introduce extends the range of [103]'s applicability so that it encompasses random structures atypical features. Among others these include the local entropies (LE) which explain atypical solutions clusterings in hard random optimization problems believed to be directly responsible for the presumable existence of the so-called computational gaps. Moreover (and similar to [105]), despite on occasion somewhat involved technical considerations, the final forms of the uncovered fundamental interpolating parameters relations are rather elegant and as such provide a valuable tool readily available for further use.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 114 references that are in the map. First posted on arXiv 24 Jun 2025.
Builds on
29 of 114 references.
References · 29
- 2016Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixturescited by 115
- 2017The power of sum-of-squares for detecting hidden structurescited by 54
- 2022Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localizationcited by 48
- 2015Subdominant Dense Clusters Allow for Simple Learning and High Computational Performance in Neural Networks with Discrete Synapsescited by 39
- 2015Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectorscited by 38
- 2015Tensor principal component analysis via sum-of-squares proofscited by 35
- 2022The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statisticscited by 31
- 2021Unveiling the structure of wide flat minima in neural networkscited by 28
- 2013Another look at the Gardner problemcited by 24
- 2013Limits of local algorithms over sparse random graphscited by 23
- 2015Local entropy as a measure for sampling solutions in Constraint Satisfaction Problemscited by 20
- 2021Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptroncited by 18
17 more
- 2013Upper-bounding ℓ1-optimization weak thresholdscited by 14
- 2013Discrete perceptronscited by 14
- 2013On the Complexity of Random Satisfiability Problems with Planted Solutionscited by 14
- 2013Lifting ℓ1-optimization strong and sectional thresholdscited by 13
- 2013Lifting/lowering Hopfield models ground state energiescited by 13
- 2020Algorithmic pure states for the negative spherical perceptroncited by 13
- 2021Binary perceptron: efficient algorithms can find solutions in a rare well-connected clustercited by 13
- 2023Typical and atypical solutions in non-convex neural networks with discrete and continuous weightscited by 13
- 2023Binary perceptrons capacity via fully lifted random duality theorycited by 13
- 2019Clustering of solutions in the symmetric binary perceptroncited by 12
- 2022Algorithms and Barriers in the Symmetric Binary Perceptron Modelcited by 12
- 2013Spherical perceptron as a storage memory with limited errorscited by 11
- 2024Hardness of sampling solutions from the Symmetric Binary Perceptroncited by 8
- 2022Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomialscited by 6
- 2024Discrepancy Algorithms for the Binary Perceptroncited by 5
- 2013Bounds on restricted isometry constants of random matricescited by 1
- 2013Asymmetric Little model and its ground state energiescited by 1
Built on by
Not cited yet.