Sample complexity analysis for adaptive optimization algorithms with stochastic oracles
From MaRDI portal
Cites work
- A stochastic line search method with expected complexity analysis
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
- Complexity and global rates of trust-region methods based on probabilistic models
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Optimization methods for large-scale machine learning
- Rejection of Outliers
Cited in
(7)- A stochastic quasi-Newton method in the absence of common random numbers
- Complexity guarantees for nonconvex Newton-MR under inexact Hessian information
- Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
- Complexity of zeroth- and first-order stochastic trust-region algorithms
- Design guidelines for noise-tolerant optimization with applications in robust design
- Stochastic ISTA/FISTA adaptive step search algorithms for convex composite optimization
- A survey of trust-region radius update mechanisms. Part I: First-order 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)
