Image de couverture de livre

Multi-Play Combinatorial Semi-Bandit Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Nakamura, Shintaro, Kuroki, Yuko, Chen, Wei
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

A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
par: Nakamura, Shintaro, et autres
Publié: (2023)

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
par: Chen, Botao, et autres
Publié: (2025)

Oracle-Efficient Combinatorial Semi-Bandits
par: Kim, Jung-hun, et autres
Publié: (2025)

Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums
par: Ohnishi, Motoya, et autres
Publié: (2022)

Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits
par: Cinus, Federico, et autres
Publié: (2025)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
par: Kuroki, Yuko, et autres
Publié: (2023)

Combinatorial Rising Bandits
par: Song, Seockbean, et autres
Publié: (2024)

Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays
par: Chen, Ziqun, et autres
Publié: (2024)

Offline Learning for Combinatorial Multi-armed Bandits
par: Liu, Xutong, et autres
Publié: (2025)

Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Arms
par: Zhou, Kongchang, et autres
Publié: (2025)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
par: Li, Mengmeng, et autres
Publié: (2025)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
par: Pokhriyal, Subham, et autres
Publié: (2026)

On the Regularity and Fairness of Combinatorial Multi-Armed Bandit
par: Wu, Xiaoyi, et autres
Publié: (2025)

Multi-Task Combinatorial Bandits for Budget Allocation
par: Ge, Lin, et autres
Publié: (2024)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
par: Huang, Zhiming, et autres
Publié: (2026)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
par: Ye, Zichun, et autres
Publié: (2025)

Query-Efficient Correlation Clustering with Noisy Oracle
par: Kuroki, Yuko, et autres
Publié: (2024)

Combinatorial Causal Bandits without Graph Skeleton
par: Feng, Shi, et autres
Publié: (2023)

Combinatorial Logistic Bandits
par: Liu, Xutong, et autres
Publié: (2024)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
par: Zhou, Julien, et autres
Publié: (2024)

Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
par: Liu, Xutong, et autres
Publié: (2022)

From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
par: Erez, Liad, et autres
Publié: (2025)

Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
par: Liu, Xutong, et autres
Publié: (2024)

On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit
par: Wu, Xiaoyi, et autres
Publié: (2025)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
par: Balasubramanian, Rishab, et autres
Publié: (2023)

Contextual Combinatorial Bandits with Probabilistically Triggered Arms
par: Liu, Xutong, et autres
Publié: (2023)

Combinatorial Bandit Bayesian Optimization for Tensor Outputs
par: Huang, Jingru, et autres
Publié: (2026)

Adversarial Combinatorial Bandits with Switching Costs
par: Dong, Yanyan, et autres
Publié: (2024)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
par: Shibukawa, Yuki, et autres
Publié: (2026)

Efficient Swap Regret Minimization in Combinatorial Bandits
par: Kontogiannis, Andreas, et autres
Publié: (2026)

Federated Combinatorial Multi-Agent Multi-Armed Bandits
par: Fourati, Fares, et autres
Publié: (2024)

Finite-Time Guarantees for Multi-Agent Combinatorial Bandits with Nonstationary Rewards
par: Adams, Katherine B., et autres
Publié: (2025)

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
par: Chen, Botao, et autres
Publié: (2026)

Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach
par: Rahbar, Arman, et autres
Publié: (2023)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
par: Wen, Yuxiao, et autres
Publié: (2025)

A Contextual Combinatorial Bandit Approach to Negotiation
par: Li, Yexin, et autres
Publié: (2024)

Neural Combinatorial Clustered Bandits for Recommendation Systems
par: Atalar, Baran, et autres
Publié: (2024)

Bayesian Analysis of Combinatorial Gaussian Process Bandits
par: Sandberg, Jack, et autres
Publié: (2023)

Recommenadation aided Caching using Combinatorial Multi-armed Bandits
par: J, Pavamana K, et autres
Publié: (2024)

Matroid Semi-Bandits in Sublinear Time
par: Tzeng, Ruo-Chun, et autres
Publié: (2024)