Stochastic Gradient Descent
Stochastic Gradient Descent (SGD) is an iterative optimization algorithm used to find the minimum of a function, particularly useful in machine learning for training large models where computing the exact gradient is computationally prohibitive. Current research focuses on improving SGD's efficiency and convergence properties, exploring variations like Adam, incorporating techniques such as momentum, adaptive learning rates, and line search methods, and analyzing its behavior in high-dimensional and non-convex settings. These advancements are crucial for training complex models like deep neural networks and improving the performance of various machine learning applications, impacting fields ranging from natural language processing to healthcare.
Papers
Shuffling Momentum Gradient Algorithm for Convex Optimization
Trang H. Tran, Quoc Tran-Dinh, Lam M. Nguyen
SOFIM: Stochastic Optimization Using Regularized Fisher Information Matrix
Mrinmay Sen, A. K. Qin, Gayathri C, Raghu Kishore N, Yen-Wei Chen, Balasubramanian Raman
SGD with Partial Hessian for Deep Neural Networks Optimization
Ying Sun, Hongwei Yong, Lei Zhang