Guardado en:
| Autores principales: | Shibukawa, Yuki, Tanaka, Koichi, Saito, Yuta, Ito, Shinji |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2603.07005 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits
por: Shimizu, Tatsuhiro, et al.
Publicado: (2024)
por: Shimizu, Tatsuhiro, et al.
Publicado: (2024)
Influential Bandits: Pulling an Arm May Change the Environment
por: Sato, Ryoma, et al.
Publicado: (2025)
por: Sato, Ryoma, et al.
Publicado: (2025)
Bandit Max-Min Fair Allocation
por: Harada, Tsubasa, et al.
Publicado: (2025)
por: Harada, Tsubasa, et al.
Publicado: (2025)
Bandit and Delayed Feedback in Online Structured Prediction
por: Shibukawa, Yuki, et al.
Publicado: (2025)
por: Shibukawa, Yuki, et al.
Publicado: (2025)
Optimal Arm Elimination Algorithms for Combinatorial Bandits
por: Wen, Yuxiao, et al.
Publicado: (2025)
por: Wen, Yuxiao, et al.
Publicado: (2025)
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
por: Ichikawa, Koji, et al.
Publicado: (2023)
por: Ichikawa, Koji, et al.
Publicado: (2023)
Multi-Task Combinatorial Bandits for Budget Allocation
por: Ge, Lin, et al.
Publicado: (2024)
por: Ge, Lin, et al.
Publicado: (2024)
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
por: Kato, Masahiro, et al.
Publicado: (2024)
por: Kato, Masahiro, et al.
Publicado: (2024)
Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
por: Zhao, Canzhe, et al.
Publicado: (2025)
por: Zhao, Canzhe, et al.
Publicado: (2025)
Replicability is Asymptotically Free in Multi-armed Bandits
por: Komiyama, Junpei, et al.
Publicado: (2024)
por: Komiyama, Junpei, et al.
Publicado: (2024)
A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
por: Chase, Zachary, et al.
Publicado: (2025)
por: Chase, Zachary, et al.
Publicado: (2025)
Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
por: Mukherjee, Arpan, et al.
Publicado: (2024)
por: Mukherjee, Arpan, et al.
Publicado: (2024)
MultiScale Contextual Bandits for Long Term Objectives
por: Rastogi, Richa, et al.
Publicado: (2025)
por: Rastogi, Richa, et al.
Publicado: (2025)
A Perturbation Approach to Unconstrained Linear Bandits
por: Jacobsen, Andrew, et al.
Publicado: (2026)
por: Jacobsen, Andrew, et al.
Publicado: (2026)
Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstraction
por: Kiyohara, Haruka, et al.
Publicado: (2024)
por: Kiyohara, Haruka, et al.
Publicado: (2024)
Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
por: Lee, Jongyeong, et al.
Publicado: (2025)
por: Lee, Jongyeong, et al.
Publicado: (2025)
Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits
por: Nguyen, Nicolas, et al.
Publicado: (2024)
por: Nguyen, Nicolas, et al.
Publicado: (2024)
Offline Contextual Bandits in the Presence of New Actions
por: Kishimoto, Ren, et al.
Publicado: (2026)
por: Kishimoto, Ren, et al.
Publicado: (2026)
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
por: Ito, Shinji, et al.
Publicado: (2025)
por: Ito, Shinji, et al.
Publicado: (2025)
Combinatorial Rising Bandits
por: Song, Seockbean, et al.
Publicado: (2024)
por: Song, Seockbean, et al.
Publicado: (2024)
Combinatorial Logistic Bandits
por: Liu, Xutong, et al.
Publicado: (2024)
por: Liu, Xutong, et al.
Publicado: (2024)
Off-Policy Evaluation for Ranking Policies under Deterministic Logging Policies
por: Tanaka, Koichi, et al.
Publicado: (2026)
por: Tanaka, Koichi, et al.
Publicado: (2026)
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
por: Lee, Jongyeong, et al.
Publicado: (2024)
por: Lee, Jongyeong, et al.
Publicado: (2024)
Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
por: Nguyen, Quan, et al.
Publicado: (2025)
por: Nguyen, Quan, et al.
Publicado: (2025)
Beyond Match Maximization and Fairness: Retention-Optimized Two-Sided Matching
por: Kishimoto, Ren, et al.
Publicado: (2026)
por: Kishimoto, Ren, et al.
Publicado: (2026)
Off-Policy Learning with Limited Supply
por: Tanaka, Koichi, et al.
Publicado: (2026)
por: Tanaka, Koichi, et al.
Publicado: (2026)
Prompt Optimization with Logged Bandit Data
por: Kiyohara, Haruka, et al.
Publicado: (2025)
por: Kiyohara, Haruka, et al.
Publicado: (2025)
Does Feedback Help in Bandits with Arm Erasures?
por: Karakas, Merve, et al.
Publicado: (2025)
por: Karakas, Merve, et al.
Publicado: (2025)
EVaR-Optimal Arm Identification in Bandits
por: Ahmadipour, Mehrasa, et al.
Publicado: (2025)
por: Ahmadipour, Mehrasa, et al.
Publicado: (2025)
Lasso Bandit with Compatibility Condition on Optimal Arm
por: Lee, Harin, et al.
Publicado: (2024)
por: Lee, Harin, et al.
Publicado: (2024)
Constrained Best Arm Identification in Grouped Bandits
por: Dharod, Sahil, et al.
Publicado: (2024)
por: Dharod, Sahil, et al.
Publicado: (2024)
Best Arm Identification for Stochastic Rising Bandits
por: Mussi, Marco, et al.
Publicado: (2023)
por: Mussi, Marco, et al.
Publicado: (2023)
Best-Arm Identification in Unimodal Bandits
por: Poiani, Riccardo, et al.
Publicado: (2024)
por: Poiani, Riccardo, et al.
Publicado: (2024)
Adversarial Combinatorial Bandits with Switching Costs
por: Dong, Yanyan, et al.
Publicado: (2024)
por: Dong, Yanyan, et al.
Publicado: (2024)
Oracle-Efficient Combinatorial Semi-Bandits
por: Kim, Jung-hun, et al.
Publicado: (2025)
por: Kim, Jung-hun, et al.
Publicado: (2025)
Multi-thresholding Good Arm Identification with Bandit Feedback
por: Jiang, Xuanke, et al.
Publicado: (2025)
por: Jiang, Xuanke, et al.
Publicado: (2025)
Combinatorial Bandit Bayesian Optimization for Tensor Outputs
por: Huang, Jingru, et al.
Publicado: (2026)
por: Huang, Jingru, et al.
Publicado: (2026)
Efficient Swap Regret Minimization in Combinatorial Bandits
por: Kontogiannis, Andreas, et al.
Publicado: (2026)
por: Kontogiannis, Andreas, et al.
Publicado: (2026)
On the Regularity and Fairness of Combinatorial Multi-Armed Bandit
por: Wu, Xiaoyi, et al.
Publicado: (2025)
por: Wu, Xiaoyi, et al.
Publicado: (2025)
Offline Learning for Combinatorial Multi-armed Bandits
por: Liu, Xutong, et al.
Publicado: (2025)
por: Liu, Xutong, et al.
Publicado: (2025)
Ejemplares similares
-
Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits
por: Shimizu, Tatsuhiro, et al.
Publicado: (2024) -
Influential Bandits: Pulling an Arm May Change the Environment
por: Sato, Ryoma, et al.
Publicado: (2025) -
Bandit Max-Min Fair Allocation
por: Harada, Tsubasa, et al.
Publicado: (2025) -
Bandit and Delayed Feedback in Online Structured Prediction
por: Shibukawa, Yuki, et al.
Publicado: (2025) -
Optimal Arm Elimination Algorithms for Combinatorial Bandits
por: Wen, Yuxiao, et al.
Publicado: (2025)