activity
20102026
most citedLearning with a Strong Adversary

255 citations · 2.4k across the 127 of their papers we have counts for

collaborators
Showing 2019 · cs.LGShow all

15 papers · 2 filters

cs.LG2019★ 7 cited

Autonomous exploration for navigating in non-stationary CMPs

Pratik Gajane, Ronald Ortner, Peter Auer +1

We consider a setting in which the objective is to learn to navigate in a controlled Markov process (CMP) where transition probabilities may abruptly change. For this setting, we p…

cs.LG2019★ 6 cited

Adaptive Exploration in Linear Contextual Bandit

Botao Hao, Tor Lattimore, Csaba Szepesvari

Contextual bandits serve as a fundamental model for many sequential decision making tasks. The most popular theoretically justified approaches are based on the optimism principle.…

cs.LG2019★ 4 cited

Efron-Stein PAC-Bayesian Inequalities

Ilja Kuzborskij, Csaba Szepesvári

We prove semi-empirical concentration inequalities for random variables which are given as possibly nonlinear functions of independent random variables. These inequalities describe…

cs.LG2019★ 19 cited

Exploration-Enhanced POLITEX

Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvari +1

We study algorithms for average-cost reinforcement learning problems with value function approximation. Our starting point is the recently proposed POLITEX algorithm, a version of…

cs.LG2019★ 15 cited

PAC-Bayes with Backprop

Omar Rivasplata, Vikram M Tankasali, Csaba Szepesvari

We explore the family of methods "PAC-Bayes with Backprop" (PBB) to train probabilistic neural networks by minimizing PAC-Bayes bounds. We present two training objectives, one deri…

cs.LG2019★ 33 cited

Behaviour Suite for Reinforcement Learning

Ian Osband, Yotam Doron, Matteo Hessel +11

This paper introduces the Behaviour Suite for Reinforcement Learning, or bsuite for short. bsuite is a collection of carefully-designed experiments that investigate core capabiliti…