conftrace_

tsallis entropy

15 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) adversarial bandit (59) entropy regularization (132) online mirror descent (40) policy optimization (657) adversarial learning (1595) reinforcement learning (4352) maximum entropy reinforcement learning (7)

Papers

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions AAAI 2026
A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds NIPS 2024
Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024
Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Arms NIPS 2023
Sparse Continuous Distributions and Fenchel-Young Losses JMLR 2022
Convex Regularization in Monte-Carlo Tree Search ICML 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021
Cycle Self-Training for Domain Adaptation NIPS 2021
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020
Generalized Tsallis Entropy Reinforcement Learning and Its Application to Soft Mobile Robots RSS 2020
An Optimal Algorithm for Stochastic and Adversarial Bandits AISTATS 2019
Maximum Causal Tsallis Entropy Imitation Learning NIPS 2018
Path Consistency Learning in Tsallis Entropy Regularized MDPs ICML 2018
Adjusting for Chance Clustering Comparison Measures JMLR 2016
Fighting Bandits with a New Kind of Smoothness NIPS 2015