Sign inSign up
Sequential Information Maximization: When is Greedy Near-optimal? 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

Sequential Information Maximization: When is Greedy Near-optimal?

Published on Aug 20, 20151972 Views

Yuxin Chen

Optimal information gathering is a central challenge in machine learning and science in general. A common objective that quantifies the usefulness of observations is Shannon's mutual information, defi

COLT 2015 - Paris

Related categories

Active LearningComputational Learning TheoryOn-line LearningReinforcement LearningSemi-supervised Learning

Chapter list

Sequential Information Maximization When is Greedy Near-optimal?00:00
The Sequential Information Maximization Problem - 100:20
The Sequential Information Maximization Problem - 200:25
The Sequential Information Maximization Problem - 300:31
The Sequential Information Maximization Problem - 400:50
The Sequential Information Maximization Problem - 500:56
The Sequential Information Maximization Problem - 601:04
The Sequential Information Maximization Problem - 701:13
The Sequential Information Maximization Problem - 801:16
The Sequential Information Maximization Problem - 901:18
The Sequential Information Maximization Problem - 1001:19
The Sequential Information Maximization Problem - 1101:20
The Sequential Information Maximization Problem - 1201:21
The Sequential Information Maximization Problem - 1301:22
The Sequential Information Maximization Problem - 1401:23
The Sequential Information Maximization Problem - 1501:25
The Sequential Information Maximization Problem - 1601:42
The Greedy Algorithm02:01
Main Result - 103:27
Main Result - 204:39