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
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
Unnamed Item, Unnamed Item, 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, Flavors of Compressive Sensing, Regularization and the small-ball method II: complexity dependent error rates, Unnamed Item, Unnamed Item, Unnamed Item, 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, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Matrix compression along isogenic blocks, Unnamed Item, Unnamed Item, Nonconvex Low-Rank Tensor Completion from Noisy Data, Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, High-dimensional dynamic systems identification with additional constraints, 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, Spectral thresholding quantum tomography for low rank states, Policy Gradient Methods for the Noisy Linear Quadratic Regulator over a Finite Horizon, 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, Nonconvex Robust Low-Rank Matrix Recovery, Matrix Completion With Covariate Information, On the Role of Total Variation in Compressed Sensing, 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, Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint, Importance sampling in signal processing applications, Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm, Globally Optimizing Small Codes in Real Projective Spaces, Fast state tomography with optimal error bounds, Matrix Completion Methods for Causal Panel Data Models, The numerics of phase retrieval, Tensor completion by multi-rank via unitary transformation, Covariate-assisted matrix completion with multiple structural breaks, Faster Riemannian Newton-type optimization by subsampling and cubic regularization, 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, 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, Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE, Nonsmooth rank-one matrix factorization landscape, The geometry of off-the-grid compressed sensing, 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, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Efficient Matrix Sensing Using Rank-1 Gaussian Measurements, Low Rank Estimation of Similarities on Graphs, PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming, Seismic data reconstruction via weighted nuclear-norm minimization, Dynamical quantum tomography, Quantum system characterization with limited resources, BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING, Loose laplacian spectra of random hypergraphs, Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation, Several Classes of Stationary Points for Rank Regularized Minimization Problems, Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation, Self-calibration and biconvex compressive sensing, Tensor Completion in Hierarchical Tensor Representations, Optimal large-scale quantum state tomography with Pauli measurements, 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, 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, High-dimensional covariance matrix estimation with missing observations, Uniqueness conditions for low-rank matrix recovery, Von Neumann entropy penalization and low-rank matrix estimation, The space decomposition theory for a class of eigenvalue optimizations, Guaranteed clustering and biclustering via semidefinite programming, Pseudo-Bayesian quantum tomography with rank-adaptation, Decomposable norm minimization with proximal-gradient homotopy algorithm, Generalized sampling and infinite-dimensional compressed sensing, Degrees of freedom in low rank matrix estimation, Estimation of high-dimensional low-rank matrices, Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion, Concentration inequalities for matrix martingales in continuous time, Robust matrix completion, User-friendly tail bounds for sums of random matrices, Uniform recovery of fusion frame structured sparse signals, The spectra of multiplicative attribute graphs, Local convergence of an algorithm for subspace identification from partial data, Matrix completion by singular value thresholding: sharp bounds, Adaptive multinomial matrix completion, A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm, Infinite-dimensional compressed sensing and function interpolation, A unified approach to error bounds for structured convex optimization problems, Double instrumental variable estimation of interaction models with big data, Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization, Adaptive confidence sets for matrix completion, Compressed sensing with structured sparsity and structured acquisition, Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices, Low-rank matrix recovery using Gabidulin codes in characteristic zero, Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics, Convergence radius and sample complexity of ITKM algorithms for dictionary learning, Regularization and the small-ball method. I: Sparse recovery, Templates for convex cone problems with applications to sparse signal recovery, Error bounds for rank constrained optimization problems and applications, Robust group lasso: model and recoverability, Compressed sensing and matrix completion with constant proportion of corruptions, Accelerated linearized Bregman method, Rank penalized estimators for high-dimensional matrices, Exact matrix completion based on low rank Hankel structure in the Fourier domain, Phase retrieval from Fourier measurements with masks, Local asymptotic equivalence of pure states ensembles and quantum Gaussian white noise, On polynomial time methods for exact low-rank tensor completion, Matrix factorization for multivariate time series analysis, Low-rank matrix completion in a general non-orthogonal basis, Phase retrieval with PhaseLift algorithm, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Matrix optimization based Euclidean embedding with outliers, Tensor theta norms and low rank recovery, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, An adaptation for iterative structured matrix completion, An \({\ell_p}\) theory of PCA and spectral clustering, Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion, Proof methods for robust low-rank matrix recovery, Tight risk bound for high dimensional time series completion, Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods, Quantum tomography by regularized linear regressions, Complex best \(r\)-term approximations almost always exist in finite dimensions, Guarantees of Riemannian optimization for low rank matrix completion, Enhanced image approximation using shifted rank-1 reconstruction, An alternating minimization method for matrix completion problems, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Entrywise eigenvector analysis of random matrices with low expected rank, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, On the spectra of general random mixed graphs, Convergence of projected Landweber iteration for matrix rank minimization, Fixed-rank matrix factorizations and Riemannian low-rank optimization, Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach, Superresolution 2D DOA estimation for a rectangular array via reweighted decoupled atomic norm minimization, Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization, Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements, Structured matrix estimation and completion, Nonparametric estimation of low rank matrix valued function, Stable als approximation in the TT-format for rank-adaptive tensor completion, On the nuclear norm heuristic for a Hankel matrix completion problem, 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, Parallel stochastic gradient algorithms for large-scale matrix completion, Low rank tensor recovery via iterative hard thresholding, Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm, Noncommutative Bennett and Rosenthal inequalities, RIPless compressed sensing from anisotropic measurements, Asymptotic equivalence of quantum state tomography and noisy matrix completion, Noisy low-rank matrix completion with general sampling distribution, Matrix concentration inequalities via the method of exchangeable pairs, An introduction to a class of matrix cone programming, Collaborative filtering with information-rich and~information-sparse entities, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, Phase retrieval from coded diffraction patterns
