Sciweavers

243 search results - page 9 / 49
» Learning Abstraction Hierarchies for Problem Solving
Sort
View
ICANN
2007
Springer
14 years 2 months ago
Solving Deep Memory POMDPs with Recurrent Policy Gradients
Abstract. This paper presents Recurrent Policy Gradients, a modelfree reinforcement learning (RL) method creating limited-memory stochastic policies for partially observable Markov...
Daan Wierstra, Alexander Förster, Jan Peters,...
ORL
2010
108views more  ORL 2010»
13 years 3 months ago
Weak aggregating algorithm for the distribution-free perishable inventory problem
Abstract. We formulate the multiperiod, distribution-free perishable inventory problem as a problem of prediction with expert advice and apply an online learning method (the Weak A...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
SAB
2010
Springer
189views Optimization» more  SAB 2010»
13 years 6 months ago
TeXDYNA: Hierarchical Reinforcement Learning in Factored MDPs
Reinforcement learning is one of the main adaptive mechanisms that is both well documented in animal behaviour and giving rise to computational studies in animats and robots. In th...
Olga Kozlova, Olivier Sigaud, Christophe Meyer
ICMLC
2005
Springer
14 years 2 months ago
Kernel-Based Metric Adaptation with Pairwise Constraints
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
Hong Chang, Dit-Yan Yeung
ACMSE
2006
ACM
14 years 2 months ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen