Co-occurring keywords · papers mentioning both
Papers
Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
AAAI 2026
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
AISTATS 2025
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
NeurIPS 2024
Improved Dimensionality Dependence for Zeroth-Order Optimisation over Cross-Polytopes
ICML 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
NeurIPS 2023
Sparse Continuous Distributions and Fenchel-Young Losses
JMLR 2022
Convex Regularization in Monte-Carlo Tree Search
ICML 2021
Cycle Self-Training for Domain Adaptation
NeurIPS 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits
JMLR 2021
Generalized Tsallis Entropy Reinforcement Learning and Its Application to Soft Mobile Robots
RSS 2020
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits
COLT 2020
An Optimal Algorithm for Stochastic and Adversarial Bandits
AISTATS 2019
Maximum Causal Tsallis Entropy Imitation Learning
NeurIPS 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
NeurIPS 2015