Image de couverture de livre

Rising Rested MAB with Linear Drift

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Amichay, Omer, Mansour, Yishay
Format:	Preprint
Publié:	2025
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

Delay as Payoff in MAB
par: Schlisselberg, Ofir, 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)

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
par: Fiandri, Marco, et autres
Publié: (2024)

Bayesian Perspective on Memorization and Reconstruction
par: Kaplan, Haim, et autres
Publié: (2025)

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

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
par: Genalti, Gianmarco, et autres
Publié: (2024)

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

Fast Inference via Hierarchical Speculative Decoding
par: Mohri, Clara, et autres
Publié: (2025)

Cost-Aware Learning
par: Mohri, Clara, et autres
Publié: (2026)

Rate-Preserving Reductions for Blackwell Approachability
par: Dann, Christoph, et autres
Publié: (2024)

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

The Real Price of Bandit Information in 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)

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

Representation Alignment Rests on Linear Structure
par: Bangachev, Kiril, et autres
Publié: (2026)

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

Competing Bandits: The Perils of Exploration Under Competition
par: Aridor, Guy, et autres
Publié: (2020)

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

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
par: Erez, Liad, et autres
Publié: (2022)