Skip to content
conftrace_

restricted isometry property

36 papers

RIP

Papers

Spike-and-Slab Posterior Sampling in High Dimensions COLT 2025 Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery JMLR 2024 Restricted Isometry Property of Rank-One Measurements with Random Unit-Modulus Vectors AISTATS 2024 Revisiting RIP Guarantees for Sketching Operators on Mixture Models JMLR 2024 Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization NeurIPS 2024 Straight-Through Meets Sparse Recovery: the Support Exploration Algorithm ICML 2024 Decentralized Matrix Sensing: Statistical Guarantees and Fast Convergence NeurIPS 2023 Geometric Analysis of Matrix Sensing over Graphs NeurIPS 2023 Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate AISTATS 2023 Robust Matrix Sensing in the Semi-Random Model NeurIPS 2023 Semi-Random Sparse Recovery in Nearly-Linear Time COLT 2023 Denoising and change point localisation in piecewise-constant high-dimensional regression coefficients AISTATS 2022 Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems AAAI 2022 Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements AAAI 2022 A Nullspace Property for Subspace-Preserving Recovery ICML 2021 General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds NeurIPS 2021 On the Absence of Spurious Local Minima in Nonlinear Low-Rank Matrix Recovery Problems AISTATS 2021 Sparse Convex Optimization via Adaptively Regularized Hard Thresholding JMLR 2021 Random Quadratic Forms with Dependence: Applications to Restricted Isometry and Beyond NeurIPS 2019 Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery JMLR 2019 A Tight Bound of Hard Thresholding JMLR 2018 How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? NeurIPS 2018 Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP ICML 2017 Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017 Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach AISTATS 2017