Lower bounds on individual sequence regret (Q285930): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online trading algorithms and robust option pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret to the Best vs. Regret to the Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Individual Sequence Regret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting certainty from uncertainty: regret bounded by variation in costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking / rank
 
Normal rank

Latest revision as of 01:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on individual sequence regret
scientific article

    Statements

    Lower bounds on individual sequence regret (English)
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    regret minimization
    0 references
    online learning
    0 references
    online linear optimization
    0 references
    regret lower bounds
    0 references
    regularized follow-the-leader
    0 references

    Identifiers