Sciweavers

455 search results - page 34 / 91
» Adaptive Sampling for Noisy Problems
Sort
View
PRL
2002
104views more  PRL 2002»
13 years 7 months ago
Writer adaptation techniques in HMM based Off-Line Cursive Script Recognition
This work presents the application of HMM adaptation techniques to the problem of Off-Line Cursive Script Recognition. Rather than training a new model for each writer, one first ...
Alessandro Vinciarelli, Samy Bengio
CVPR
2008
IEEE
14 years 9 months ago
Face tracking and recognition with visual constraints in real-world videos
We address the problem of tracking and recognizing faces in real-world, noisy videos. We track faces using a tracker that adaptively builds a target model reflecting changes in ap...
Minyoung Kim, Sanjiv Kumar, Vladimir Pavlovic, Hen...
ICML
2008
IEEE
14 years 8 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
WSC
2008
13 years 10 months ago
The knowledge-gradient stopping rule for ranking and selection
We consider the ranking and selection of normal means in a fully sequential Bayesian context. By considering the sampling and stopping problems jointly rather than separately, we ...
Peter Frazier, Warren B. Powell
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 7 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...