Accelerated Gradient Descent for Faster Convergence with Minimal Overhead

Manuel Graca, L. Miguel Silveira, Arlindo Oliveira, Frank Liu
5/15/2026
cs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{graca2026accelerated,
  title  = {Accelerated Gradient Descent for Faster Convergence with Minimal Overhead},
  author = {Manuel Graca and L. Miguel Silveira and Arlindo Oliveira and Frank Liu},
  year   = {2026},
  eprint = {2605.16017},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2605.16017v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2605.16017.svg)](https://codeofpaper.com/paper/2605.16017)

Discussion