Sign inSign up
Label optimal regret bounds for online local learning thumbnail
slide-image
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Label optimal regret bounds for online local learning

Published on Aug 20, 20152413 Views

Andrej Risteski

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

COLT 2015 - Paris

Related categories

Active LearningComputational Learning TheoryOn-line LearningReinforcement LearningSemi-supervised Learning

Chapter list

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