Improving the convergence rates of forward gradient descent with repeated sampling

DOI10.1093/IMAIAI/IAAG035MaRDI QIDQ7396051zbMATH OpenFDO

Authors Niklas Dexheimer, Johannes Schmidt-Hieber

Publication date 2026

Published in Information and Inference (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/IMAIAI/IAAG035

Mathematics Subject Classification ID

Stochastic approximation (62L20) Numerical analysis (65-XX)

Cites work

• Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
• Concentration inequalities and moment bounds for sample covariance operators
• Convergence guarantees for forward gradient descent in the linear regression model
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 7306907 (Why is no real title available?)
• Introduction to Derivative-Free Optimization
• Is learning in biological neural networks based on stochastic gradient descent? An analysis using stochastic processes
• Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
• Nonparametric stochastic approximation with large step-sizes
• Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
• Random gradient-free minimization of convex functions

This page was built for publication: Improving the convergence rates of forward gradient descent with repeated sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396051)