Linear operator approximate message passing (OpAMP)
From MaRDI portal
Cites work
- A theory of solving TAP equations for Ising models with general invariant random matrices
- A Unifying Tutorial on Approximate Message Passing
- Analysis of random sequential message passing algorithms for approximate inference
- Approximate message passing algorithms for rotationally invariant matrices
- Approximate message passing for orthogonally invariant ensembles: multivariate non-linearities and spectral initialization
- Bayes-Optimal Convolutional AMP
- Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding
- Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
- Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation
- Estimation of low-rank matrices via approximate message passing
- Faster noisy power method
- Finite Sample Analysis of Approximate Message Passing Algorithms
- Fundamental limits in structured principal component analysis and how to reach them
- Graph-based Approximate Message Passing Iterations
- Householder Dice: A Matrix-Free Algorithm for Simulating Dynamics on Gaussian and Random Orthogonal Ensembles
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization
- Memory AMP
- Optimal Transport
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Rigorous dynamical mean field theory for stochastic gradient descent methods
- Speeding Up Distributed Machine Learning Using Codes
- State evolution for approximate message passing with non-separable functions
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- Statistically optimal firstorder algorithms: a proof via orthogonalization
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
- Universality of approximate message passing with semirandom matrices
- Vector Approximate Message Passing
This page was built for publication: Linear operator approximate message passing (OpAMP)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6853045)