Image de couverture de livre

Online Set Learning from Precision and Recall Feedback

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cohen, Lee, Mansour, Yishay, Moran, Shay, Shao, Han
Format:	Preprint
Publié:	2026
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

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

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

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

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

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

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

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)

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

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
par: Levy, Orin, et autres
Publié: (2025)

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

Agnostic Online Learning and Excellent Sets
par: Malliaris, Maryanthe, et autres
Publié: (2021)

Online Learning in MDPs with Partially Adversarial Transitions and Losses
par: Schlisselberg, Ofir, et autres
Publié: (2026)

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

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

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
par: Filmus, Yuval, et autres
Publié: (2024)

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

Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
par: Schlisselberg, Ofir, et autres
Publié: (2025)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
par: Hanneke, Steve, et autres
Publié: (2026)

Of Dice and Games: A Theory of Generalized Boosting
par: Bressan, Marco, et autres
Publié: (2024)

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

The Hidden Cost of Approximation in Online Mirror Descent
par: Schlisselberg, Ofir, et autres
Publié: (2025)

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

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

Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
par: Levy, Orin, et autres
Publié: (2026)

Delay as Payoff in MAB
par: Schlisselberg, Ofir, et autres
Publié: (2024)

Eluder-based Regret for Stochastic Contextual MDPs
par: Levy, Orin, et autres
Publié: (2022)

Rate-Optimal Policy Optimization for Linear Markov Decision Processes
par: Sherman, Uri, et autres
Publié: (2023)

Theoretical Foundations and Effective Algorithms for Policy-Aware Simulator Learning
par: Dann, Christoph, et autres
Publié: (2026)

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

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
par: Sherman, Uri, et autres
Publié: (2025)

Optimal Mistake Bounds for Transductive Online Learning
par: Chase, Zachary, et autres
Publié: (2025)

The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration
par: Barnea, Idan, et autres
Publié: (2026)

Collaborating in Multi-Armed Bandits with Strategic Agents
par: Barnea, Idan, et autres
Publié: (2026)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
par: Cassel, Asaf, et autres
Publié: (2024)

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
par: Barnea, Idan, et autres
Publié: (2024)

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

Modeling Attrition in Recommender Systems with Departing Bandits
par: Ben-Porat, Omer, et autres
Publié: (2022)

Online Learning with Set-Valued Feedback
par: Raman, Vinod, et autres
Publié: (2023)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
par: Sherman, Uri, et autres
Publié: (2025)