Sciweavers

1351 search results - page 16 / 271
» Learning from compressed observations
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
EUROCRYPT
2007
Springer
14 years 1 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
EACL
2006
ACL Anthology
13 years 8 months ago
Discriminative Sentence Compression with Soft Syntactic Evidence
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
Ryan T. McDonald
ICML
2004
IEEE
14 years 8 months ago
Relational sequential inference with reliable observations
We present a trainable sequential-inference technique for processes with large state and observation spaces and relational structure. Our method assumes "reliable observation...
Alan Fern, Robert Givan
ICRA
2009
IEEE
161views Robotics» more  ICRA 2009»
14 years 2 months ago
Learning and generalization of motor skills by learning from demonstration
— We provide a general approach for learning robotic motor skills from human demonstration. To represent an observed movement, a non-linear differential equation is learned such ...
Peter Pastor, Heiko Hoffmann, Tamim Asfour, Stefan...