The decimation scheme for symmetric matrix factorization

DOI10.1088/1751-8121/AD2299arXiv2307.16564OpenAlexW4391213591WikidataQ129309630 ScholiaQ129309630MaRDI QIDQ6190382

Francesco Camilli, Marc Mézard

Publication date: 5 March 2024

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.16564

zbMATH Keywords

Hopfield modelmatrix factorizationhigh-dimensional inferenceassociative memoriesdecimation scheme

Mathematics Subject Classification ID

Computer science (68-XX) Statistical mechanics, structure of matter (82-XX)

Cites Work

• The singular values and vectors of low rank perturbations of large rectangular random matrices
• The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
• On sample eigenvalues in a generalized spiked population model
• Self-organization and associative memory
• The largest eigenvalue of small rank perturbations of Hermitian random matrices
• The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations
• Addition of certain non-commuting random variables
• Fundamental limits of symmetric low-rank matrix estimation
• On the distribution of the largest eigenvalue in principal components analysis
• Fundamental limits of detection in the spiked Wigner model
• The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference
• The largest eigenvalue of rank one deformation of large Wigner matrices
• Eigenvalues of large sample covariance matrices of spiked population models
• Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
• Rotational Invariant Estimator for General Noisy Matrices
• Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
• Robust principal component analysis?
• Statistical mechanics of Hopfield-like neural networks with modified interactions
• Dictionary Learning Algorithms for Sparse Representation
• Bilinear Generalized Approximate Message Passing—Part I: Derivation
• Bilinear Generalized Approximate Message Passing—Part II: Applications
• The adaptive interpolation method for proving replica formulas. Applications to the Curie–Weiss and Wigner spike models
• Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising
• Dreaming neural networks: rigorous results
• Iterative reconstruction of rank-one matrices in noise
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Neural networks and physical systems with emergent collective computational abilities.
• A CDMA multiuser detection algorithm on the basis of belief propagation
• Multi-Layer Bilinear Generalized Approximate Message Passing

This page was built for publication: The decimation scheme for symmetric matrix factorization