The overlap gap property in principal submatrix recovery (Q2067659)

scientific article; zbMATH DE number 7458805

Language	Label	Description	Also known as
English	The overlap gap property in principal submatrix recovery	scientific article; zbMATH DE number 7458805

Statements

instance of

scholarly article

0 references

title

The overlap gap property in principal submatrix recovery (English)

0 references

0 references

0 references

0 references

18 January 2022

0 references

full work available at URL

https://arxiv.org/abs/1908.09959

0 references

zbMATH Keywords

submatrix recovery

0 references

overlap gap property

0 references

spin glasses

0 references

describes a project that uses

0 references

0 references

Community Detection and Stochastic Block Models

0 references

On the solution‐space geometry of random constraint satisfaction problems

0 references

The algorithmic hardness threshold for continuous random energy models

0 references

Q4705344

0 references

Spin glass computations and Ruelle's probability cascades

0 references

Parisi formula for the ground state energy in the mixed $p$-spin model

0 references

The SK Model Is Infinite Step Replica Symmetry Breaking at Zero Temperature

0 references

Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices

0 references

Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization

0 references

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

0 references

Equilibrium statistical mechanics of bipartite spin systems

0 references

Algorithmic thresholds for tensor PCA

0 references

Spectral gap estimates in mean field spin glasses

0 references

The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices

0 references

Energy landscape for large average submatrix detection problems in Gaussian random matrices

0 references

Q4907706

0 references

Detection of a sparse submatrix of a high-dimensional noisy matrix

0 references

Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix

0 references

Computational and statistical boundaries for submatrix localization in a large noisy matrix

0 references

Computational and statistical tradeoffs via convex relaxation

0 references

Suboptimality of local algorithms for a class of max-cut problems

0 references

Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices

0 references

Walksat Stalls Well Below Satisfiability

0 references

Q4023085

0 references

Q5812361

0 references

Statistical Algorithms and a Lower Bound for Detecting Planted Cliques

0 references

Finding a large submatrix of a Gaussian random matrix

0 references

Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem

0 references

Sparse CCA: adaptive estimation and computational barriers

0 references

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

0 references

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

0 references

Approximate Ultrametricity for Random Measures and Applications to Spin Glasses

0 references

MAX $\kappa$-cut and the inhomogeneous Potts spin Glass

0 references

Statistical thresholds for tensor PCA

0 references

On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model

0 references

A dynamic programming approach to the Parisi functional

0 references

Low temperature asymptotics of spherical mean field spin glasses

0 references

Some properties of the phase diagram for mixed $p$-spin glasses

0 references

Fundamental limits of symmetric low-rank matrix estimation

0 references

Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications

0 references

Computational barriers in minimax submatrix detection

0 references

Sum-of-squares Lower Bounds for Planted Clique

0 references

Q4237477

0 references

Finding one community in a sparse graph

0 references

Optimization of the Sherrington--Kirkpatrick Hamiltonian

0 references

On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors

0 references

The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness

0 references

The Parisi ultrametricity conjecture

0 references

The Sherrington-Kirkpatrick Model

0 references

The Parisi formula for mixed $p$-spin models

0 references

The free energy in a multi-species Sherrington-Kirkpatrick model

0 references

Free energy in the mixed $p$-spin models with vector spins

0 references

Free energy in the Potts spin Glass

0 references

Local algorithms for independent sets are half-optimal

0 references

Finding large average submatrices in high dimensional data

0 references

Q5691080

0 references

Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses

0 references

Mean Field Models for Spin Glasses

0 references

published in

Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S00440-021-01089-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2067659