Low-rank matrix completion using alternating minimization
From MaRDI portal
Publication:5495837
DOI10.1145/2488608.2488693zbMath1293.65073arXiv1212.0467OpenAlexW2106005123WikidataQ63694323 ScholiaQ63694323MaRDI QIDQ5495837
Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.0467
Related Items
Low Permutation-rank Matrices: Structural Properties and Noisy Completion, Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA, Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery, Unnamed Item, Sharp global convergence guarantees for iterative nonconvex optimization with random data, Robust sensing of low-rank matrices with non-orthogonal sparse decomposition, Tensor completion with noisy side information, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Unnamed Item, Inference for low-rank models, Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals, Recent Theoretical Advances in Non-Convex Optimization, Matrix completion based on Gaussian parameterized belief propagation, Matrix Denoising for Weighted Loss Functions and Heterogeneous Signals, The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems, Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably, Matrix completion via minimizing an approximate rank, Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion, Generalized approximate survey propagation for high-dimensional estimation *, Unnamed Item, Approximate matrix completion based on cavity method, Heteroskedastic PCA: algorithm, optimality, and applications, Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, Low-rank matrix recovery with Ky Fan 2-\(k\)-norm, Alternating DC algorithm for partial DC programming problems, Multi-target prediction for dummies using two-branch neural networks, A quadratically convergent algorithm for structured low-rank approximation, Role of sparsity and structure in the optimization landscape of non-convex matrix sensing, Noisy tensor completion via the sum-of-squares hierarchy, Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study, Enhanced alternating energy minimization methods for stochastic Galerkin matrix equations, Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, Unnamed Item, Matrix completion discriminant analysis, Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation, Matrix completion methods for the total electron content video reconstruction, Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements, Guarantees of Riemannian optimization for low rank matrix completion, Enhanced image approximation using shifted rank-1 reconstruction, Optimal prediction in the linearly transformed spiked model, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, The local convexity of solving systems of quadratic equations, A divide-and-conquer algorithm for binary matrix completion, Unnamed Item, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Fundamental limits of weak recovery with applications to phase retrieval, A gradual rank increasing process for matrix completion, Weighted nuclear norm minimization and its applications to low level vision, Unnamed Item, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Entrywise eigenvector analysis of random matrices with low expected rank, Characterization of sampling patterns for low-tt-rank tensor retrieval, Accelerated low rank matrix approximate algorithms for matrix completion, Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis, Adaptive confidence sets for matrix completion, Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems, An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, Multi-target prediction: a unifying view on problems and methods, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation, The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion, Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling, One-bit tensor completion via transformed tensor singular value decomposition, A Comparative Study of Pairwise Learning Methods Based on Kernel Ridge Regression, Adapting Regularized Low-Rank Models for Parallel Architectures, Matrix completion under interval uncertainty, Fast rank-one alternating minimization algorithm for phase retrieval, Sparse power factorization: balancing peakiness and sample complexity, Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm, Unnamed Item, Unnamed Item, A geometric analysis of phase retrieval, Sparse functional identification of complex cells from spike times and the decoding of visual stimuli, Riemannian gradient descent methods for graph-regularized matrix completion, Structural Variability from Noisy Tomographic Projections, A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds, Quartic first-order methods for low-rank minimization, Reduction of nonlinear embedded boundary models for problems with evolving interfaces, Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach, Ranking recovery from limited pairwise comparisons using low-rank matrix completion, Collaborative filtering with information-rich and~information-sparse entities, Inductive matrix completion with feature selection, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Flexible low-rank statistical modeling with missing data and side information, Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization, Majorized proximal alternating imputation for regularized rank constrained matrix completion, Low-Rank Spectral Optimization via Gauge Duality, Learning the truth vector in high dimensions, Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization, Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers, Provable accelerated gradient method for nonconvex low rank optimization, Community detection with dependent connectivity, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Dynamic Assortment Personalization in High Dimensions, DANTE: deep alternations for training neural networks, A new method based on the manifold-alternative approximating for low-rank matrix completion, Matrix completion for cost reduction in finite element simulations under hybrid uncertainties, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion, Toeplitz matrix completion via a low-rank approximation algorithm, Accelerated Alternating Projections for Robust Principal Component Analysis, Efficient Matrix Sensing Using Rank-1 Gaussian Measurements, An adaptation for iterative structured matrix completion, Unnamed Item, Unnamed Item, Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Stable als approximation in the TT-format for rank-adaptive tensor completion, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, Unnamed Item, Iterative Methods for Solving Factorized Linear Systems, A partial derandomization of phaselift using spherical designs, Unnamed Item, Unnamed Item, Proof methods for robust low-rank matrix recovery
