Logarithmic regret algorithms for online convex optimization (Q1009221)

From MaRDI portal
Revision as of 17:27, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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