




















Abstract:In this paper, we present CT-AGD (Curvature-Tuned Accelerated Gradient Descent), an optimization method for non-convex optimization problems in deep learning training tasks. CT-AGD is a general boosting procedure that accelerates first-order methods by explicitly capturing the local curvature using finite-difference quotients, and the development of heuristics aimed at mitigating noise and bias introduced by stochastic mini-batch training. CT-AGD has a comparable storage and computational overhead as adaptive gradient methods such as Adam. Our extensive experiments demonstrate that CT-AGD achieves the same level of accuracy as the baseline first-order methods, yet reduces the required training epochs by 33% on average.
| Comments: | 17 pages |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.16017 [cs.LG] |
| (or arXiv:2605.16017v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.16017 arXiv-issued DOI via DataCite (pending registration) |
From: Frank Liu [view email]
[v1]
Fri, 15 May 2026 14:50:39 UTC (916 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。