Logarithmic regret algorithms for online convex optimization (Q1009221): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:16, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logarithmic regret algorithms for online convex optimization |
scientific article |
Statements
Logarithmic regret algorithms for online convex optimization (English)
0 references
31 March 2009
0 references
online learning
0 references
online optimization
0 references
regret minimization
0 references
portfolio management
0 references
