The decimation scheme for symmetric matrix factorization
Matrix factorization is an inference problem that has acquired importance due to its vast
range of applications that go from dictionary learning to recommendation systems and …
range of applications that go from dictionary learning to recommendation systems and …
Statistical limits of dictionary learning: random matrix theory and the spectral replica method
We consider increasingly complex models of matrix denoising and dictionary learning in the
Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank …
Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank …
Optimal denoising of rotationally invariant rectangular matrices
In this manuscript we consider denoising of large rectangular matrices: given a noisy
observation of a signal matrix, what is the best way of recovering the signal matrix itself? For …
observation of a signal matrix, what is the best way of recovering the signal matrix itself? For …
A concise tutorial on approximate message passing
High-dimensional signal recovery of standard linear regression is a key challenge in many
engineering fields, such as, communications, compressed sensing, and image processing …
engineering fields, such as, communications, compressed sensing, and image processing …
Matrix inference in growing rank regimes
The inference of a large symmetric signal-matrix S∈ RN× N corrupted by additive Gaussian
noise, is considered for two regimes of growth of the rank M as a function of N. For sub-linear …
noise, is considered for two regimes of growth of the rank M as a function of N. For sub-linear …
Rectangular rotational invariant estimator for general additive noise matrices
F Pourkamali, N Macris - 2023 IEEE International Symposium …, 2023 - ieeexplore.ieee.org
We propose a rectangular rotational invariant estimator to recover a real matrix from noisy
matrix observations coming from an arbitrary additive rotational invariant perturbation, in the …
matrix observations coming from an arbitrary additive rotational invariant perturbation, in the …
Bayesian extensive-rank matrix factorization with rotational invariant priors
F Pourkamali, N Macris - Advances in Neural Information …, 2024 - proceedings.neurips.cc
We consider a statistical model for matrix factorization in a regime where the rank of the two
hidden matrix factors grows linearly with their dimension and their product is corrupted by …
hidden matrix factors grows linearly with their dimension and their product is corrupted by …
Deep learning via message passing algorithms based on belief propagation
C Lucibello, F Pittorino, G Perugini… - … Learning: Science and …, 2022 - iopscience.iop.org
Message-passing algorithms based on the belief propagation (BP) equations constitute a
well-known distributed computational scheme. They yield exact marginals on tree-like …
well-known distributed computational scheme. They yield exact marginals on tree-like …
Matrix denoising: Bayes-optimal estimators via low-degree polynomials
G Semerjian - arXiv preprint arXiv:2402.16719, 2024 - arxiv.org
We consider the additive version of the matrix denoising problem, where a random
symmetric matrix $ S $ of size $ n $ has to be inferred from the observation of $ Y= S+ Z …
symmetric matrix $ S $ of size $ n $ has to be inferred from the observation of $ Y= S+ Z …