538 citations · 1.1k across the 31 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.AI2016
Efficient iterative policy optimization
Nicolas Le Roux
We tackle the issue of finding a good policy when the number of policy updates is limited. This is done by approximating the expected policy reward as a sequence of concave lower b…
cs.LG2016
Tighter bounds lead to improved classifiers
Nicolas Le Roux
The standard approach to supervised classification involves the minimization of a log-loss as an upper bound to the classification error. While this is a tight bound early on in th…