Parallel stochastic gradient algorithms for large-scale matrix completion
From MaRDI portal
Publication:2392935
DOI10.1007/S12532-013-0053-8zbMATH Open1275.90039OpenAlexW2105767123MaRDI QIDQ2392935FDOQ2392935
Benjamin Recht, Christopher Re
Publication date: 5 August 2013
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-013-0053-8
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor Decompositions and Applications
- Exact matrix completion via convex optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Monotone Operators and the Proximal Point Algorithm
- Matrix Completion From a Few Entries
- Fixed point and Bregman iterative methods for matrix rank minimization
- Approximating the Cut-Norm via Grothendieck's Inequality
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Local minima and convergence in low-rank semidefinite programming
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A Simpler Approach to Matrix Completion
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Learning Theory
Cited In (37)
- Multilevel Stochastic Gradient Methods for Nested Composition Optimization
- Enabling numerically exact local solver for waveform inversion -- a low-rank approach
- Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world?
- Robust principal component analysis using facial reduction
- Inexact coordinate descent: complexity and preconditioning
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- On the rates of convergence of parallelized averaged stochastic gradient algorithms
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
- A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- A Continuous-Time Analysis of Distributed Stochastic Gradient
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- Linear feature transform and enhancement of classification on deep neural network
- A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution
- Spectral gap in random bipartite biregular graphs and applications
- Decentralized and privacy-preserving low-rank matrix completion
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
- Convergence Rate of Incremental Gradient and Incremental Newton Methods
- Matrix completion from a computational statistics perspective
- Optimization landscape of Tucker decomposition
- The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems
- Title not available (Why is that?)
- Block mirror stochastic gradient method for stochastic optimization
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- Random-reshuffled SARAH does not need full gradient computations
- Why random reshuffling beats stochastic gradient descent
- Approximate matrix completion based on cavity method
- Title not available (Why is that?)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
- A Riemannian gossip approach to subspace learning on Grassmann manifold
- Matrix recipes for hard thresholding methods
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- T-product factorization based method for matrix and tensor completion problems
- Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
Uses Software
Recommendations
- Parallel matrix factorization for low-rank tensor completion 👍 👎
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm 👍 👎
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties 👍 👎
- Stochastic Gradients for Large-Scale Tensor Decomposition 👍 👎
- Parallel and distributed asynchronous adaptive stochastic gradient methods 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Parallel stochastic gradient algorithms for large-scale matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392935)
