Unified Algorithms for Online Learning and Competitive Analysis
From MaRDI portal
Publication:2806821
DOI10.1287/moor.2015.0742zbMath1335.68196OpenAlexW2189079255MaRDI QIDQ2806821
Joseph (Seffi) Naor, Shahar Chen, Niv Buchbinder, Ohad Shamir
Publication date: 19 May 2016
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2015.0742
Decision theory (91B06) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial aspects of matroids and geometric lattices (05B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)
Related Items
Multistage knapsack, Unnamed Item, Unnamed Item, Online multistage subset maximization problems, Unified Algorithms for Online Learning and Competitive Analysis, Unnamed Item, A Combinatorial Metrical Task System Problem Under the Uniform Metric, LP-based algorithms for multistage minimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tracking the best expert
- A decision-theoretic generalization of on-line learning and an application to boosting
- Static optimality and dynamic search-optimality in lists and trees
- On-line learning and the metrical task system problem
- Efficient algorithms for online decision problems
- A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
- Unified Algorithms for Online Learning and Competitive Analysis
- Competitive Algorithms for Restricted Caching and Matroid Caching
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- An optimal on-line algorithm for metrical task system
- A Regularization Approach to Metrical Task Systems
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Prediction, Learning, and Games
