Image de couverture de livre

Last-Iterate Analyses of FTRL with the 1/2-Tsallis Entropy in Stochastic Bandits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhan, Jingxin, Han, Yuze, Zhang, Zhihua
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 Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
par: Zhan, Jingxin, et autres
Publié: (2025)

Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems
par: Zhan, Jingxin, et autres
Publié: (2025)

Finite-Time Decoupled Convergence in Nonlinear Two-Time-Scale Stochastic Approximation
par: Han, Yuze, et autres
Publié: (2024)

Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning
par: Liu, Junyan, et autres
Publié: (2024)

Decoupled Functional Central Limit Theorems for Two-Time-Scale Stochastic Approximation
par: Han, Yuze, et autres
Publié: (2024)

Conformal-Style Quantile Analyses for Stochastic Bandits
par: Du, Chengyu, et autres
Publié: (2026)

Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
par: Hait, Soumita, et autres
Publié: (2026)

Optimistic Online Non-stochastic Control via FTRL
par: Mhaisen, Naram, et autres
Publié: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
par: Vaidyan, Kevin Kurian Thomas, et autres
Publié: (2026)

Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods
par: Liu, Zijian, et autres
Publié: (2023)

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback
par: Fiegel, Côme, et autres
Publié: (2026)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
par: Kato, Masahiro, et autres
Publié: (2024)

Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
par: Ahn, Kwangjun, et autres
Publié: (2024)

Exploratory Utility Maximization Problem with Tsallis Entropy
par: Ziyi, Chen, et autres
Publié: (2025)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
par: Huang, Ziyi, et autres
Publié: (2024)

Online Learning Quantum States with the Logarithmic Loss via VB-FTRL
par: Tseng, Wei-Fu, et autres
Publié: (2023)

Continuous-time q-Learning for Jump-Diffusion Models under Tsallis Entropy
par: Bo, Lijun, et autres
Publié: (2024)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
par: Chen, Zaiwei, et autres
Publié: (2024)

Entropy-based Training Methods for Scalable Neural Implicit Sampler
par: Luo, Weijian, et autres
Publié: (2023)

Stochastic Graph Bandit Learning with Side-Observations
par: Gong, Xueping, et autres
Publié: (2023)

Stochastic Bandits for Egalitarian Assignment
par: Lim, Eugene, et autres
Publié: (2024)

Efficient Clustering in Stochastic Bandits
par: Chandran, G Dhinesh, et autres
Publié: (2026)

Stochastic Gradient Succeeds for Bandits
par: Mei, Jincheng, et autres
Publié: (2024)

SOREL: A Stochastic Algorithm for Spectral Risks Minimization
par: Ge, Yuze, et autres
Publié: (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
par: Tsuchiya, Taira, et autres
Publié: (2024)

Tsallis Entropy Regularization for Linearly Solvable MDP and Linear Quadratic Regulator
par: Hashizume, Yota, et autres
Publié: (2024)

Are Stochastic Multi-objective Bandits Harder than Single-objective Bandits?
par: Guan, Changkun, et autres
Publié: (2026)

Lipschitz Bandits with Stochastic Delayed Feedback
par: Liu, Zhongxuan, et autres
Publié: (2025)

Batched Stochastic Bandit for Nondegenerate Functions
par: Liu, Yu, et autres
Publié: (2024)

Stochastic Bandits Robust to Adversarial Attacks
par: Wang, Xuchuang, et autres
Publié: (2024)

On the Last-Iterate Convergence of Shuffling Gradient Methods
par: Liu, Zijian, et autres
Publié: (2024)

Augmented Lagrangian Method for Last-Iterate Convergence for Constrained MDPs
par: Lu, Michael, et autres
Publié: (2026)

Convergence Rate for the Last Iterate of Stochastic Gradient Descent Schemes
par: Hudiani, Marcel
Publié: (2025)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
par: Nie, Guanyu, et autres
Publié: (2024)

Stochastic Matching Bandits with Rare Optimization Updates
par: Kim, Jung-hun, et autres
Publié: (2025)

Active Learning for Stochastic Contextual Linear Bandits
par: Brunskill, Emma, et autres
Publié: (2026)

Biased Dueling Bandits with Stochastic Delayed Feedback
par: Yi, Bongsoo, et autres
Publié: (2024)

Best Arm Identification for Stochastic Rising Bandits
par: Mussi, Marco, et autres
Publié: (2023)

Offline Local Search for Online Stochastic Bandits
par: Benadè, Gerdus, et autres
Publié: (2026)

Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning
par: Montenegro, Alessandro, et autres
Publié: (2024)