Cynthia Rush

Orcid: 0000-0001-6857-2855

Affiliations:
  • Columbia University, USA


According to our database1, Cynthia Rush authored at least 37 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Non-Asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms With Rotationally Invariant Designs.
IEEE Trans. Inf. Theory, August, 2024

2023
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information.
IEEE Trans. Inf. Theory, June, 2023

Entropic Central Limit Theorem for Order Statistics.
IEEE Trans. Inf. Theory, April, 2023

Is It Easier to Count Communities Than Find Them?
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

When is Mimo Massive in Radar?
Proceedings of the IEEE International Conference on Acoustics, 2023

Asymptotics for power posterior mean estimation.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022
Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation.
IEEE Trans. Inf. Theory, 2022

Near-Optimal Coding for Many-User Multiple Access Channels.
IEEE J. Sel. Areas Inf. Theory, 2022

On the Robustness to Misspecification of α-posteriors and Their Variational Approximations.
J. Mach. Learn. Res., 2022

A Unifying Tutorial on Approximate Message Passing.
Found. Trends Mach. Learn., 2022

Entropic CLT for Order Statistics.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding.
IEEE Trans. Inf. Theory, 2021

Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing.
IEEE Trans. Inf. Theory, 2021

Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit.
CoRR, 2021

The Most Informative Order Statistic and its Application to Image Denoising.
CoRR, 2021

Near-Optimal Coding for Massive Multiple Access.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Information Theoretic Approach to L-Estimators.
Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, 2021

2020
mmWave Channel Estimation via Approximate Message Passing with Side Information.
Proceedings of the 21st IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2020

All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Measuring Dependencies of Order Statistics: An Information Theoretic Perspective.
Proceedings of the IEEE Information Theory Workshop, 2020

Exponentially Fast Concentration of Vector Approximate Message Passing to its State Evolution.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2020

An Asymptotic Rate for the LASSO Loss.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
An Approximate Message Passing Framework for Side Information.
IEEE Trans. Signal Process., 2019

The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding.
IEEE Trans. Inf. Theory, 2019

Analysis of Approximate Message Passing With Non-Separable Denoisers and Markov Random Field Priors.
IEEE Trans. Inf. Theory, 2019

Spatially Coupled Sparse Regression Codes with Sliding Window AMP Decoding.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

An Analysis of State Evolution for Approximate Message Passing with Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Finite Sample Analysis of Approximate Message Passing Algorithms.
IEEE Trans. Inf. Theory, 2018

Capacity-achieving sparse regression codes via spatial coupling.
Proceedings of the IEEE Information Theory Workshop, 2018

Spatially Coupled Sparse Regression Codes: Design and State Evolution Analysis.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding.
IEEE Trans. Inf. Theory, 2017

The error exponent of sparse regression codes with AMP decoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Analysis of approximate message passing with a class of non-separable denoisers.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Conditional approximate message passing with side information.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016
Finite-sample analysis of Approximate Message Passing.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Capacity-achieving Sparse Regression Codes via approximate message passing decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2015


  Loading...