Image de couverture de livre

Of Dice and Games: A Theory of Generalized Boosting

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bressan, Marco, Brukhim, Nataly, Cesa-Bianchi, Nicolò, Esposito, Emmanuel, Mansour, Yishay, Moran, Shay, Thiessen, Maximilian
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning Conditional Averages
par: Bressan, Marco, et autres
Publié: (2026)

A Theory of Interpretable Approximations
par: Bressan, Marco, et autres
Publié: (2024)

Lookahead identification in adversarial bandits: accuracy and memory bounds
par: Brukhim, Nataly, et autres
Publié: (2026)

Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
par: Bressan, Marco, et autres
Publié: (2024)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
par: Bressan, Marco, et autres
Publié: (2025)

A Theoretical Framework for Statistical Evaluability of Generative Models
par: Aiyer, Shashaank, et autres
Publié: (2026)

Improved Regret Bounds for Bandits with Expert Advice
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2024)

Probably Approximately Precision and Recall Learning
par: Cohen, Lee, et autres
Publié: (2024)

Online Set Learning from Precision and Recall Feedback
par: Cohen, Lee, et autres
Publié: (2026)

Learning-Augmented Algorithms with Explicit Predictors
par: Elias, Marek, et autres
Publié: (2024)

Learnability Gaps of Strategic Classification
par: Cohen, Lee, et autres
Publié: (2024)

Adaptive maximization of social welfare
par: Cesa-Bianchi, Nicolo, et autres
Publié: (2023)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
par: Esposito, Emmanuel, et autres
Publié: (2022)

How to Boost Any Loss Function
par: Nock, Richard, et autres
Publié: (2024)

The Real Price of Bandit Information in Multiclass Classification
par: Erez, Liad, et autres
Publié: (2024)

Fast Rates for Bandit PAC Multiclass Classification
par: Erez, Liad, et autres
Publié: (2024)

Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
par: Aiyer, Shashaank, et autres
Publié: (2026)

Learning from Equivalence Queries, Revisited
par: Braverman, Mark, et autres
Publié: (2026)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
par: Qiu, Hao, et autres
Publié: (2026)

Distributed Online Optimization with Stochastic Agent Availability
par: Achddou, Juliette, et autres
Publié: (2024)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
par: Jin, Tianyuan, et autres
Publié: (2024)

Online Linear Regression with Paid Stochastic Features
par: Merlis, Nadav, et autres
Publié: (2025)

Multitask Online Learning: Listen to the Neighborhood Buzz
par: Achddou, Juliette, et autres
Publié: (2023)

On the Hardness of Bandit Learning
par: Brukhim, Nataly, et autres
Publié: (2025)

Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
par: Cohen, Alon, et autres
Publié: (2025)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
par: Di Gennaro, Federico, et autres
Publié: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
par: Jacobsen, Andrew, et autres
Publié: (2026)

Non-stochastic Bandits With Evolving Observations
par: Bar-On, Yogev, et autres
Publié: (2024)

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
par: Lancewicki, Tal, et autres
Publié: (2025)

Optimal Regret for Policy Optimization in Contextual Bandits
par: Levy, Orin, et autres
Publié: (2026)

Rising Rested MAB with Linear Drift
par: Amichay, Omer, et autres
Publié: (2025)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
par: Erez, Liad, et autres
Publié: (2026)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
par: Rumi, Alberto, et autres
Publié: (2026)

Beyond Bandit Feedback in Online Multiclass Classification
par: van der Hoeven, Dirk, et autres
Publié: (2021)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
par: Zhao, Yuheng, et autres
Publié: (2026)

Cooperative Online Learning with Feedback Graphs
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2021)

Dynamic Regret Reduces to Kernelized Static Regret
par: Jacobsen, Andrew, et autres
Publié: (2025)

A Theory of Universal Agnostic Learning
par: Hanneke, Steve, et autres
Publié: (2026)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
par: Eldowa, Khaled, et autres
Publié: (2024)

A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
par: Attias, Idan, et autres
Publié: (2022)