65 search results - page 10 / 13 » A bound on the label complexity of agnostic active learning |
TCS
2011
13 years 6 days ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
CVPR
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose a person-dependent, manifold-based approach for modeling and tracking rigid and nonrigid 3D facial deformations from a monocular video sequence. The rigid and nonrigid ...
JMLR
2010
13 years 1 days ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
NIPS
2007
13 years 6 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...