Scaling up stochastic gradient descent for non-convex optimisation

Stochastic gradient descent (SGD) is a widely adopted iterative method for optimizing differentiable objective functions. In this paper, we propose and discuss a novel approach to scale up SGD in applications involving non-convex functions and large datasets. We address the bottleneck problem arisin...

Full description

Saved in:

Bibliographic Details
Published in:	Machine learning Vol. 111; no. 11; pp. 4039 - 4079
Main Authors:	Mohamad, Saad, Alamri, Hamad, Bouchachia, Abdelhamid
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2022 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Comparative studies Computation Computer Science Control Convergence Deep learning Dirichlet problem Distributed memory Empirical analysis Iterative methods Machine Learning Mechatronics Natural Language Processing (NLP) Optimization Robotics Scaling up Simulation and Modeling Special Issue: Foundations of Data Science Statistical models Deep reinforcement learning Distributed and parallel computation Stochastic gradient descent Variational inference Large scale non-convex optimisation
ISSN:	0885-6125, 1573-0565
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!