Pages that link to "Item:Q2392935"
From MaRDI portal
The following pages link to Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935):
Displayed 19 items.
- Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world? (Q262369) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- Linear feature transform and enhancement of classification on deep neural network (Q1785494) (← links)
- Matrix recipes for hard thresholding methods (Q2251217) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- A Riemannian gossip approach to subspace learning on Grassmann manifold (Q2320541) (← links)
- Enabling numerically exact local solver for waveform inversion -- a low-rank approach (Q2321974) (← links)
- A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution (Q2340879) (← links)
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold (Q2347362) (← links)
- Decentralized and privacy-preserving low-rank matrix completion (Q2516374) (← links)
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
- Multilevel Stochastic Gradient Methods for Nested Composition Optimization (Q4629336) (← links)
- (Q4637013) (← links)
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
- Convergence Rate of Incremental Gradient and Incremental Newton Methods (Q5237308) (← links)
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion (Q5251927) (← links)
- The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)