Pages that link to "Item:Q2397263"

The following pages link to Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (Q2397263):

Displaying 19 items.

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