Sciweavers

112 search results - page 11 / 23
» Beam sampling for the infinite hidden Markov model
Sort
View
JMLR
2010
202views more  JMLR 2010»
13 years 2 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
INTERSPEECH
2010
13 years 2 months ago
Incremental word learning using large-margin discriminative training and variance floor estimation
We investigate incremental word learning in a Hidden Markov Model (HMM) framework suitable for human-robot interaction. In interactive learning, the tutoring time is a crucial fac...
Irene Ayllón Clemente, Martin Heckmann, Ale...
AIPS
2000
13 years 8 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
ICML
2007
IEEE
14 years 8 months ago
Statistical predicate invention
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in struct...
Stanley Kok, Pedro Domingos
KBSE
2009
IEEE
14 years 2 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller