Optimizing Estimated Loss Reduction for Active Sampling in Rank Learning thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Optimizing Estimated Loss Reduction for Active Sampling in Rank Learning

Published on Aug 29, 20085082 Views

Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of instances in the input spa

Related categories