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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6582796 / rank
 
Normal rank
Property / zbMATH Keywords
 
regret minimization
Property / zbMATH Keywords: regret minimization / rank
 
Normal rank
Property / zbMATH Keywords
 
online learning
Property / zbMATH Keywords: online learning / rank
 
Normal rank
Property / zbMATH Keywords
 
online linear optimization
Property / zbMATH Keywords: online linear optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
regret lower bounds
Property / zbMATH Keywords: regret lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
regularized follow-the-leader
Property / zbMATH Keywords: regularized follow-the-leader / rank
 
Normal rank
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-015-5531-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2275626685 / 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: 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
links / mardi / namelinks / mardi / name
 

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