scientific article; zbMATH DE number 7255141
From MaRDI portal
Publication:4969178
Dzung T. Phan, Lam M. Nguyen, Quoc Tran Dinh, Nhan H. Pham
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1902.05679
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
variance reductionfinite-sum minimizationcomposite nonconvex optimizationexpectation minimizationstochastic proximal gradient descent
Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, Accelerating mini-batch SARAH by step size rules, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, Finite-sum smooth optimization with SARAH, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, A stochastic primal-dual method for a class of nonconvex constrained optimization, A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization, Variance reduction on general adaptive stochastic mirror descent, A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize, Block mirror stochastic gradient method for stochastic optimization, A line search based proximal stochastic gradient algorithm with dynamical variance reduction, Accelerated doubly stochastic gradient descent for tensor CP decomposition, Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization, Proximal stochastic recursive momentum algorithm for nonsmooth nonconvex optimization problems, Accelerated stochastic variance reduction for a class of convex optimization problems, Unnamed Item, Unnamed Item, ProxSARAH, MultiLevel Composite Stochastic Optimization via Nested Variance Reduction, Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization, Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization, Inexact SARAH algorithm for stochastic optimization, A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization, A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization, Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction, Accelerating variance-reduced stochastic gradient methods, A hybrid stochastic optimization framework for composite nonconvex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing finite sums with the stochastic average gradient
- Introductory lectures on convex optimization. A basic course.
- Cubic regularization of Newton method and its global performance
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Lectures on Stochastic Programming
- Robust Stochastic Approximation Approach to Stochastic Programming
- Optimization Methods for Large-Scale Machine Learning
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Katyusha: the first direct acceleration of stochastic gradient methods
- A Proximal Stochastic Gradient Method with Progressive Variance Reduction
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- A Stochastic Approximation Method
- Convex analysis and monotone operator theory in Hilbert spaces
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
