scientific article; zbMATH DE number 7307474
From MaRDI portal
Publication:5149233
Authors: Bin Gu, Wenhan Xian, Zhouyuan Huo, Cheng Deng, Heng Huang 
Publication date: 8 February 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-434.html
Title of this publication is not available (Why is that?)
Recommendations
- Asynchronous stochastic approximation and Q-learning
- The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Asynchronous Stochastic Approximations With Asymptotically Biased Errors and Deep Multiagent Learning
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- Asynchronous Distributed Optimization Via Randomized Dual Proximal Gradient
- Parallel and distributed asynchronous adaptive stochastic gradient methods
variance reductionstochastic optimizationproximal operatorhard thresholding\(q\)-memorizationasynchronous parallel computing
Cites Work
- Title not available (Why is that?)
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- A proximal stochastic gradient method with progressive variance reduction
- Learning with the maximum correntropy criterion induced losses for regression
- Large-scale machine learning with stochastic gradient descent
- Iteration complexity analysis of block coordinate descent methods
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Minimizing finite sums with the stochastic average gradient
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
- A tight bound of hard thresholding
- Ramp loss linear programming support vector machine
- Perturbed iterate analysis for asynchronous stochastic optimization
- Improved asynchronous parallel optimization analysis for stochastic incremental methods
Cited In (1)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149233)
