Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case

Related Items (19)

Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises ⋮ Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference ⋮ Improved exploitation of higher order smoothness in derivative-free optimization ⋮ An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization ⋮ Primal-dual mirror descent method for constraint stochastic optimization problems ⋮ Gradient-free federated learning methods with \(l_1\) and \(l_2\)-randomization for non-smooth convex stochastic optimization problems ⋮ Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact ⋮ Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs ⋮ Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization ⋮ Unifying framework for accelerated randomized methods in convex optimization ⋮ Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points ⋮ An accelerated directional derivative method for smooth stochastic convex optimization ⋮ Accelerated directional search with non-Euclidean prox-structure ⋮ Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem ⋮ Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems ⋮ A new one-point residual-feedback oracle for black-box learning and control ⋮ Derivative-free optimization methods ⋮ Noisy zeroth-order optimization for non-smooth saddle point problems ⋮ One-point gradient-free methods for smooth and non-smooth saddle-point problems

Cites Work

This page was built for publication: Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case