Adaptive gradient-free method for stochastic optimization
From MaRDI portal
Recommendations
- On the adaptivity of stochastic gradient-based optimization
- A heuristic adaptive fast gradient method in stochastic optimization problems
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
- Adaptive sampling strategies for stochastic optimization
- An adaptive gradient method with energy and momentum
Cites work
- A heuristic adaptive fast gradient method in stochastic optimization problems
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
- Adaptive subgradient methods for online learning and stochastic optimization
- Choice of finite-difference schemes in solving coefficient inverse problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Introduction to Stochastic Search and Optimization
- Scaling up the randomized gradient-free adversarial attack reveals overestimation of robustness using established attacks
- Stochastic global optimization.
Cited in
(3)
This page was built for publication: Adaptive gradient-free method for stochastic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054162)
