Ramji Venkataramanan

IEEE Trans. Inf. Theory, November, 2024

Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2024

Quantitative Group Testing and Pooled Data in the Linear Regime with Sublinear Tests.

[BibT_eX]

[DOI]

Pablo Pascual Cobo

CoRR, 2024

Coded Many-User Multiple Access via Approximate Message Passing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Many-user multiple access with random user activity.

[BibT_eX]

[DOI]

Pablo Pascual Cobo

Proceedings of the IEEE International Symposium on Information Theory, 2024

Inferring Change Points in High-Dimensional Linear Regression via Approximate Message Passing.

[BibT_eX]

[DOI]

Gabriel Arpino

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, September, 2023

Mixed Regression via Approximate Message Passing.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing.

[BibT_eX]

[DOI]

Jonathan Scarlett

CoRR, 2023

Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing.

[BibT_eX]

[DOI]

CoRR, 2023

Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression.

[BibT_eX]

[DOI]

Gabriel Arpino

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Mixed Linear Regression via Approximate Message Passing.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Near-Optimal Coding for Many-User Multiple Access Channels.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2022

A Unifying Tutorial on Approximate Message Passing.

[BibT_eX]

[DOI]

Found. Trends Mach. Learn., 2022

Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models.

[BibT_eX]

[DOI]

Christos Thrampoulidis

Found. Comput. Math., 2022

Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models.

[BibT_eX]

[DOI]

Yihan Zhang

CoRR, 2022

Sketching sparse low-rank matrices with near-optimal sample- and time-complexity.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing.

[BibT_eX]

[DOI]

Kevin Kögler

Proceedings of the International Conference on Machine Learning, 2022

2021

Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Modulated Sparse Superposition Codes for the Complex AWGN Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Multilayer Codes for Synchronization From Deletions and Insertions.

[BibT_eX]

[DOI]

Albert Guillén i Fàbregas

IEEE Trans. Inf. Theory, 2021

PCA Initialization for Approximate Message Passing in Rotationally Invariant Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Near-Optimal Coding for Massive Multiple Access.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Approximate Message Passing with Spectral Initialization for Generalized Linear Models.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Modulated Sparse Regression Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Sparse Regression Codes.

[BibT_eX]

[DOI]

Andrew R. Barron

Found. Trends Commun. Inf. Theory, 2019

Spatially Coupled Sparse Regression Codes with Sliding Window AMP Decoding.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity.

[BibT_eX]

[DOI]

Mohsen Heidari

Proceedings of the IEEE International Symposium on Information Theory, 2019

Coding for Deletion Channels with Multiple Traces.

[BibT_eX]

[DOI]

Albert Guillén i Fàbregas

Lara Dolecek

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Cluster-Seeking James-Stein Estimators.

[BibT_eX]

[DOI]

K. Pavan Srinath

IEEE Trans. Inf. Theory, 2018

Finite Sample Analysis of Approximate Message Passing Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Coding for Segmented Edit Channels.

[BibT_eX]

[DOI]

Albert Guillen i Fabregas

IEEE Trans. Inf. Theory, 2018

Techniques for Improving the Finite Length Performance of Sparse Superposition Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2018

Capacity-achieving sparse regression codes via spatial coupling.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Empirical Bayes Estimators for Sparse Sequences.

[BibT_eX]

[DOI]

K. Pavan Srinath

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Spatially Coupled Sparse Regression Codes: Design and State Evolution Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Efficient Systematic Encoding of Non-binary VT Codes.

[BibT_eX]

[DOI]

Albert Guillén i Fàbregas

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

The Rate-Distortion Function and Excess-Distortion Exponent of Sparse Regression Codes With Optimal Encoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Strong converse bounds for high-dimensional estimation.

[BibT_eX]

[DOI]

Oliver Johnson

CoRR, 2017

Empirical Bayes Estimators for High-Dimensional Sparse Vectors.

[BibT_eX]

[DOI]

Koteshwar Pavan Srinath

CoRR, 2017

Optimizing the Finite Length Performance of Sparse Superposition Codes.

[BibT_eX]

[DOI]

CoRR, 2017

Multilayer codes for synchronization from deletions.

[BibT_eX]

[DOI]

Albert Guillen i Fabregas

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

The error exponent of sparse regression codes with AMP decoding.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Codes for channels with segmented edits.

[BibT_eX]

[DOI]

Albert Guillen i Fabregas

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Cluster-seeking shrinkage estimators.

[BibT_eX]

[DOI]

K. Pavan Srinath

Proceedings of the IEEE International Symposium on Information Theory, 2016

Finite-sample analysis of Approximate Message Passing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions.

[BibT_eX]

[DOI]

Vasuki Narasimha Swamy

IEEE Trans. Inf. Theory, 2015

Capacity-achieving Sparse Regression Codes via approximate message passing decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding.

[BibT_eX]

[DOI]

Tuhin Sarkar

IEEE Trans. Inf. Theory, 2014

Lossy Compression via Sparse Linear Regression: Performance Under Minimum-Distance Encoding.

[BibT_eX]

[DOI]

Antony Joseph

IEEE Trans. Inf. Theory, 2014

Rewritable Storage Channels with Hidden State.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

The Gaussian rate-distortion function of sparse regression codes with optimal encoding.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Achievable Rates for Channels With Deletions and Insertions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

An Achievable Rate Region for the Broadcast Channel With Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Improved capacity lower bounds for channels with deletions and insertions.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Sparse Regression codes: Recent results and future directions.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Efficient interactive algorithms for file synchronization under general edits.

[BibT_eX]

[DOI]

Vasuki Narasimha Swamy

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Gaussian Rate-Distortion via Sparse Regression over Compact Dictionaries

[BibT_eX]

[DOI]

Antony Joseph

CoRR, 2012

Coding strategies for the uniform noise rewritable channel with hidden state.

[BibT_eX]

[DOI]

Luis Alfonso Lastras-Montaño

Michele Franceschini

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Gaussian rate-distortion via sparse linear regression over compact dictionaries.

[BibT_eX]

[DOI]

Antony Joseph

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Sparse regression codes for multi-terminal source and channel coding.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Achievable Rates for Multiple Descriptions With Feed-Forward.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

2010

On Computing the Feedback Capacity of Channels and the Feed-Forward Rate-Distortion Function of Sources.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2010

Typicality Graphs:Large Deviation Analysis

[BibT_eX]

[DOI]

Achilleas Anastasopoulos

CoRR, 2010

Achievable rates for the broadcast channel with feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Typicality graphs and their properties.

[BibT_eX]

[DOI]

Ali Nazari

Dinesh Krithivasan

Achilleas Anastasopoulos

Proceedings of the IEEE International Symposium on Information Theory, 2010

Interactive low-complexity codes for synchronization from deletions and insertions.

[BibT_eX]

[DOI]

Hao Zhang

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

A new achievable rate region for the discrete memoryless multiple-access channel with feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Multiple descriptions with feed-forward: A single-letter achievable rate region.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Estimation of frequency offset using warped discrete-Fourier transform.

[BibT_eX]

[DOI]

K. M. M. Prabhu

Signal Process., 2006

2004

Source coding with feed-forward.

[BibT_eX]

[DOI]