Revision as of 17:52, 17 January 2019

Home * People * Tor Lattimore

Tor Lattimore ^[1]

Tor Lattimore,
an Australian computer scientist and since 2017 research scientist at DeepMind in London, Ph.D. in 2013 with Marcus Hutter at Australian National University, and postdoc at University of Alberta supervised by Csaba Szepesvári. His research interests include various machine learning topics and optimization problems, in particular reinforcement learning, probably approximately correct learning in Markov decision processes and multi-armed bandit problems. As a chess player, and former computer chess programmer, Tor Lattimore is author of the Chess Engine Communication Protocol compatible chess engine SEE ^[2], which participated at various Australasian National Computer Chess Championship and CCT Tournaments.

Selected Publications

Tor Lattimore (2015). Optimally Confident UCB: Improved Regret for Finite-Armed Bandits. arXiv:1507.07880
Tor Lattimore (2016). Regret Analysis of the Anytime Optimally Confident UCB Algorithm. arXiv:1603.08661
Tom Everitt, Tor Lattimore, Marcus Hutter (2016). Free Lunch for Optimisation under the Universal Distribution. arXiv:1608.04544
Tor Lattimore, Csaba Szepesvári (2017). The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits. AISTATS, pdf, arXiv:1610.04491 (2016)
Joel Veness, Tor Lattimore, Avishkar Bhoopchand, Agnieszka Grabska-Barwinska, Christopher Mattern, Peter Toth (2017). Online Learning with Gated Linear Networks. arXiv:1712.0189
Tor Lattimore, Csaba Szepesvári (2018). Cleaning up the neighborhood: A full classification for adversarial partial monitoring. arXiv:1805.09247
Tor Lattimore, Csaba Szepesvári (2019). Bandit Algorithms. Cambridge University Press (draft), pdf

@@ Line 19: / Line 19: @@
 * [[Tor Lattimore]], [[Marcus Hutter]] ('''2012'''). ''PAC Bounds for Discounted MDPs''. [http://www.informatik.uni-trier.de/~ley/db/conf/alt/alt2012.htm Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], [https://en.wikipedia.org/wiki/Springer-Verlag Springer] <ref>[https://en.wikipedia.org/wiki/Markov_decision_process Markov decision process from Wikipedia]</ref>
 * [[Tor Lattimore]], [[Marcus Hutter]] ('''2014'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-11662-4_13 Bayesian Reinforcement Learning with Exploration]''. [http://dblp.uni-trier.de/db/conf/alt/alt2014.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 8776, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
-* [[Tor Lattimore]], [[Remi Munos]] ('''2014'''). ''Bounded Regret for Finite-Armed Structured Bandits''. [https://arxiv.org/abs/1411.2919 arXiv:1411.2919]
+* [[Tor Lattimore]], [[Rémi Munos]] ('''2014'''). ''Bounded Regret for Finite-Armed Structured Bandits''. [https://arxiv.org/abs/1411.2919 arXiv:1411.2919]
 ==2015 ...==
 * [[Tor Lattimore]] ('''2015'''). ''Optimally Confident UCB: Improved Regret for Finite-Armed Bandits''. [https://arxiv.org/abs/1507.07880 arXiv:1507.07880]