Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning
원문 초록
In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-order case, we propose a framework of transition from deterministic or semi-deterministic to stochastic quadratic regularization methods. We leverage the two-phase nature of stochastic optimization to propose a novel first-order algorithm with adaptive sampling and adaptive step size. In the second-order case, we propose a novel stochastic damped L-BFGS method that improves on previous algorithms in the highly nonconvex context of deep learning. Both algorithms are evaluated on well-known deep learning datasets and exhibit promising performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Semantic Token Communication for Transformer-based Edge Inference
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
JaxSGMC: Modular stochastic gradient MCMC in JAX
SIM-Shapley: A Stable and Computationally Efficient Approach to Shapley Value Approximation
Adversarial Subspace Generation for Outlier Detection in High-Dimensional Data
CatCMA with Margin: Stochastic Optimization for Continuous, Integer, and Categorical Variables
토론
이 논문과 연결된 포럼 글이 아직 없습니다.