Gergely Neu
46 papers · 2010–2025 · 7 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 22 separate collaboration groups - the largest holds only 22% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Gergely Neu?
8 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
14 papers whose co-authors appear nowhere else under this name
Information-Theoretic Generalization Bounds for Stochastic Gradient Descent
COLT 2021
Logistic Q-Learning
AISTATS 2021
A Unifying View of Optimism in Episodic Reinforcement Learning
NeurIPS 2020
Algorithmic Learning Theory 2020: Preface
ALT 2020
Fast Rates for Online Prediction with Abstention
COLT 2020
Faster saddle-point optimization for solving large-scale Markov decision processes
L4DC 2020
Adaptive Temporal-Difference Learning for Policy Evaluation with Per-State Uncertainty Estimates
NeurIPS 2019
Bandit Principal Component Analysis
COLT 2019
Fast rates for online learning in Linearly Solvable Markov Decision Processes
COLT 2017
Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits
JMLR 2016
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
NeurIPS 2015
First-order regret bounds for combinatorial semi-bandits
COLT 2015
Exploiting easy data in online optimization
NeurIPS 2014
Online learning in episodic Markovian decision processes by relative entropy policy search
NeurIPS 2013