Online Learning over a Finite Action Set with Limited Switching (Q4991672): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W3085291675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret in Online Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online linear optimization and adaptive routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Regret With Label Efficient Prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use expert advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandits with switching costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Walk Perturbations for Online Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision-theoretic generalization of on-line learning and an application to boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic huffman coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Learning with Semi-bandit Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Learning and Online Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nearly as well as the best pruning of a planar decision graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041424328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Decision Processes with Arbitrary Reward Processes / rank
 
Normal rank

Latest revision as of 21:08, 25 July 2024

scientific article; zbMATH DE number 7354637
Language Label Description Also known as
English
Online Learning over a Finite Action Set with Limited Switching
scientific article; zbMATH DE number 7354637

    Statements

    Online Learning over a Finite Action Set with Limited Switching (English)
    0 references
    0 references
    0 references
    3 June 2021
    0 references
    online learning
    0 references
    prediction from experts
    0 references
    adversarial multiarmed bandits
    0 references
    switching costs
    0 references
    switching budgets
    0 references
    online combinatorial optimization
    0 references
    high-probability algorithms
    0 references
    minimax optimality
    0 references

    Identifiers