Gergely Neu
Gergely Neu
Artificial Intelligence and Machine Learning group, Universitat Pompeu Fabra
Verified email at upf.edu - Homepage
TitleCited byYear
Apprenticeship learning using inverse reinforcement learning and gradient methods
G Neu, C Szepesvári
Proc. UAI, 295-302, 2007
195*2007
Online Markov decision processes under bandit feedback
G Neu, A György, C Szepesvári, A Antos
Neural Information Processing Systems (NIPS), 2010
762010
Training parsers by inverse reinforcement learning
G Neu, C Szepesvári
Machine learning 77 (2), 303-337, 2009
582009
An efficient algorithm for learning with semi-bandit feedback
G Neu, G Bartók
Algorithmic Learning Theory (ALT 2013), 2013
482013
Efficient learning by implicit exploration in bandit problems with side observations
T Kocák, G Neu, M Valko, R Munos
Neural Information Processing Systems (NIPS), 2014
462014
A unified view of entropy-regularized Markov decision processes
G Neu, A Jonsson, V Gómez
arXiv preprint arXiv:1705.07798, 2017
402017
Exploiting easy data in online optimization
A Sani, G Neu, A Lazaric
Neural Information Processing Systems (NIPS), 2014
362014
Prediction by random-walk perturbation
L Devroye, G Lugosi, G Neu
The 26th Annual Conference on Learning Theory (COLT 2013), 460-473, 2013
302013
The online loop-free stochastic shortest-path problem
G Neu, A György, C Szepesvári
The 23rd Annual Conference on Learning Theory (COLT 2010), 2010
292010
Boltzmann Exploration Done Right
N Cesa-Bianchi, C Gentile, G Lugosi, G Neu
Neural Information Processing Systems (NIPS), 6287-6296, 2017
272017
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
G Neu
Neural Information Processing Systems (NIPS), 2015
272015
First-order regret bounds for combinatorial semi-bandits
G Neu
The 28th Annual Conference on Learning Theory (COLT 2015), 1360–1375, 2015
242015
Online Learning in Episodic Markovian Decision Processes by Relative Entropy Policy Search
A Zimin, G Neu
Neural Information Processing Systems (NIPS), 2013
202013
The adversarial stochastic shortest path problem with unknown transition probabilities
G Neu, A György, C Szepesvári
AI & Statistics, 2012
202012
Near-optimal rates for limited-delay universal lossy source coding
A Gyorgy, G Neu
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on …, 2011
202011
Algorithmic stability and hypothesis complexity
T Liu, G Lugosi, G Neu, D Tao
Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017
192017
Online learning with noisy side observations
T Kocák, G Neu, M Valko
International Conference on Artificial Intelligence and Statistics, 1186-1194, 2016
142016
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits
G Neu, G Bartók
Journal of Machine Learning Research 17 (154), 1-21, 2016
112016
Online combinatorial optimization with stochastic decision sets and adversarial losses
G Neu, M Valko
Neural Information Processing Systems (NIPS), 2014
102014
Collaborative spatial reuse in wireless networks via selfish multi-armed bandits
F Wilhelmi, C Cano, G Neu, B Bellalta, A Jonsson, S Barrachina-Muńoz
Ad Hoc Networks 88, 129-141, 2019
82019
The system can't perform the operation now. Try again later.
Articles 1–20