Cover Image

Finite-Time Regret Analysis of Retry-Aware Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tong, Bingkui, Komiyama, Junpei, Nishimori, Soichiro, Parmas, Paavo
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Emergence of Exploration in Policy Gradient Reinforcement Learning via Retrying
by: Nishimori, Soichiro, et al.
Published: (2026)

High-dimensional Contextual Bandit Problem without Sparsity
by: Komiyama, Junpei, et al.
Published: (2023)

High-dimensional Nonparametric Contextual Bandit Problem
by: Iwazaki, Shogo, et al.
Published: (2025)

Suboptimal Performance of the Bayes Optimal Algorithm in Frequentist Best Arm Identification
by: Komiyama, Junpei
Published: (2022)

Double Horizon Model-Based Policy Optimization
by: Kubo, Akihiro, et al.
Published: (2025)

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

Does "Do Differentiable Simulators Give Better Policy Gradients?'' Give Better Policy Gradients?
by: Onoda, Ku, et al.
Published: (2026)

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)

Best-of-$\infty$ -- Asymptotic Performance of Test-Time LLM Ensembling
by: Komiyama, Junpei, et al.
Published: (2025)

Rate-optimal Design for Anytime Best Arm Identification
by: Komiyama, Junpei, et al.
Published: (2025)

Fixed Confidence Best Arm Identification in the Bayesian Setting
by: Jang, Kyoungseok, et al.
Published: (2024)

A Batch Sequential Halving Algorithm without Performance Degradation
by: Koyamada, Sotetsu, et al.
Published: (2024)

An Efficient Algorithm for Thresholding Monte Carlo Tree Search
by: Nameki, Shoma, et al.
Published: (2026)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
by: Komiyama, Junpei, et al.
Published: (2025)

Regret Analysis of Sleeping Competing Bandits
by: Uba, Shinnosuke, et al.
Published: (2026)

Offline Reinforcement Learning with Domain-Unlabeled Data
by: Nishimori, Soichiro, et al.
Published: (2024)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

Reliable Chain-of-Thought via Prefix Consistency
by: Iwase, Naoto, et al.
Published: (2026)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Finite-Time Logarithmic Bayes Regret Upper Bounds
by: Atsidakou, Alexia, et al.
Published: (2023)

On Symmetric Losses for Robust Policy Optimization with Noisy Preferences
by: Nishimori, Soichiro, et al.
Published: (2025)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

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

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

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
by: Jose, Sharu Theresa, et al.
Published: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form
by: Kitamura, Toshinori, et al.
Published: (2024)

Queue Length Regret Bounds for Contextual Queueing Bandits
by: Bae, Seoungbin, et al.
Published: (2026)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

How Does Variance Shape the Regret in Contextual Bandits?
by: Jia, Zeyu, et al.
Published: (2024)

Improved Regret for Bandit Convex Optimization with Delayed Feedback
by: Wan, Yuanyu, et al.
Published: (2024)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

On Bits and Bandits: Quantifying the Regret-Information Trade-off
by: Shufaro, Itai, et al.
Published: (2024)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
by: Liu, Chong, et al.
Published: (2025)

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)