Logarithmic regret algorithms for online convex optimization (Q1009221): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10994-007-5016-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129160848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal portfolios with and without transaction costs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating Sequential Processes. The First 25 Years / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic nonstationary optimization for finding universal portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative loss bounds for multidimensional regression problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for minimizing convex functions over convex sets / rank
 
Normal rank

Latest revision as of 10:06, 1 July 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
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    online learning
    0 references
    online optimization
    0 references
    regret minimization
    0 references
    portfolio management
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references