Sciweavers

1343 search results - page 135 / 269
» Learning to Complete Sentences
Sort
View
IJCAI
2001
13 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ICML
2010
IEEE
13 years 11 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
IJRR
2010
93views more  IJRR 2010»
13 years 8 months ago
Autonomous Helicopter Aerobatics through Apprenticeship Learning
Autonomous helicopter flight is widely regarded to be a highly challenging control problem. Despite this fact, human experts can reliably fly helicopters through a wide range of m...
Pieter Abbeel, Adam Coates, Andrew Y. Ng
NECO
2010
136views more  NECO 2010»
13 years 8 months ago
Learning to Represent Spatial Transformations with Factored Higher-Order Boltzmann Machines
To allow the hidden units of a restricted Boltzmann machine to model the transformation between two successive images, Memisevic and Hinton (2007) introduced three-way multiplicat...
Roland Memisevic, Geoffrey E. Hinton
ML
2010
ACM
175views Machine Learning» more  ML 2010»
13 years 5 months ago
Concept learning in description logics using refinement operators
With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applica...
Jens Lehmann, Pascal Hitzler