Imagen de Portada

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kato, Masahiro, Ito, Shinji
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
por: Lee, Wei-Cheng, et al.
Publicado: (2025)

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

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)

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)

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

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

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
por: Zhao, Canzhe, et al.
Publicado: (2025)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
por: Ito, Shinji, et al.
Publicado: (2024)

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
por: Tsuchiya, Taira, et al.
Publicado: (2024)

The Role of Contextual Information in Best Arm Identification
por: Kato, Masahiro, et al.
Publicado: (2021)

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

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

Locally Optimal Fixed-Budget Best Arm Identification in Two-Armed Gaussian Bandits with Unknown Variances
por: Kato, Masahiro
Publicado: (2023)

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

A Perturbation Approach to Unconstrained Linear Bandits
por: Jacobsen, Andrew, et al.
Publicado: (2026)

Generalized Neyman Allocation for Locally Minimax Optimal Best-Arm Identification
por: Kato, Masahiro
Publicado: (2024)

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

Fast Best-in-Class Regret for Contextual Bandits
por: Girard, Samuel, 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)

Minimax and Bayes Optimal Best-Arm Identification
por: Kato, Masahiro
Publicado: (2025)

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)

Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
por: Kang, Yue, et al.
Publicado: (2025)

Linear Contextual Bandits with Interference
por: Xu, Yang, et al.
Publicado: (2024)

Neural Risk-sensitive Satisficing in Contextual Bandits
por: Ito, Shogo, et al.
Publicado: (2025)

Minimax Optimal Simple Regret in Two-Armed Best-Arm Identification
por: Kato, Masahiro
Publicado: (2024)

Contextual Linear Bandits with Delay as Payoff
por: Zhang, Mengxiao, et al.
Publicado: (2025)

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

Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits
por: Kang, Yue, et al.
Publicado: (2023)

Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits
por: Sarmasarkar, Sahasrajit
Publicado: (2026)

Worst-Case Optimal Multi-Armed Gaussian Best Arm Identification with a Fixed Budget
por: Kato, Masahiro
Publicado: (2023)

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

Replicability is Asymptotically Free in Multi-armed Bandits
por: Komiyama, Junpei, et al.
Publicado: (2024)

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

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
por: Chase, Zachary, et al.
Publicado: (2025)

Partially Observable Contextual Bandits with Linear Payoffs
por: Zeng, Sihan, et al.
Publicado: (2024)

Active Learning for Stochastic Contextual Linear Bandits
por: Brunskill, Emma, et al.
Publicado: (2026)

Strategic Linear Contextual Bandits
por: Buening, Thomas Kleine, et al.
Publicado: (2024)

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

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