Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (Q2397263): Difference between revisions

@@ Property / cites work @@
+Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
+Normal rank
@@ Property / cites work @@
+Prediction, Learning, and Games
@@ Property / cites work: Prediction, Learning, and Games / rank @@
+Normal rank
@@ Property / cites work @@
+Online Learning and Online Convex Optimization
@@ Property / cites work: Online Learning and Online Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
+Normal rank
@@ Property / cites work @@
+On Martingale Extensions of Vapnik–Chervonenkis Theory with Applications to Online Learning
+Normal rank
@@ Property / cites work @@
+Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
+Normal rank
@@ Property / cites work @@
+Q3967357
@@ Property / cites work: Q3967357 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921693
@@ Property / cites work: Q2921693 / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual subgradient methods for convex problems
+Normal rank
@@ Property / cites work @@
+Q2756809
@@ Property / cites work: Q2756809 / rank @@
+Normal rank