Cover Image

Delay as Payoff in MAB

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schlisselberg, Ofir, Cohen, Ido, Lancewicki, Tal, Mansour, Yishay
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Learning in MDPs with Partially Adversarial Transitions and Losses
by: Schlisselberg, Ofir, et al.
Published: (2026)

Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
by: Schlisselberg, Ofir, et al.
Published: (2025)

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)

Collaborating in Multi-Armed Bandits with Strategic Agents
by: Barnea, Idan, et al.
Published: (2026)

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)

The Hidden Cost of Approximation in Online Mirror Descent
by: Schlisselberg, Ofir, et al.
Published: (2025)

Rising Rested MAB with Linear Drift
by: Amichay, Omer, et al.
Published: (2025)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)

The impact of allocation strategies in subset learning on the expressive power of neural networks
by: Schlisselberg, Ofir, et al.
Published: (2025)

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
by: Levy, Orin, et al.
Published: (2025)

Non-stochastic Bandits With Evolving Observations
by: Bar-On, Yogev, et al.
Published: (2024)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

Probably Approximately Precision and Recall Learning
by: Cohen, Lee, et al.
Published: (2024)

Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
by: Levy, Orin, et al.
Published: (2026)

Eluder-based Regret for Stochastic Contextual MDPs
by: Levy, Orin, et al.
Published: (2022)

Online Set Learning from Precision and Recall Feedback
by: Cohen, Lee, et al.
Published: (2026)

Rate-Optimal Policy Optimization for Linear Markov Decision Processes
by: Sherman, Uri, et al.
Published: (2023)

Fast Inference via Hierarchical Speculative Decoding
by: Mohri, Clara, et al.
Published: (2025)

Contextual Linear Bandits with Delay as Payoff
by: Zhang, Mengxiao, et al.
Published: (2025)

How to Boost Any Loss Function
by: Nock, Richard, et al.
Published: (2024)

Learnability Gaps of Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration
by: Barnea, Idan, et al.
Published: (2026)

Theoretical Foundations and Effective Algorithms for Policy-Aware Simulator Learning
by: Dann, Christoph, et al.
Published: (2026)

A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
by: Attias, Idan, et al.
Published: (2022)

The Real Price of Bandit Information in Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

Fast Rates for Bandit PAC Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
by: Sherman, Uri, et al.
Published: (2025)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

Measuring the Data
by: Cohen, Ido
Published: (2025)

Playing Markov Games Without Observing Payoffs
by: Ablin, Daniel, et al.
Published: (2025)

Modeling Attrition in Recommender Systems with Departing Bandits
by: Ben-Porat, Omer, et al.
Published: (2022)

Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
by: Cohen, Alon, et al.
Published: (2025)

Bayesian Perspective on Memorization and Reconstruction
by: Kaplan, Haim, et al.
Published: (2025)

A Theoretical Framework for Statistical Evaluability of Generative Models
by: Aiyer, Shashaank, et al.
Published: (2026)

Routing for Large ML Models
by: Cohen, Ofir, et al.
Published: (2025)

Learning-Augmented Algorithms with Explicit Predictors
by: Elias, Marek, et al.
Published: (2024)

Rate-Preserving Reductions for Blackwell Approachability
by: Dann, Christoph, et al.
Published: (2024)

Cost-Aware Learning
by: Mohri, Clara, et al.
Published: (2026)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
by: Erez, Liad, et al.
Published: (2026)