Pages that link to "Item:Q5281038"

The following pages link to Recovering Low-Rank Matrices From Few Coefficients in Any Basis (Q5281038):

Displaying 50 items.

• Optimal large-scale quantum state tomography with Pauli measurements (Q282466) (← links)
• Matrix completion via max-norm constrained optimization (Q302432) (← links)
• A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
• Estimation of low rank density matrices: bounds in Schatten norms and other distances (Q315410) (← links)
• On tensor completion via nuclear norm minimization (Q330103) (← links)
• An improved robust ADMM algorithm for quantum state tomography (Q332021) (← links)
• A graphical approach to the analysis of matrix completion (Q335673) (← links)
• Mini-workshop: Mathematical physics meets sparse recovery. Abstracts from the mini-workshop held April 13--19, 2014. (Q347198) (← links)
• Improved recovery guarantees for phase retrieval from coded diffraction patterns (Q347510) (← links)
• Low rank matrix recovery from rank one measurements (Q347516) (← links)
• Low rank estimation of smooth kernels on graphs (Q355091) (← links)
• High-dimensional covariance matrix estimation with missing observations (Q395991) (← links)
• Uniqueness conditions for low-rank matrix recovery (Q442534) (← links)
• Von Neumann entropy penalization and low-rank matrix estimation (Q449975) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• Pseudo-Bayesian quantum tomography with rank-adaptation (Q511674) (← links)
• Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
• Generalized sampling and infinite-dimensional compressed sensing (Q515987) (← links)
• Degrees of freedom in low rank matrix estimation (Q525906) (← links)
• Estimation of high-dimensional low-rank matrices (Q548539) (← links)
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion (Q661157) (← links)
• Concentration inequalities for matrix martingales in continuous time (Q681530) (← links)
• Robust matrix completion (Q682808) (← links)
• User-friendly tail bounds for sums of random matrices (Q695625) (← links)
• Uniform recovery of fusion frame structured sparse signals (Q739459) (← links)
• The spectra of multiplicative attribute graphs (Q741499) (← links)
• Local convergence of an algorithm for subspace identification from partial data (Q887156) (← links)
• Matrix completion by singular value thresholding: sharp bounds (Q887273) (← links)
• Adaptive multinomial matrix completion (Q902226) (← links)
• A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
• Infinite-dimensional compressed sensing and function interpolation (Q1656376) (← links)
• A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
• Double instrumental variable estimation of interaction models with big data (Q1676366) (← links)
• Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization (Q1696370) (← links)
• Adaptive confidence sets for matrix completion (Q1708972) (← links)
• Compressed sensing with structured sparsity and structured acquisition (Q1713639) (← links)
• Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices (Q1714845) (← links)
• Low-rank matrix recovery using Gabidulin codes in characteristic zero (Q1743301) (← links)
• Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
• Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
• Regularization and the small-ball method. I: Sparse recovery (Q1750281) (← links)
• Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
• Error bounds for rank constrained optimization problems and applications (Q1790190) (← links)
• Robust group lasso: model and recoverability (Q1790464) (← links)
• Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
• Accelerated linearized Bregman method (Q1945379) (← links)
• Rank penalized estimators for high-dimensional matrices (Q1952222) (← links)
• Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
• Phase retrieval from Fourier measurements with masks (Q1983452) (← links)