Sample complexity analysis for adaptive optimization algorithms with stochastic oracles

DOI10.1007/S10107-024-02078-ZMaRDI QIDQ6665393

Katya Scheinberg, Miaolan Xie, Billy Jin

Publication date: 17 January 2025

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

stochastic optimizationnonlinear optimizationadaptive algorithmsample complexityhigh probabilitystochastic oracles

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
• A theoretical and empirical comparison of gradient approximations in derivative-free optimization
• Rejection of Outliers
• Complexity and global rates of trust-region methods based on probabilistic models
• ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization
• Optimization Methods for Large-Scale Machine Learning
• Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
• A Stochastic Line Search Method with Expected Complexity Analysis

This page was built for publication: Sample complexity analysis for adaptive optimization algorithms with stochastic oracles

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