Sciweavers

3395 search results - page 79 / 679
» Learning to efficiently rank
Sort
View
NN
2010
Springer
187views Neural Networks» more  NN 2010»
13 years 3 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
ETS
2007
IEEE
95views Hardware» more  ETS 2007»
13 years 9 months ago
e-Lectures for Flexible Learning: a Study on their Learning Efficiency
Stavros N. Demetriadis, Andreas S. Pomportsis
ICML
2008
IEEE
14 years 9 months ago
Efficient bandit algorithms for online multiclass prediction
Sham M. Kakade, Shai Shalev-Shwartz, Ambuj Tewari
ICML
2006
IEEE
14 years 9 months ago
MISSL: multiple-instance semi-supervised learning
There has been much work on applying multiple-instance (MI) learning to contentbased image retrieval (CBIR) where the goal is to rank all images in a known repository using a smal...
Rouhollah Rahmani, Sally A. Goldman
IIR
2010
13 years 10 months ago
Sentence-Based Active Learning Strategies for Information Extraction
Given a classifier trained on relatively few training examples, active learning (AL) consists in ranking a set of unlabeled examples in terms of how informative they would be, if ...
Andrea Esuli, Diego Marcheggiani, Fabrizio Sebasti...