Recovering Low-Rank Matrices From Few Coefficients in Any Basis
From MaRDI portal
Publication:5281038
DOI10.1109/TIT.2011.2104999zbMath1366.94103arXiv0910.1879MaRDI QIDQ5281038
No author found.
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.1879
Related Items (only showing first 100 items - show all)
Matrix Completion Methods for Causal Panel Data Models ⋮ The numerics of phase retrieval ⋮ Streaming Principal Component Analysis From Incomplete Data ⋮ Low Permutation-rank Matrices: Structural Properties and Noisy Completion ⋮ Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA ⋮ WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions ⋮ Matrix compression along isogenic blocks ⋮ Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames ⋮ Phaselift is robust to a constant fraction of arbitrary errors ⋮ Relaxed leverage sampling for low-rank matrix completion ⋮ Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation ⋮ Self-calibration and biconvex compressive sensing ⋮ Tensor Completion in Hierarchical Tensor Representations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method ⋮ Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE ⋮ Seismic data reconstruction via weighted nuclear-norm minimization ⋮ GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ High-dimensional dynamic systems identification with additional constraints ⋮ Nonsmooth rank-one matrix factorization landscape ⋮ Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint ⋮ Tensor completion by multi-rank via unitary transformation ⋮ Dynamical quantum tomography ⋮ Unnamed Item ⋮ Quantum system characterization with limited resources ⋮ Covariate-assisted matrix completion with multiple structural breaks ⋮ The geometry of off-the-grid compressed sensing ⋮ Faster Riemannian Newton-type optimization by subsampling and cubic regularization ⋮ Importance sampling in signal processing applications ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ Error regions in quantum state tomography: computational complexity caused by geometry of quantum states ⋮ A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion ⋮ An efficient adaptive MCMC algorithm for pseudo-Bayesian quantum tomography ⋮ Inference for low-rank models ⋮ Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals ⋮ Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods ⋮ Constrained quantum tomography of semi-algebraic sets with applications to low-rank matrix recovery ⋮ Time for dithering: fast and quantized random embeddings via the restricted isometry property ⋮ Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements ⋮ BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING ⋮ Flavors of Compressive Sensing ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators ⋮ Permutationally invariant state reconstruction ⋮ Efficient and feasible state tomography of quantum many-body systems ⋮ A scalable maximum likelihood method for quantum state tomography ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ Spectral thresholding quantum tomography for low rank states ⋮ Several Classes of Stationary Points for Rank Regularized Minimization Problems ⋮ Policy Gradient Methods for the Noisy Linear Quadratic Regulator over a Finite Horizon ⋮ Unnamed Item ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising ⋮ Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm ⋮ Unnamed Item ⋮ Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix ⋮ Estimation in High Dimensions: A Geometric Perspective ⋮ Convex Recovery of a Structured Signal from Independent Random Linear Measurements ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Unnamed Item ⋮ Nonconvex Robust Low-Rank Matrix Recovery ⋮ Guarantees of Riemannian Optimization for Low Rank Matrix Recovery ⋮ Matrix Completion With Covariate Information ⋮ Structured random measurements in signal processing ⋮ Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank ⋮ Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems ⋮ Efficient Matrix Sensing Using Rank-1 Gaussian Measurements ⋮ Regularization and the small-ball method II: complexity dependent error rates ⋮ Low Rank Estimation of Similarities on Graphs ⋮ PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming ⋮ Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries ⋮ On the Role of Total Variation in Compressed Sensing ⋮ Globally Optimizing Small Codes in Real Projective Spaces ⋮ Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization ⋮ Unnamed Item ⋮ Fast state tomography with optimal error bounds ⋮ Loose laplacian spectra of random hypergraphs ⋮ Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction ⋮ Optimal large-scale quantum state tomography with Pauli measurements ⋮ A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm ⋮ Tight risk bound for high dimensional time series completion ⋮ Matrix completion via max-norm constrained optimization ⋮ A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ Estimation of low rank density matrices: bounds in Schatten norms and other distances ⋮ On tensor completion via nuclear norm minimization ⋮ An improved robust ADMM algorithm for quantum state tomography ⋮ A graphical approach to the analysis of matrix completion ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Parallel stochastic gradient algorithms for large-scale matrix completion ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Mini-workshop: Mathematical physics meets sparse recovery. Abstracts from the mini-workshop held April 13--19, 2014. ⋮ Improved recovery guarantees for phase retrieval from coded diffraction patterns ⋮ Low rank matrix recovery from rank one measurements ⋮ Low rank estimation of smooth kernels on graphs ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ Quantum tomography by regularized linear regressions ⋮ Complex best \(r\)-term approximations almost always exist in finite dimensions
This page was built for publication: Recovering Low-Rank Matrices From Few Coefficients in Any Basis
