scientific article; zbMATH DE number 6982318
From MaRDI portal
Publication:4558169
convex optimizationempirical risk minimizationimportance samplingminibatchingvariance-reduced methods
Cites work
- A proximal stochastic gradient method with progressive variance reduction
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A Stochastic Approximation Method
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Accelerated, parallel, and proximal coordinate descent
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- Coordinate descent with arbitrary sampling. II: Expected separable overapproximation.
- Distributed coordinate descent method for learning with big data
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Erratum to: ``Minimizing finite sums with the stochastic average gradient
- scientific article; zbMATH DE number 6253925 (Why is no real title available?)
- Hybrid deterministic-stochastic methods for data fitting
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Large-scale machine learning with stochastic gradient descent
- On optimal probabilities in stochastic coordinate descent methods
- Parallel coordinate descent methods for big data optimization
- Pegasos: primal estimated sub-gradient solver for SVM
- Semi-stochastic coordinate descent
- Stochastic dual coordinate ascent methods for regularized loss minimization
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Stochastic primal-dual coordinate method for regularized empirical risk minimization
Cited in
(14)- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
- SelectNet: self-paced learning for high-dimensional partial differential equations
- Batched Stochastic Gradient Descent with Weighted Sampling
- On Adaptive Sketch-and-Project for Solving Linear Systems
- scientific article; zbMATH DE number 5263157 (Why is no real title available?)
- Adaptive coordinate sampling for stochastic primal–dual optimization
- Improving sampling accuracy of stochastic gradient MCMC methods via non-uniform subsampling of gradients
- Importance Sampling for Minibatches
- Efficient exponential tilting with applications
- Stochastic average model methods
- Adaptive client sampling in federated learning via online learning with bandit feedback
- Sampling and update frequencies in proximal variance-reduced stochastic gradient methods
- Targeted stochastic gradient MCMC for HMMs with rare latent states
- Efficient training of deep networks using guided spectral data selection: a step toward learning what you need
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 Q4558169)
