Cover Image

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Mengmeng, Schneider, Philipp J., Aleksić, Jelisaveta, Kuhn, Daniel
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
by: Chen, Botao, et al.
Published: (2026)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
by: Kato, Masahiro, et al.
Published: (2024)

Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems
by: Zhan, Jingxin, et al.
Published: (2025)

Oracle-Efficient Combinatorial Semi-Bandits
by: Kim, Jung-hun, et al.
Published: (2025)

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

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
by: Kim, Chaiwon, et al.
Published: (2025)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
by: Zhou, Julien, et al.
Published: (2024)

Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives
by: Akash, S, et al.
Published: (2026)

From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
by: Erez, Liad, et al.
Published: (2025)

Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
by: Li, Mengmeng, et al.
Published: (2024)

A Contextual Combinatorial Bandit Approach to Negotiation
by: Li, Yexin, et al.
Published: (2024)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

Best of Both Worlds: Regret Minimization versus Minimax Play
by: Müller, Adrian, et al.
Published: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Fast Best-in-Class Regret for Contextual Bandits
by: Girard, Samuel, et al.
Published: (2025)

Multi-Play Combinatorial Semi-Bandit Problem
by: Nakamura, Shintaro, et al.
Published: (2025)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
by: Lee, Jongyeong, et al.
Published: (2024)

Contextual Combinatorial Bandits with Probabilistically Triggered Arms
by: Liu, Xutong, et al.
Published: (2023)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
by: Germano, Jacopo, et al.
Published: (2023)

uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs
by: Chen, Yu, et al.
Published: (2024)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
by: Chen, Botao, et al.
Published: (2025)

The Best of Both Worlds: On the Dilemma of Out-of-distribution Detection
by: Zhang, Qingyang, et al.
Published: (2024)

Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits
by: Shimizu, Tatsuhiro, et al.
Published: (2024)

Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays
by: Chen, Ziqun, et al.
Published: (2024)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

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

Best-of-Both-Worlds for Heavy-Tailed Markov Decision Processes
by: Chen, Yu, et al.
Published: (2026)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
by: Huang, Zhiming, et al.
Published: (2026)

A Reduction Algorithm for Markovian Contextual Linear Bandits
by: Buyukkalayci, Kaan, et al.
Published: (2026)

Combinatorial Rising Bandits
by: Song, Seockbean, et al.
Published: (2024)

Combinatorial Logistic Bandits
by: Liu, Xutong, et al.
Published: (2024)

Efficient Contextual Bandits with Uninformed Feedback Graphs
by: Zhang, Mengxiao, et al.
Published: (2024)

An Algorithm for Fixed Budget Best Arm Identification with Combinatorial Exploration
by: Parupudi, Siddhartha, et al.
Published: (2025)

Contextual Combinatorial Bandits with Changing Action Sets via Gaussian Processes
by: Nika, Andi, et al.
Published: (2021)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)

Best of Both Worlds: Advantages of Hybrid Graph Sequence Models
by: Behrouz, Ali, et al.
Published: (2024)