Parallel stochastic gradient algorithms for large-scale matrix completion
From MaRDI portal
Publication:2392935
Recommendations
- Parallel matrix factorization for low-rank tensor completion
- Parallel and distributed asynchronous adaptive stochastic gradient methods
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- scientific article; zbMATH DE number 6379366
- Stochastic gradients for large-scale tensor decomposition
- scientific article; zbMATH DE number 741173
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
Cites work
- scientific article; zbMATH DE number 1305418 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- A New Class of Incremental Gradient Methods for Least Squares Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A simpler approach to matrix completion
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Approximating the Cut-Norm via Grothendieck's Inequality
- Benchmarking optimization software with performance profiles.
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Learning Theory
- Local minima and convergence in low-rank semidefinite programming
- Matrix Completion From a Few Entries
- Monotone Operators and the Proximal Point Algorithm
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Robust Stochastic Approximation Approach to Stochastic Programming
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Tensor Decompositions and Applications
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(40)- 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?
- Inexact coordinate descent: complexity and preconditioning
- Robust principal component analysis using facial reduction
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- On the rates of convergence of parallelized averaged stochastic gradient algorithms
- A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Distributed matrix completion and robust factorization
- On the efficiency of random permutation for ADMM and coordinate descent
- A Continuous-Time Analysis of Distributed Stochastic Gradient
- Linear feature transform and enhancement of classification on deep neural network
- A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- Spectral gap in random bipartite biregular graphs and applications
- Decentralized and privacy-preserving low-rank matrix completion
- Block stochastic gradient iteration for convex and nonconvex optimization
- Matrix completion from a computational statistics perspective
- Optimization landscape of Tucker decomposition
- Multilevel stochastic gradient methods for nested composition optimization
- \textsc{OCam}: out-of-core coordinate descent algorithm for matrix completion
- Block mirror stochastic gradient method for stochastic optimization
- LIBMF: a library for parallel matrix factorization in shared-memory systems
- Why random reshuffling beats stochastic gradient descent
- Random-reshuffled SARAH does not need full gradient computations
- Approximate matrix completion based on cavity method
- The alternating descent conditional gradient method for sparse inverse problems
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Convergence rate of incremental gradient and incremental Newton methods
- scientific article; zbMATH DE number 7306912 (Why is no real title available?)
- A Riemannian gossip approach to subspace learning on Grassmann manifold
- Matrix recipes for hard thresholding methods
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
- 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
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Rank determination for low-rank data completion
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
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)
