More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
Not on the map. Why?
Abstract (arXiv)
Fractional-order stochastic gradient descent (FOSGD) leverages fractional exponents to capture long-memory effects in optimization. However, its utility is often limited by the difficulty of tuning and stabilizing these exponents. We propose 2SED Fractional-Order Stochastic Gradient Descent (2SEDFOSGD), which integrates the Two-Scale Effective Dimension (2SED) algorithm with FOSGD to adapt the fractional exponent in a data-driven manner. By tracking model sensitivity and effective dimensionality, 2SEDFOSGD dynamically modulates the exponent to mitigate oscillations and hasten convergence. Theoretically, for onoconvex optimization problems, this approach preserves the advantages of fractional memory without the sluggish or unstable behavior observed in na"ive fractional SGD. Empirical evaluations in Gaussian and α-stable noise scenarios using an autoregressive (AR) model highlight faster convergence and more robust parameter estimates compared to baseline methods, underscoring the potential of dimension-aware fractional techniques for advanced modeling and estimation tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 17 references that are in the map. First posted on arXiv 5 May 2025.
Builds on
6 of 17 references.
References · 6
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 100
- 2018Universal Statistics of Fisher Information in Deep Neural Networks: Mean Field Approachcited by 91
- 2019Convolutional neural networks with fractional order gradient methodcited by 9
- 2024A Two-Scale Complexity Measure for Deep Learning Modelscited by 3
Built on by
Not cited yet.