Gradient Descent Efficiency Index
Aviral Dhingra

TL;DR
This paper introduces the Ek efficiency index to evaluate gradient descent iterations, helping to identify optimal stopping points and improve training efficiency in resource-limited settings.
Contribution
The study proposes a novel efficiency metric, Ek, that measures iteration effectiveness by considering error change and stability, aiding in optimization and model comparison.
Findings
Ek correlates with convergence behavior across datasets
It helps identify optimal stopping points in training
The index enhances decision-making in resource-constrained environments
Abstract
Gradient descent is a widely used iterative algorithm for finding local minima in multivariate functions. However, the final iterations often either overshoot the minima or make minimal progress, making it challenging to determine an optimal stopping point. This study introduces a new efficiency metric, Ek, designed to quantify the effectiveness of each iteration. The proposed metric accounts for both the relative change in error and the stability of the loss function across iterations. This measure is particularly valuable in resource-constrained environments, where costs are closely tied to training time. Experimental validation across multiple datasets and models demonstrates that Ek provides valuable insights into the convergence behavior of gradient descent, complementing traditional performance metrics. The index has the potential to guide more informed decisions in the selection…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Face and Expression Recognition · Gaussian Processes and Bayesian Inference
