3 papers
math.ST2026
Complexity reduction in online stochastic Newton methods with potential O(N d) total cost
Antoine Godichon-Baggioni, Bruno Portier, Guillaume Sallé
Optimizing smooth convex functions in stochastic settings, where only noisy estimates of gradients and Hessians are available, is a fundamental problem in optimization. While first…
math.OC2025
Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
Antoine Godichon-Baggioni, Wei Lu, Bruno Portier
This paper addresses second-order stochastic optimization for estimating the minimizer of a convex function written as an expectation. A direct recursive estimation technique for t…
math.ST2025
A Full Adagrad algorithm with O(Nd) operations
Antoine Godichon-Baggioni, Wei Lu, Bruno Portier
A novel approach is given to overcome the computational challenges of the full-matrix Adaptive Gradient algorithm (Full AdaGrad) in stochastic optimization. By developing a recursi…