Sciweavers

180 search results - page 19 / 36
» Improved bounds on the sample complexity of learning
Sort
View
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
14 years 1 months ago
Active Learning Driven Data Acquisition for Sensor Networks
Online monitoring of a physical phenomenon over a geographical area is a popular application of sensor networks. Networks representative of this class of applications are typicall...
Anish Muttreja, Anand Raghunathan, Srivaths Ravi, ...
ICML
2001
IEEE
14 years 8 months ago
Smoothed Bootstrap and Statistical Data Cloning for Classifier Evaluation
This work is concerned with the estimation of a classifier's accuracy. We first review some existing methods for error estimation, focusing on cross-validation and bootstrap,...
Gregory Shakhnarovich, Ran El-Yaniv, Yoram Baram
UAI
2008
13 years 9 months ago
CORL: A Continuous-state Offset-dynamics Reinforcement Learner
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...
Emma Brunskill, Bethany R. Leffler, Lihong Li, Mic...
COLT
2010
Springer
13 years 5 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
IUI
1999
ACM
13 years 12 months ago
Programming by Demonstration: An Inductive Learning Formulation
Although Programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-speci...
Tessa A. Lau, Daniel S. Weld