Search Results for author:
Found 1 papers, 0 papers with code
Bounds on the price of feedback for mistake-bounded online learning
In particular, we sharpen an upper bound for delayed ambiguous reinforcement learning by a factor of 2 and an upper bound for learning compositions of families of functions by a factor of 2. 41.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
