0.25
0.5
0.75
1.25
1.5
1.75
2
Label optimal regret bounds for online local learning
Published on Feb 4, 20252425 Views
We resolve an open question from Christiano (2014b) posed in COLT’14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label set. In this framework
Related categories
Presentation
Label optimal regret bounds for online local learning00:00
Online local learning framework (Christiano ‘14)00:01
Framework00:23
Our results - 101:40
Our results - 202:28
Robust versions of planted clique - 102:55
Robust versions of planted clique - 203:25
Open problems03:40