Tor Lattimore
62 papers · 2013–2026 · 10 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+15 more ↓ Show less ↑
🗺️ Taxonomy Completionist (63) 🌉 Interdisciplinary Bridge · Silver 🌍 Conference Polyglot · Gold 🏃 Academic Marathon · Half 🐣 Hot Topic Early Bird
🏠
Conference Loyalist
(22)
🏆
Grand Slam
🤝
Dynamic Duo
(22)
🏆
Keyword Champion
(3)
🧭
Keyword Pioneer
🔬
Deep Specialist
(27)
👑
Triple Crown
🚀
Conference Pioneer
🔥
Unstoppable · Silver
❓
The Questioner
⚡
Prolific Year · Prolific
💎
Century Club · Silver
🌈
Renaissance Researcher
(7)
📈
Trend Setter
🗃️
Keyword Collector
(201)
Venues
Top co-authors
Research topics
Machine Learning
(58)
Optimization & Theory
(49)
Learning Types
(38)
Mathematics & Optimization
(35)
Optimization
(33)
Artificial Intelligence
(13)
Core AI
(10)
Core Methods
(10)
Reinforcement Learning
(9)
Methods
(8)
Bayesian & Probabilistic
(3)
Mathematics
(3)
Data Science & Analytics
(2)
Application Areas
(2)
Applications
(2)
Keywords
regret bound
(39)
multi-armed bandit
(21)
online learning
(20)
contextual bandit
(8)
linear bandit
(8)
thompson sampling
(8)
information-directed sampling
(7)
partial monitoring
(7)
bayesian regret
(7)
reinforcement learning
(6)
stochastic bandit
(6)
adversarial bandit
(6)
stochastic optimization
(5)
minimax regret
(5)
regret minimization
(4)
convex optimization
(4)
online algorithm
(4)
adversarial setting
(3)
zeroth-order optimization
(3)
bayesian inference
(3)
Papers
Conference on Learning Theory 2026: Preface
COLT 2026
Thompson Sampling for Bandit Convex Optimisation
COLT 2025
Online Newton Method for Bandit Convex Optimisation Extended Abstract
COLT 2024
A Lower Bound for Linear and Kernel Regression with Adaptive Covariates
COLT 2023
A Second-Order Method for Stochastic Bandit Convex Optimisation
COLT 2023
Context-lumpable stochastic bandits
NeurIPS 2023
Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost
ICML 2023
Leveraging Demonstrations to Improve Online Learning: Quality Matters
ICML 2023
Linear Partial Monitoring for Sequential Decision Making: Algorithms, Regret Bounds and Applications
JMLR 2023
Probabilistic Inference in Reinforcement Learning Done Right
NeurIPS 2023
Contextual Information-Directed Sampling
ICML 2022
Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini’s Regret
COLT 2022
Regret Bounds for Information-Directed Reinforcement Learning
NeurIPS 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits
COLT 2022
Asymptotically Optimal Information-Directed Sampling
COLT 2021
Bandit Phase Retrieval
NeurIPS 2021
Gated Linear Networks
AAAI 2021
Improved Regret for Zeroth-Order Stochastic Convex Bandits
COLT 2021
Information Directed Sampling for Sparse Linear Bandits
NeurIPS 2021
Matrix games with bandit feedback
UAI 2021
Mirror Descent and the Information Ratio
COLT 2021
Online Sparse Reinforcement Learning
AISTATS 2021
On the Optimality of Batch Policy Optimization Algorithms
ICML 2021
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient
ICML 2021
Variational Bayesian Optimistic Sampling
NeurIPS 2021
Adaptive Exploration in Linear Contextual Bandit
AISTATS 2020
Behaviour Suite for Reinforcement Learning
ICLR 2020
Exploration by Optimisation in Partial Monitoring
COLT 2020
Gaussian Gated Linear Networks
NeurIPS 2020
High-Dimensional Sparse Linear Bandits
NeurIPS 2020
Information Directed Sampling for Linear Partial Monitoring
COLT 2020
Learning with Good Feature Representations in Bandits and in RL with a Generative Model
ICML 2020
Linear bandits with Stochastic Delayed Feedback
ICML 2020
Model Selection in Contextual Stochastic Bandit Problems
NeurIPS 2020
A Geometric Perspective on Optimal Representations for Reinforcement Learning
NeurIPS 2019
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring
COLT 2019
BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback
UAI 2019
Cleaning up the neighborhood: A full classification for adversarial partial monitoring
ALT 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio
NeurIPS 2019
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits
ICML 2019
Iterative Budgeted Exponential Search
IJCAI 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits
UAI 2019
Online Learning to Rank with Features
ICML 2019
Refining the Confidence Level for Optimistic Bandit Strategies
JMLR 2018
Single-Agent Policy Tree Search With Guarantees
NeurIPS 2018
TopRank: A practical algorithm for online stochastic ranking
NeurIPS 2018
A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis
NeurIPS 2017
Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities
JMLR 2017
On Thompson Sampling and Asymptotic Optimality
IJCAI 2017
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
ALT 2017
The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits
AISTATS 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning
NeurIPS 2017
Causal Bandits: Learning Good Interventions via Causal Inference
NeurIPS 2016
Conservative Bandits
ICML 2016
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities
NeurIPS 2016
On Explore-Then-Commit strategies
NeurIPS 2016
Refined Lower Bounds for Adversarial Bandits
NeurIPS 2016
Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits
COLT 2016
Linear Multi-Resource Allocation with Semi-Bandit Feedback
NeurIPS 2015
The Pareto Regret Frontier for Bandits
NeurIPS 2015
Bounded Regret for Finite-Armed Structured Bandits
NeurIPS 2014
The Sample-Complexity of General Reinforcement Learning
ICML 2013