Tor Lattimore
Impact in
-
- Advanced Bandit Algorithms Research
- Auction Theory and Applications
- Artificial Intelligence top 5%
- Reinforcement Learning in Robotics
- Machine Learning and Algorithms
- Data Stream Mining Techniques
Papers in
-
- Advanced Bandit Algorithms Research 27
- Auction Theory and Applications 4
-
- Machine Learning and Algorithms 10
- Reinforcement Learning in Robotics 10
- Stochastic Gradient Optimization Techniques 2
- Co-authors
- Csaba Szepesvári (13 shared papers)Marcus Hütter (5 shared papers)Rémi Munos (1 shared paper)Emma Brunskill (1 shared paper)Christoph Dann (1 shared paper)Koby Crammer (2 shared papers)András György (4 shared papers)Mark D. Reid (1 shared paper)
- Journals
- Theoretical Computer Science (3 papers)Journal of Machine Learning Research (2 papers)ANU Open Research (Australian National University) (3 papers)Conference on Learning Theory (4 papers)Uncertainty in Artificial Intelligence (1 paper)
- Partner nations
- CanadaUnited StatesUnited Kingdom
In The Last Decade
Tor Lattimore
29 papers receiving 614 citations
Tor Lattimore's Hit Papers
Peers
Comparison fields: 5 of 77
- Management Science and Operations Research 376
- Artificial Intelligence 315
- Computer Networks and Communications 178
- Computational Mathematics 4
- Computer Science Applications 25
Countries citing papers authored by Tor Lattimore
This map shows the geographic impact of Tor Lattimore's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tor Lattimore with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tor Lattimore more than expected).
Fields of papers citing papers by Tor Lattimore
This network shows the impact of papers produced by Tor Lattimore. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tor Lattimore. The network helps show where Tor Lattimore may publish in the future.
Co-authors
The 25 scholars most cited alongside Tor Lattimore, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Bandit Algorithms Hit paper breakdown → | 2020 | 461 |
| 2 | Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning | 2017 | 20 |
| 3 | 2014 | 17 | |
| 4 | 2014 | 16 | |
| 5 | Causal bandits: learning good interventions via causal inference | 2016 | 13 |
| 6 | Linear multi-resource allocation with semi-bandit feedback | 2015 | 12 |
| 7 | 2013 | 12 | |
| 8 | Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities | 2017 | 9 |
| 9 | TopRank: A practical algorithm for online stochastic ranking | 2018 | 8 |
| 10 | A Geometric Perspective on Optimal Representations for Reinforcement Learning | 2019 | 8 |
| 11 | Linear bandits with Stochastic Delayed Feedback | 2020 | 8 |
| 12 | Learning with Good Feature Representations in Bandits and in RL with a Generative Model | 2020 | 6 |
| 13 | 2014 | 6 | |
| 14 | 2016 | 6 | |
| 15 | Refining the Confidence Level for Optimistic Bandit Strategies | 2018 | 4 |
| 16 | Improved Regret for Zeroth-Order Stochastic Convex Bandits | 2021 | 3 |
| 17 | Single-Agent Policy Tree Search With Guarantees | 2018 | 3 |
| 18 | 2017 | 3 | |
| 19 | An Information-Theoretic Approach to Minimax Regret in Partial Monitoring. | 2019 | 2 |
| 20 | Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient | 2021 | 2 |
About Tor Lattimore
Tor Lattimore is a scholar working on Management Science and Operations Research, Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering and Molecular Biology, having authored 32 papers that have together received 630 indexed citations. Recurring topics across this work include Advanced Bandit Algorithms Research (27 papers), Machine Learning and Algorithms (10 papers), Reinforcement Learning in Robotics (10 papers), Optimization and Search Problems (9 papers), Auction Theory and Applications (4 papers), Smart Grid Energy Management (3 papers), Distributed Sensor Networks and Detection Algorithms (2 papers) and Stochastic Gradient Optimization Techniques (2 papers). The work is most often cited by research in Management Science and Operations Research (376 citations), Artificial Intelligence (315 citations), Computer Networks and Communications (178 citations), Computational Mathematics (4 citations) and Computer Science Applications (25 citations). Tor Lattimore has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Csaba Szepesvári, Marcus Hütter, Rémi Munos, Emma Brunskill, Christoph Dann, Koby Crammer, András György, Mark D. Reid, Ruitong Huang and Shuai Li. Their work appears in journals such as Theoretical Computer Science, Journal of Machine Learning Research, ANU Open Research (Australian National University), Conference on Learning Theory and Uncertainty in Artificial Intelligence.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.