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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:57, 2 February 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
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (English)
0 references
22 May 2017
0 references
online optimization
0 references
gradient-free
0 references
inexact oracle
0 references
stochastic optimization
0 references
