Pages that link to "Item:Q5396731"

The following pages link to A Simpler Approach to Matrix Completion (Q5396731):

Displaying 50 items.

• Optimal large-scale quantum state tomography with Pauli measurements (Q282466) (← links)
• A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
• Matrix completion via max-norm constrained optimization (Q302432) (← links)
• Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
• A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
• On tensor completion via nuclear norm minimization (Q330103) (← links)
• A graphical approach to the analysis of matrix completion (Q335673) (← links)
• On statistics, computation and scalability (Q373533) (← 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)
• A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion (Q503487) (← links)
• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• Degrees of freedom in low rank matrix estimation (Q525906) (← links)
• Estimation of high-dimensional low-rank matrices (Q548539) (← links)
• Some empirical advances in matrix completion (Q548919) (← links)
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion (Q661157) (← links)
• Max-norm optimization for robust matrix recovery (Q681486) (← 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)
• The spectra of multiplicative attribute graphs (Q741499) (← links)
• Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
• A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery (Q820791) (← links)
• Local convergence of an algorithm for subspace identification from partial data (Q887156) (← links)
• Matrix completion by singular value thresholding: sharp bounds (Q887273) (← links)
• Low-rank diffusion matrix estimation for high-dimensional time-changed Lévy processes (Q1621717) (← links)
• A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
• Matrix completion discriminant analysis (Q1663150) (← links)
• Double instrumental variable estimation of interaction models with big data (Q1676366) (← links)
• Adaptive confidence sets for matrix completion (Q1708972) (← links)
• Cross: efficient low-rank tensor completion (Q1731066) (← links)
• Noise-tolerance matrix completion for location recommendation (Q1741358) (← links)
• Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
• Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
• Accelerated linearized Bregman method (Q1945379) (← links)
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← 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)
• Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Q1990969) (← links)
• On polynomial time methods for exact low-rank tensor completion (Q2007852) (← links)
• Low-rank matrix completion in a general non-orthogonal basis (Q2032243) (← links)
• Ranking recovery from limited pairwise comparisons using low-rank matrix completion (Q2036498) (← links)
• New applications of matrix methods (Q2038478) (← links)
• Active matrix factorization for surveys (Q2044242) (← links)
• Matrix optimization based Euclidean embedding with outliers (Q2044470) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• An adaptation for iterative structured matrix completion (Q2072669) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• On the robustness of minimum norm interpolators and regularized empirical risk minimizers (Q2091842) (← links)