| Publication | Date of Publication | Type |
|---|
Bayes-optimal estimation in generalized linear models via spatial coupling
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Approximate message passing with rigorous guarantees for pooled data and quantitative group testing
SIAM Journal on Mathematics of Data Science | 2024-11-05 | Paper |
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing
| 2023-08-28 | Paper |
Approximate message passing with spectral initialization for generalized linear models*
Journal of Statistical Mechanics: Theory and Experiment | 2022-12-13 | Paper |
Optimal combination of linear and spectral estimators for generalized linear models
Foundations of Computational Mathematics | 2022-10-21 | Paper |
A Unifying Tutorial on Approximate Message Passing
Foundations and Trends® in Machine Learning | 2022-06-03 | Paper |
Empirical Bayes estimators for high-dimensional sparse vectors
Information and Inference: A Journal of the IMA | 2021-08-16 | Paper |
Modulated Sparse Superposition Codes for the Complex AWGN Channel
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Multilayer Codes for Synchronization From Deletions and Insertions
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Approximate Message Passing with Spectral Initialization for Generalized Linear Models
| 2020-10-07 | Paper |
Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models
| 2020-08-07 | Paper |
Sparse regression codes
Foundations and Trends™ in Communications and Information Theory | 2019-08-12 | Paper |
The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Finite Sample Analysis of Approximate Message Passing Algorithms
IEEE Transactions on Information Theory | 2018-12-19 | Paper |
Coding for Segmented Edit Channels
| 2018-07-09 | Paper |
Cluster-Seeking James–Stein Estimators
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
The Rate-Distortion Function and Excess-Distortion Exponent of Sparse Regression Codes With Optimal Encoding
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Achievable Rates for Multiple Descriptions With Feed-Forward
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Achievable Rates for Channels With Deletions and Insertions
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
An Achievable Rate Region for the Broadcast Channel With Feedback
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Lossy Compression via Sparse Linear Regression: Performance Under Minimum-Distance Encoding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Estimation of frequency offset using warped discrete-Fourier transform
Signal Processing | 2009-07-01 | Paper |
Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
