Approximate Message Passing Algorithms For Orthogonally Invariant Models

Approximate Message Passing Algorithms For Orthogonally Invariant Models

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=1inZfJbHppg


Duration: 49:05
1,406 views
20

Zhou Fan (Yale University)
https://simons.berkeley.edu/talks/amp-algorithms-orthogonally-invariant-models
Algorithmic Advances for Statistical Inference with Combinatorial Structure



Other Videos By Simons Institute for the Theory of Computing


2021-10-20Barren Plateaus and Quantum Generative Training Using Rényi Divergences | Quantum Colloquium
2021-10-19Theoretically Speaking — Deep Nets and the Primate Visual System
2021-10-16Estimation Beyond the IID Setting (Two Vignettes)
2021-10-16Exact Matching Of Random Graphs With Constant Correlation
2021-10-16Deep Generative Models And Unsupervised Methods For Inverse Problems
2021-10-15Uncertainty Quantification In The Bradley-Terry-Luce Model
2021-10-15Tensor Graphical Models For Complex And High Dimensional Data
2021-10-15Structures Of Local Minima In K-Means And Mixture Models
2021-10-14New Algorithms For The Graph Alignment Problem
2021-10-14Learning Minimax Estimators Via Online Learning
2021-10-14Approximate Message Passing Algorithms For Orthogonally Invariant Models
2021-10-14Metric Representations: Algorithms and Geometry
2021-10-13A Curious Case Of Symmetric Binary Perceptron Model: Algorithms And Barriers
2021-10-13Exact Minimax Estimation for Phase Synchronization
2021-10-13Differential Privacy Meets Robust Statistics
2021-10-13Panel on Securing Cryptography Against Quantum Adversaries | Quantum Colloquium
2021-10-13Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier | Quantum Colloquium
2021-10-13Causal Matrix Estimation
2021-10-12Tractability And Overparametrization In Some Simple Models
2021-10-12Correlated Stochastic Block Models: Graph Matching And Community Recovery
2021-10-11Random Combinatorial Matrices


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Algorithmic Advances for Statistical Inference with Combinatorial Structure
Zhou Fan