:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Nakamura, Shintaro, Kuroki, Yuko, Chen, Wei
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	https://arxiv.org/abs/2509.09933
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
por: Nakamura, Shintaro, et al.
Publicado: (2023)

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

Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums
por: Ohnishi, Motoya, et al.
Publicado: (2022)

Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits
por: Cinus, Federico, et al.
Publicado: (2025)

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

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

Combinatorial Rising Bandits
por: Song, Seockbean, et al.
Publicado: (2024)

Offline Learning for Combinatorial Multi-armed Bandits
por: Liu, Xutong, et al.
Publicado: (2025)

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

Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Arms
por: Zhou, Kongchang, et al.
Publicado: (2025)

Query-Efficient Correlation Clustering with Noisy Oracle
por: Kuroki, Yuko, et al.
Publicado: (2024)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
por: Li, Mengmeng, et al.
Publicado: (2025)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
por: Pokhriyal, Subham, et al.
Publicado: (2026)

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

Combinatorial Causal Bandits without Graph Skeleton
por: Feng, Shi, et al.
Publicado: (2023)

On the Regularity and Fairness of Combinatorial Multi-Armed Bandit
por: Wu, Xiaoyi, et al.
Publicado: (2025)

Multi-Task Combinatorial Bandits for Budget Allocation
por: Ge, Lin, et al.
Publicado: (2024)

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

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

Combinatorial Logistic Bandits
por: Liu, Xutong, et al.
Publicado: (2024)

Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
por: Liu, Xutong, et al.
Publicado: (2022)

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

Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
por: Liu, Xutong, et al.
Publicado: (2024)

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

Adversarial Attacks on Combinatorial Multi-Armed Bandits
por: Balasubramanian, Rishab, et al.
Publicado: (2023)

On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit
por: Wu, Xiaoyi, et al.
Publicado: (2025)

Combinatorial Bandit Bayesian Optimization for Tensor Outputs
por: Huang, Jingru, et al.
Publicado: (2026)

Adversarial Combinatorial Bandits with Switching Costs
por: Dong, Yanyan, et al.
Publicado: (2024)

Federated Combinatorial Multi-Agent Multi-Armed Bandits
por: Fourati, Fares, et al.
Publicado: (2024)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
por: Shibukawa, Yuki, et al.
Publicado: (2026)

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

Finite-Time Guarantees for Multi-Agent Combinatorial Bandits with Nonstationary Rewards
por: Adams, Katherine B., et al.
Publicado: (2025)

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

Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach
por: Rahbar, Arman, et al.
Publicado: (2023)

Recommenadation aided Caching using Combinatorial Multi-armed Bandits
por: J, Pavamana K, et al.
Publicado: (2024)

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

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

Neural Combinatorial Clustered Bandits for Recommendation Systems
por: Atalar, Baran, et al.
Publicado: (2024)

Bayesian Analysis of Combinatorial Gaussian Process Bandits
por: Sandberg, Jack, et al.
Publicado: (2023)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
por: Mukherjee, Arpan, et al.
Publicado: (2024)