 How robust is randomized blind deconvolution via nuclear norm
minimization against adversarial noise?Applied and Computational Harmonic Analysis (ACHA), 2023 |
 Deflated HeteroPCA: Overcoming the curse of ill-conditioning in
heteroskedastic PCAAnnals of Statistics (Ann. Stat.), 2023 |
 Optimal tuning-free convex relaxation for noisy matrix completionIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2022 |
 Robust Matrix Completion with Heavy-tailed NoiseJournal of the American Statistical Association (JASA), 2022 |
 Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs
with a Generative ModelNeural Information Processing Systems (NeurIPS), 2021 |
 Bridging Convex and Nonconvex Optimization in Robust PCA: Noise,
Outliers, and Missing DataAnnals of Statistics (Ann. Stat.), 2020 |
 Manifold Gradient Descent Solves Multi-Channel Sparse Blind
Deconvolution Provably and EfficientlyIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2019 |
