Folgen
Cynthia Rush
Cynthia Rush
Columbia University
Bestätigte E-Mail-Adresse bei columbia.edu
Titel
Zitiert von
Zitiert von
Jahr
Capacity-achieving sparse superposition codes via approximate message passing decoding
C Rush, A Greig, R Venkataramanan
IEEE Transactions on Information Theory 63 (3), 1476-1500, 2017
145*2017
A unifying tutorial on approximate message passing
OY Feng, R Venkataramanan, C Rush, RJ Samworth
Foundations and Trends® in Machine Learning 15 (4), 335-536, 2022
1162022
Finite sample analysis of approximate message passing algorithms
C Rush, R Venkataramanan
IEEE Transactions on Information Theory 64 (11), 7264-7286, 2018
1082018
Unsourced random access with coded compressed sensing: Integrating AMP and belief propagation
VK Amalladinne, AK Pradhan, C Rush, JF Chamberland, KR Narayanan
IEEE Transactions on Information Theory 68 (4), 2384-2409, 2021
832021
Cognitive priming and cognitive training: immediate and far transfer to academic skills in children
BE Wexler, M Iseli, S Leon, W Zaggle, C Rush, A Goodman, A Esat Imal, ...
Scientific reports 6 (1), 32859, 2016
622016
Algorithmic analysis and statistical estimation of SLOPE via approximate message passing
Z Bu, JM Klusowski, C Rush, WJ Su
IEEE Transactions on Information Theory 67 (1), 506-537, 2020
592020
All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation
N Macris, C Rush
Advances in Neural Information Processing Systems 33, 14915-14926, 2020
462020
Capacity-achieving spatially coupled sparse superposition codes with AMP decoding
C Rush, K Hsieh, R Venkataramanan
IEEE Transactions on Information Theory 67 (7), 4446-4484, 2021
352021
The error probability of sparse superposition codes with approximate message passing decoding
C Rush, R Venkataramanan
IEEE Transactions on Information Theory 65 (5), 3278-3303, 2018
32*2018
Analysis of approximate message passing with a class of non-separable denoisers
Y Ma, C Rush, D Baron
2017 IEEE International Symposium on Information Theory (ISIT), 231-235, 2017
31*2017
On approximate message passing for unsourced access with coded compressed sensing
VK Amalladinne, AK Pradhan, C Rush, JF Chamberland, KR Narayanan
2020 IEEE International Symposium on Information Theory (ISIT), 2995-3000, 2020
282020
A systems-biology approach to modular genetic complexity
GW Carter, CG Rush, F Uygun, NA Sakhanenko, DJ Galas, T Galitski
Chaos: An Interdisciplinary Journal of Nonlinear Science 20 (2), 2010
272010
On the robustness to misspecification of α-posteriors and their variational approximations
MA Medina, JLM Olea, C Rush, A Velez
Journal of Machine Learning Research 23 (147), 1-51, 2022
262022
An approximate message passing framework for side information
A Ma, Y Zhou, C Rush, D Baron, D Needell
IEEE Transactions on Signal Processing 67 (7), 1875-1888, 2019
26*2019
An integrated program of computer-presented and physical cognitive training exercises for children with attention-deficit/hyperactivity disorder
BE Wexler, LA Vitulano, C Moore, L Katsovich, SD Smith, C Rush, ...
Psychological medicine 51 (9), 1524-1535, 2021
232021
Measuring dependencies of order statistics: An information theoretic perspective
A Dytso, M Cardone, C Rush
2020 IEEE Information Theory Workshop (ITW), 1-5, 2021
192021
A Non-asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms with Rotationally Invariant Designs
C Cademartori, C Rush
IEEE Transactions on Information Theory, 2024
18*2024
Near-optimal coding for many-user multiple access channels
K Hsieh, C Rush, R Venkataramanan
IEEE Journal on Selected Areas in Information Theory 3 (1), 21-36, 2022
16*2022
Rigorous state evolution analysis for approximate message passing with side information
H Liu, C Rush, D Baron
IEEE Transactions on Information Theory 69 (6), 3989-4013, 2022
15*2022
Spatially coupled sparse regression codes: Design and state evolution analysis
K Hsieh, C Rush, R Venkataramanan
2018 IEEE International Symposium on Information Theory (ISIT), 1016-1020, 2018
152018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20