25,161
edits
Changes
Created page with "'''Home * People * Tor Lattimore''' FILE:TorLattimore.jpg|border|right|thumb|link=http://tor-lattimore.com/| Tor Lattimore <ref>[http://tor-lattimore.com/..."
'''[[Main Page|Home]] * [[People]] * Tor Lattimore'''
[[FILE:TorLattimore.jpg|border|right|thumb|link=http://tor-lattimore.com/| Tor Lattimore <ref>[http://tor-lattimore.com/ Tor Lattimore - Homepage]</ref> ]]
'''Tor Lattimore''',<br/>
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 [[Learning|machine learning]] topics and [https://en.wikipedia.org/wiki/Optimization_problem optimization problems],
in particular [[Reinforcement Learning|reinforcement learning]], [https://en.wikipedia.org/wiki/Probably_approximately_correct_learning probably approximately correct learning]
in [https://en.wikipedia.org/wiki/Markov_decision_process Markov decision processes] and [https://en.wikipedia.org/wiki/Multi-armed_bandit 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]] <ref>[http://home.netspeed.com.au/lattimore/ SEE - the chess engine]</ref>, which participated at various [[Australasian National Computer Chess Championship]] and [[CCT Tournaments]].
=Selected Publications=
<ref>[http://tor-lattimore.com/publications/ Tor Lattimore Publications]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/l/Lattimore:Tor.html dblp: Tor Lattimore]</ref>
==2010 ...==
* [[Tor Lattimore]], [[Marcus Hutter]], [https://dblp.uni-trier.de/pers/hd/g/Gavane:Vaibhav.html Vaibhav Gavane] ('''2011'''). ''Universal Prediction of Selected Bits''. [https://dblp.uni-trier.de/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer-Verlag Springer], [https://arxiv.org/abs/1107.5531 arXiv:1107.5531]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''Asymptotically Optimal Agents''. [https://dblp.uni-trier.de/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer-Verlag Springer]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''Time Consistent Discounting''. [https://dblp.uni-trier.de/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer-Verlag Springer], [https://arxiv.org/abs/1107.5528 arXiv:1107.5528]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''No Free Lunch versus Occam's Razor in Supervised Learning''. [https://en.wikipedia.org/wiki/Ray_Solomonoff Solomonoff] Memorial, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], [https://en.wikipedia.org/wiki/Springer-Verlag Springer], [https://arxiv.org/abs/1111.3846 arXiv:1111.3846] <ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization - Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Occam%27s_razor Occam's razor from Wikipedia]</ref>
* [[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]
==2015 ...==
* [[Tor Lattimore]] ('''2015'''). ''Optimally Confident UCB: Improved Regret for Finite-Armed Bandits''. [https://arxiv.org/abs/1507.07880 arXiv:1507.07880]
* [[Tor Lattimore]] ('''2016'''). ''Regret Analysis of the Anytime Optimally Confident UCB Algorithm''. [https://arxiv.org/abs/1603.08661 arXiv:1603.08661]
* [[Tom Everitt]], [[Tor Lattimore]], [[Marcus Hutter]] ('''2016'''). ''Free Lunch for Optimisation under the Universal Distribution''. [https://arxiv.org/abs/1608.04544 arXiv:1608.04544]
* [[Tor Lattimore]], [[Csaba Szepesvári]] ('''2017'''). ''The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits''. [https://www.aistats.org/aistats2017/ AISTATS], [https://sites.ualberta.ca/~szepesva/papers/linbandits_aistats17.pdf pdf], [https://arxiv.org/abs/1610.04491 arXiv:1610.04491] (2016)
* [[Joel Veness]], [[Tor Lattimore]], [https://github.com/avishkar58 Avishkar Bhoopchand], [https://scholar.google.co.uk/citations?user=mB4yebIAAAAJ&hl=en Agnieszka Grabska-Barwinska], [https://dblp.org/pers/hd/m/Mattern:Christopher Christopher Mattern], [https://dblp.org/pers/hd/t/Toth:Peter Peter Toth] ('''2017'''). ''Online Learning with Gated Linear Networks''. [https://arxiv.org/abs/1712.01897 arXiv:1712.0189]
* [[Tor Lattimore]], [[Csaba Szepesvári]] ('''2018'''). ''Cleaning up the neighborhood: A full classification for adversarial partial monitoring''. [https://arxiv.org/abs/1805.09247 arXiv:1805.09247]
* [[Tor Lattimore]], [[Csaba Szepesvári]] ('''2019'''). ''Bandit Algorithms''. Cambridge University Press (draft), [http://downloads.tor-lattimore.com/banditbook/book.pdf pdf]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=373656 pawn hash] by [[Tor Lattimore]], [[CCC]], July 03, 2004 » [[Pawn Hash Table]]
* [https://www.stmintz.com/ccc/index.php?id=381595 MTD Drivers] by [[Tor Lattimore]], [[CCC]], August 10, 2004 » [[MTD(f)]]
* [https://www.stmintz.com/ccc/index.php?id=385027 Qsearch Checks] by [[Tor Lattimore]], [[CCC]], August 29, 2004 » [[Quiescence Search]], [[Check]]
=External Links=
* [http://tor-lattimore.com/ Tor Lattimore - Homepage]
: [http://banditalgs.com/ Bandit Algorithms]
* [https://github.com/tor tor (Tor Lattimore) · GitHub]
* [https://plus.google.com/+TorLattimore Tor Lattimore - Google+]
* [http://ratings.fide.com/card.phtml?event=3205711 Lattimore, Tor FIDE Chess Profile]
* [https://www.365chess.com/players/Tor_Lattimore Tor Lattimore chess games - 365Chess.com]
* [http://chessexpress.blogspot.de/2007/10/ow-my-brain-hurts.html chessexpress: Ow, my brain hurts] by [[Shaun Press]], October 03, 2007
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Player|Lattimore]]
[[Category:Chess Programmer|Lattimore]]
[[Category:Researcher|Lattimore]]
[[FILE:TorLattimore.jpg|border|right|thumb|link=http://tor-lattimore.com/| Tor Lattimore <ref>[http://tor-lattimore.com/ Tor Lattimore - Homepage]</ref> ]]
'''Tor Lattimore''',<br/>
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 [[Learning|machine learning]] topics and [https://en.wikipedia.org/wiki/Optimization_problem optimization problems],
in particular [[Reinforcement Learning|reinforcement learning]], [https://en.wikipedia.org/wiki/Probably_approximately_correct_learning probably approximately correct learning]
in [https://en.wikipedia.org/wiki/Markov_decision_process Markov decision processes] and [https://en.wikipedia.org/wiki/Multi-armed_bandit 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]] <ref>[http://home.netspeed.com.au/lattimore/ SEE - the chess engine]</ref>, which participated at various [[Australasian National Computer Chess Championship]] and [[CCT Tournaments]].
=Selected Publications=
<ref>[http://tor-lattimore.com/publications/ Tor Lattimore Publications]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/l/Lattimore:Tor.html dblp: Tor Lattimore]</ref>
==2010 ...==
* [[Tor Lattimore]], [[Marcus Hutter]], [https://dblp.uni-trier.de/pers/hd/g/Gavane:Vaibhav.html Vaibhav Gavane] ('''2011'''). ''Universal Prediction of Selected Bits''. [https://dblp.uni-trier.de/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer-Verlag Springer], [https://arxiv.org/abs/1107.5531 arXiv:1107.5531]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''Asymptotically Optimal Agents''. [https://dblp.uni-trier.de/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer-Verlag Springer]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''Time Consistent Discounting''. [https://dblp.uni-trier.de/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer-Verlag Springer], [https://arxiv.org/abs/1107.5528 arXiv:1107.5528]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''No Free Lunch versus Occam's Razor in Supervised Learning''. [https://en.wikipedia.org/wiki/Ray_Solomonoff Solomonoff] Memorial, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], [https://en.wikipedia.org/wiki/Springer-Verlag Springer], [https://arxiv.org/abs/1111.3846 arXiv:1111.3846] <ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization - Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Occam%27s_razor Occam's razor from Wikipedia]</ref>
* [[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]
==2015 ...==
* [[Tor Lattimore]] ('''2015'''). ''Optimally Confident UCB: Improved Regret for Finite-Armed Bandits''. [https://arxiv.org/abs/1507.07880 arXiv:1507.07880]
* [[Tor Lattimore]] ('''2016'''). ''Regret Analysis of the Anytime Optimally Confident UCB Algorithm''. [https://arxiv.org/abs/1603.08661 arXiv:1603.08661]
* [[Tom Everitt]], [[Tor Lattimore]], [[Marcus Hutter]] ('''2016'''). ''Free Lunch for Optimisation under the Universal Distribution''. [https://arxiv.org/abs/1608.04544 arXiv:1608.04544]
* [[Tor Lattimore]], [[Csaba Szepesvári]] ('''2017'''). ''The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits''. [https://www.aistats.org/aistats2017/ AISTATS], [https://sites.ualberta.ca/~szepesva/papers/linbandits_aistats17.pdf pdf], [https://arxiv.org/abs/1610.04491 arXiv:1610.04491] (2016)
* [[Joel Veness]], [[Tor Lattimore]], [https://github.com/avishkar58 Avishkar Bhoopchand], [https://scholar.google.co.uk/citations?user=mB4yebIAAAAJ&hl=en Agnieszka Grabska-Barwinska], [https://dblp.org/pers/hd/m/Mattern:Christopher Christopher Mattern], [https://dblp.org/pers/hd/t/Toth:Peter Peter Toth] ('''2017'''). ''Online Learning with Gated Linear Networks''. [https://arxiv.org/abs/1712.01897 arXiv:1712.0189]
* [[Tor Lattimore]], [[Csaba Szepesvári]] ('''2018'''). ''Cleaning up the neighborhood: A full classification for adversarial partial monitoring''. [https://arxiv.org/abs/1805.09247 arXiv:1805.09247]
* [[Tor Lattimore]], [[Csaba Szepesvári]] ('''2019'''). ''Bandit Algorithms''. Cambridge University Press (draft), [http://downloads.tor-lattimore.com/banditbook/book.pdf pdf]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=373656 pawn hash] by [[Tor Lattimore]], [[CCC]], July 03, 2004 » [[Pawn Hash Table]]
* [https://www.stmintz.com/ccc/index.php?id=381595 MTD Drivers] by [[Tor Lattimore]], [[CCC]], August 10, 2004 » [[MTD(f)]]
* [https://www.stmintz.com/ccc/index.php?id=385027 Qsearch Checks] by [[Tor Lattimore]], [[CCC]], August 29, 2004 » [[Quiescence Search]], [[Check]]
=External Links=
* [http://tor-lattimore.com/ Tor Lattimore - Homepage]
: [http://banditalgs.com/ Bandit Algorithms]
* [https://github.com/tor tor (Tor Lattimore) · GitHub]
* [https://plus.google.com/+TorLattimore Tor Lattimore - Google+]
* [http://ratings.fide.com/card.phtml?event=3205711 Lattimore, Tor FIDE Chess Profile]
* [https://www.365chess.com/players/Tor_Lattimore Tor Lattimore chess games - 365Chess.com]
* [http://chessexpress.blogspot.de/2007/10/ow-my-brain-hurts.html chessexpress: Ow, my brain hurts] by [[Shaun Press]], October 03, 2007
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Player|Lattimore]]
[[Category:Chess Programmer|Lattimore]]
[[Category:Researcher|Lattimore]]
