Fourier analysis of iterative algorithms
From MaRDI portal
Cites work
- A CDMA multiuser detection algorithm on the basis of belief propagation
- A nearly tight sum-of-squares lower bound for the planted clique problem
- A Unifying Tutorial on Approximate Message Passing
- An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
- Approximate message passing algorithms for rotationally invariant matrices
- Approximate message passing from random initialization with applications to Z₂ synchronization
- Bayes-Optimal Convolutional AMP
- Capacity lower bound for the Ising perceptron
- Concentration of polynomial random matrices via Efron-Stein inequalities
- Diffusions interacting through a random matrix: universality via stochastic Taylor expansion
- Finite Sample Analysis of Approximate Message Passing Algorithms
- Graph-based Approximate Message Passing Iterations
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
- High-dimensional asymptotics of Langevin dynamics in spiked matrix models
- Householder Dice: A Matrix-Free Algorithm for Simulating Dynamics on Gaussian and Random Orthogonal Ensembles
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 7829321 (Why is no real title available?)
- Information, Physics, and Computation
- Information-theoretic thresholds from the cavity method
- Lectures on the Combinatorics of Free Probability
- Maximum independent sets on random regular graphs
- Mean-field inference methods for neural networks
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
- On the integrality gap of degree-4 sum of squares for planted clique
- Optimization of mean-field spin glasses
- Optimization of the Sherrington-Kirkpatrick Hamiltonian
- Probabilistic graphical models.
- Proof of the satisfiability conjecture for large \(k\)
- Rigorous Dynamics of Expectation-Propagation-Based Signal Recovery from Unitarily Invariant Measurements
- Satisfiability threshold for random regular NAE-SAT
- Semialgebraic Proofs and Efficient Algorithm Design
- Spectral methods from tensor networks
- Spin Glass Theory and Far Beyond
- State evolution for approximate message passing with non-separable functions
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- Statistical mechanics methods and phase transitions in optimization problems
- Statistical theory of superlattices
- Sum-of-squares lower bounds for densest k-subgraph
- Sum-of-squares Lower Bounds for Planted Clique
- Sum-of-squares lower bounds for Sherrington-Kirkpatrick via planted affine planes
- Sum-of-squares lower bounds for sparse independent set
- The cavity method at zero temperature
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The Parisi formula
- The Sherrington-Kirkpatrick model
- Universality in polytope phase transitions and message passing algorithms
- Universality of approximate message passing algorithms
- Universality of approximate message passing with semirandom matrices
This page was built for publication: Fourier analysis of iterative algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363190)
