scientific article; zbMATH DE number 7307474
From MaRDI portal
Publication:5149233
Bin Gu, Heng Huang, Zhouyuan Huo, Cheng Deng, Wenhan Xian
Publication date: 8 February 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-434.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic optimizationvariance reductionproximal operatorhard thresholding\(q\)-memorizationasynchronous parallel computing
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing finite sums with the stochastic average gradient
- Iteration complexity analysis of block coordinate descent methods
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- A Tight Bound of Hard Thresholding
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
- Improved asynchronous parallel optimization analysis for stochastic incremental methods
- Sparse Approximate Solutions to Linear Systems
- Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
- A Proximal Stochastic Gradient Method with Progressive Variance Reduction
This page was built for publication:
