| Publication | Date of Publication | Type |
|---|
Asymptotics for power posterior mean estimation
(available as arXiv preprint) | N/A | Paper |
Is it easier to count communities than find them?
Random Structures & Algorithms | 2026-07-20 | Paper |
Max-sliced Wasserstein concentration and uniform ratio bounds of empirical measures on RKHS
Bernoulli | 2026-05-28 | Paper |
The distributionally robust prediction error of the \(\sqrt{\mathrm{LASSO}}\) and related estimators
The Annals of Statistics | 2026-04-08 | Paper |
| Is it easier to count communities than find them? | 2024-09-25 | Paper |
A non-asymptotic analysis of generalized vector approximate message passing algorithms with rotationally invariant designs
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information
IEEE Transactions on Information Theory | 2024-03-21 | Paper |
Entropic Central Limit Theorem for Order Statistics
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit
The Annals of Statistics | 2023-05-10 | Paper |
| A Non-asymptotic Analysis of Generalized Approximate Message Passing Algorithms with Right Rotationally Invariant Designs | 2023-01-31 | Paper |
A Non-asymptotic Analysis of Generalized Approximate Message Passing Algorithms with Right Rotationally Invariant Designs
(available as arXiv preprint) | 2023-01-01 | Paper |
| Is it easier to count communities than find them? | 2022-12-21 | Paper |
Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
A Unifying Tutorial on Approximate Message Passing
Foundations and Trends® in Machine Learning | 2022-06-03 | Paper |
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
| All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation | 2020-06-14 | Paper |
Analysis of Approximate Message Passing With Non-Separable Denoisers and Markov Random Field Priors
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation
(available as arXiv preprint) | 2020-01-01 | Paper |
The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
An Approximate Message Passing Framework for Side Information
IEEE Transactions on Signal Processing | 2019-03-29 | Paper |
Finite Sample Analysis of Approximate Message Passing Algorithms
IEEE Transactions on Information Theory | 2018-12-19 | Paper |
Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
