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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Learning and Online Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Martingale Extensions of Vapnik–Chervonenkis Theory with Applications to Online Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756809 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:14, 13 July 2024

scientific article
Language Label Description Also known as
English
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
scientific article

    Statements

    Identifiers