High probability complexity bounds for adaptive step search based on stochastic oracles
From MaRDI portal
Publication:6573017
Recommendations
- A stochastic line search method with expected complexity analysis
- High-probability complexity bounds for non-smooth stochastic convex optimization with heavy-tailed noise
- Random gradient-free minimization of convex functions
- scientific article; zbMATH DE number 3887444
- Probabilistic line searches for stochastic optimization
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- A stochastic line search method with expected complexity analysis
- A theoretical and empirical comparison of gradient approximations in derivative-free 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
- High-dimensional probability. An introduction with applications in data science
- Introductory lectures on convex optimization. A basic course.
- Optimization methods for large-scale machine learning
- Random gradient-free minimization of convex functions
- Weighted sums of certain dependent random variables
This page was built for publication: High probability complexity bounds for adaptive step search based on stochastic oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573017)
