Sciweavers

59 search results - page 6 / 12
» Minimax Bounds for Active Learning
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Multi-View Active Learning in the Non-Realizable Case
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
Wei Wang, Zhi-Hua Zhou
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 12 hour ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
COLT
2010
Springer
13 years 5 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
ALT
2008
Springer
14 years 4 months ago
Optimally Learning Social Networks with Activations and Suppressions
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
Dana Angluin, James Aspnes, Lev Reyzin
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 1 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme