conftrace_

restricted isometry property

31 papers

Explore in graph

Also known as

RIP

Co-occurring keywords

compressed sensing (201) non-convex optimization (547) low-rank matrix recovery (57) low-rank matrix (174) gradient descent (1144) sparse recovery (113) matrix sensing (24) matrix completion (356) matrix recovery (51) strict saddle property (5)

Papers

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 NIPS 2024
Decentralized Matrix Sensing: Statistical Guarantees and Fast Convergence NIPS 2023
Semi-Random Sparse Recovery in Nearly-Linear Time COLT 2023
Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate AISTATS 2023
Geometric Analysis of Matrix Sensing over Graphs NIPS 2023
Robust Matrix Sensing in the Semi-Random Model NIPS 2023
Denoising and change point localisation in piecewise-constant high-dimensional regression coefficients AISTATS 2022
Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements AAAI 2022
Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems AAAI 2022
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
A Nullspace Property for Subspace-Preserving Recovery ICML 2021
General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds NIPS 2021
Random Quadratic Forms with Dependence: Applications to Restricted Isometry and Beyond NIPS 2019
Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery JMLR 2019
How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? NIPS 2018
A Tight Bound of Hard Thresholding JMLR 2018
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach AISTATS 2017
Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP ICML 2017
Average-case hardness of RIP certification NIPS 2016
Low-rank Solutions of Linear Matrix Equations via Procrustes Flow ICML 2016