Sciweavers

1106 search results - page 83 / 222
» On regularization algorithms in learning theory
Sort
View
ICML
1999
IEEE
16 years 5 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
141
Voted
JMLR
2010
106views more  JMLR 2010»
14 years 11 months ago
Why Does Unsupervised Pre-training Help Deep Learning?
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtai...
Dumitru Erhan, Yoshua Bengio, Aaron C. Courville, ...
171
Voted
MIAR
2006
IEEE
15 years 11 months ago
A General Learning Framework for Non-rigid Image Registration
This paper presents a general learning framework for non-rigid registration of MR brain images. Given a set of training MR brain images, three major types of information are partic...
Guorong Wu, Feihu Qi, Dinggang Shen
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
15 years 2 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
SOFSEM
2010
Springer
16 years 1 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour