Tor Lattimore
Tor Lattimore
DeepMind
Verifierad e-postadress på google.com - Startsida
Titel
Citeras av
Citeras av
År
Bandit algorithms
T Lattimore, C Szepesvári
Cambridge University Press, 2020
5632020
Unifying PAC and regret: Uniform PAC bounds for episodic reinforcement learning
C Dann, T Lattimore, E Brunskill
arXiv preprint arXiv:1703.07710, 2017
1182017
Optimal cluster recovery in the labeled stochastic block model
SY Yun, A Proutiere
Advances in Neural Information Processing Systems 29, 965-973, 2016
107*2016
PAC bounds for discounted MDPs
T Lattimore, M Hutter
International Conference on Algorithmic Learning Theory, 320-334, 2012
802012
The end of optimism? an asymptotic analysis of finite-armed linear bandits
T Lattimore, C Szepesvari
Artificial Intelligence and Statistics, 728-737, 2017
692017
Optimal cluster recovery in the labeled stochastic block model
SY Yun, A Proutiere
Advances in Neural Information Processing Systems, 965-973, 2016
572016
Behaviour suite for reinforcement learning
I Osband, Y Doron, M Hessel, J Aslanides, E Sezener, A Saraiva, ...
arXiv preprint arXiv:1908.03568, 2019
542019
Conservative bandits
Y Wu, R Shariff, T Lattimore, C Szepesvári
International Conference on Machine Learning, 1254-1262, 2016
512016
On explore-then-commit strategies
A Garivier, T Lattimore, E Kaufmann
Advances in Neural Information Processing Systems 29, 784-792, 2016
492016
Learning with good feature representations in bandits and in rl with a generative model
T Lattimore, C Szepesvari, G Weisz
International Conference on Machine Learning, 5662-5670, 2020
452020
Near-optimal PAC bounds for discounted MDPs
T Lattimore, M Hutter
Theoretical Computer Science 558, 125-143, 2014
392014
The sample-complexity of general reinforcement learning
T Lattimore, M Hutter, P Sunehag
International Conference on Machine Learning, 28-36, 2013
382013
Universal knowledge-seeking agents for stochastic environments
L Orseau, T Lattimore, M Hutter
International Conference on Algorithmic Learning Theory, 158-172, 2013
372013
Degenerate feedback loops in recommender systems
R Jiang, S Chiappa, T Lattimore, A György, P Kohli
Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 383-390, 2019
352019
Refined lower bounds for adversarial bandits
S Gerchinovitz, T Lattimore
arXiv preprint arXiv:1605.07416, 2016
352016
Bounded Regret for Finite-Armed Structured Bandits
T Lattimore, R Munos
352014
No free lunch versus Occam’s razor in supervised learning
T Lattimore, M Hutter
Algorithmic Probability and Friends. Bayesian Prediction and Artificial …, 2013
342013
A geometric perspective on optimal representations for reinforcement learning
MG Bellemare, W Dabney, R Dadashi, AA Taiga, PS Castro, NL Roux, ...
arXiv preprint arXiv:1901.11530, 2019
332019
Toprank: A practical algorithm for online stochastic ranking
T Lattimore, B Kveton, S Li, C Szepesvari
arXiv preprint arXiv:1806.02248, 2018
332018
Optimally confident UCB: Improved regret for finite-armed bandits
T Lattimore
arXiv preprint arXiv:1507.07880, 2015
312015
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20