Cover Image

Optimal cross-learning for contextual bandits with unknown context distributions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schneider, Jon, Zimmert, Julian
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 bandits with predicted context
by: Guo, Yongyi, et al.
Published: (2023)

Model selection for behavioral learning data and applications to contextual bandits
by: Aubert, Julien, et al.
Published: (2025)

Vector preference-based contextual bandits under distributional shifts
by: Shukla, Apurv, et al.
Published: (2025)

VITS : Variational Inference Thompson Sampling for contextual bandits
by: Clavier, Pierre, et al.
Published: (2023)

Best-of-Both Worlds for linear contextual bandits with paid observations
by: Boyer, Nathan, et al.
Published: (2025)

Leveraging heterogeneous spillover in maximizing contextual bandit rewards
by: Faruk, Ahmed Sayeed, et al.
Published: (2023)

Anytime-valid off-policy inference for contextual bandits
by: Waudby-Smith, Ian, et al.
Published: (2022)

Efficient Opportunistic Approachability
by: Marinov, Teodor Vanislavov, et al.
Published: (2026)

A conversion theorem and minimax optimality for continuum contextual bandits
by: Akhavan, Arya, et al.
Published: (2024)

Quantum contextual bandits and recommender systems for quantum data
by: Brahmachari, Shrigyan, et al.
Published: (2023)

A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
by: Masoudian, Saeed, et al.
Published: (2023)

Precision autotuning for linear solvers via contextual bandit-based RL
by: Carson, Erin, et al.
Published: (2026)

Incentive-compatible Bandits: Importance Weighting No More
by: Zimmert, Julian, et al.
Published: (2024)

Decision Making in Hybrid Environments: A Model Aggregation Approach
by: Liu, Haolin, et al.
Published: (2025)

A Model Selection Approach for Corruption Robust Reinforcement Learning
by: Wei, Chen-Yu, et al.
Published: (2021)

An Improved Model-Free Decision-Estimation Coefficient with Applications in Adversarial MDPs
by: Liu, Haolin, et al.
Published: (2025)

Truthful mechanisms for linear bandit games with private contexts
by: Hu, Yiting, et al.
Published: (2025)

Efficient kernelized bandit algorithms via exploration distributions
by: Hu, Bingshan, et al.
Published: (2025)

Leveraging priors on distribution functions for multi-arm bandits
by: Vashishtha, Sumit, et al.
Published: (2025)

Stochastic contextual bandits with graph feedback: from independence number to MAS number
by: Wen, Yuxiao, et al.
Published: (2024)

Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback
by: Liu, Haolin, et al.
Published: (2024)

Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)

Efficient learning by implicit exploration in bandit problems with side observations
by: Kocak, Tomas, et al.
Published: (2026)

Transformer learns the cross-task prior and regularization for in-context learning
by: Lu, Fei, et al.
Published: (2025)

Reinforcement learning with combinatorial actions for coupled restless bandits
by: Xu, Lily, et al.
Published: (2025)

Non-stationary Bandit Convex Optimization: A Comprehensive Study
by: Liu, Xiaoqi, et al.
Published: (2025)

Contextual Dynamic Pricing with Heterogeneous Buyers
by: Lykouris, Thodoris, et al.
Published: (2025)

Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)

Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)

Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier
by: Fiegel, Come, et al.
Published: (2026)

Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
by: Mei, Jincheng, et al.
Published: (2025)

Mixture models for data with unknown distributions
by: Newman, M. E. J.
Published: (2025)

Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)

Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)

Approximate information maximization for bandit games
by: Barbier-Chebbah, Alex, et al.
Published: (2023)

TBDFiltering: Sample-Efficient Tree-Based Data Filtering
by: Busa-Fekete, Robert Istvan, et al.
Published: (2026)

Risk and optimal policies in bandit experiments
by: Adusumilli, Karun
Published: (2021)

Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)

On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)

Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)