Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Cynthia Rush

Cynthia Rush

Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit


May 27, 2021
Zhiqi Bu, Jason Klusowski, Cynthia Rush, Weijie J. Su

Figure 1 for Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit
Figure 2 for Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit
Figure 3 for Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit
Figure 4 for Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit

  Access Paper or Ask Questions

A unifying tutorial on Approximate Message Passing


May 05, 2021
Oliver Y. Feng, Ramji Venkataramanan, Cynthia Rush, Richard J. Samworth

Figure 1 for A unifying tutorial on Approximate Message Passing
Figure 2 for A unifying tutorial on Approximate Message Passing
* 99 pages, 2 figures 
  Access Paper or Ask Questions

On the Robustness to Misspecification of $α$-Posteriors and Their Variational Approximations


Apr 16, 2021
Marco Avella Medina, José Luis Montiel Olea, Cynthia Rush, Amilcar Velez


  Access Paper or Ask Questions

All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation


Jun 14, 2020
Jean Barbier, Nicolas Macris, Cynthia Rush

Figure 1 for All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation
Figure 2 for All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation
* Part of this work (in particular the proof of Theorem 1) is already present in reference arXiv:1911.05030 
  Access Paper or Ask Questions

Rigorous State Evolution Analysis for Approximate Message Passing with Side Information


Mar 25, 2020
Hangjin Liu, Cynthia Rush, Dror Baron

Figure 1 for Rigorous State Evolution Analysis for Approximate Message Passing with Side Information
Figure 2 for Rigorous State Evolution Analysis for Approximate Message Passing with Side Information
Figure 3 for Rigorous State Evolution Analysis for Approximate Message Passing with Side Information
* arXiv admin note: text overlap with arXiv:1902.00150 
  Access Paper or Ask Questions

Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing


Jul 17, 2019
Zhiqi Bu, Jason Klusowski, Cynthia Rush, Weijie Su

Figure 1 for Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
Figure 2 for Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
Figure 3 for Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
Figure 4 for Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing

  Access Paper or Ask Questions

Finite Sample Analysis of Approximate Message Passing Algorithms


Mar 16, 2018
Cynthia Rush, Ramji Venkataramanan

* IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7264-7286, November 2018 
 * To appear in IEEE Transactions on Information Theory 
  Access Paper or Ask Questions

Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding


Mar 11, 2017
Cynthia Rush, Adam Greig, Ramji Venkataramanan

Figure 1 for Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
Figure 2 for Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
Figure 3 for Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
* IEEE Transactions on Information Theory, vol. 63, no.3, pp. 1476-1500, March 2017 
 * 25 pages, 4 figures. IEEE Transactions on Information Theory 
  Access Paper or Ask Questions