activity
20182025
most citedUniversally Consistent Online Learning with Arbitrarily Dependent Responses

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.LG2021

Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible?

Steve Hanneke

This open problem asks whether there exists an online learning algorithm for binary classification that guarantees, for all target concepts, to make a sublinear number of mistakes,…