Sciweavers

ECML
2005
Springer
14 years 5 months ago
Towards Finite-Sample Convergence of Direct Reinforcement Learning
Abstract. While direct, model-free reinforcement learning often performs better than model-based approaches in practice, only the latter have yet supported theoretical guarantees f...
Shiau Hong Lim, Gerald DeJong
ECML
2005
Springer
14 years 5 months ago
Margin-Sparsity Trade-Off for the Set Covering Machine
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
François Laviolette, Mario Marchand, Mohak ...
ECML
2005
Springer
14 years 5 months ago
A Model Based Method for Automatic Facial Expression Recognition
Automatic facial expression recognition is a research topic with interesting applications in the field of human-computer interaction, psychology and product marketing. The classi...
Hans van Kuilenburg, Marco Wiering, Marten den Uyl
ECML
2005
Springer
14 years 5 months ago
Active Learning for Probability Estimation Using Jensen-Shannon Divergence
Active selection of good training examples is an important approach to reducing data-collection costs in machine learning; however, most existing methods focus on maximizing classi...
Prem Melville, Stewart M. Yang, Maytal Saar-Tsecha...
ECML
2005
Springer
14 years 5 months ago
Machine Learning of Plan Robustness Knowledge About Instances
Abstract. Classical planning domain representations assume all the objects from one type are exactly the same. But when solving problems in the real world systems, the execution of...
Sergio Jiménez, Fernando Fernández, ...
ECML
2005
Springer
14 years 5 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
ECML
2005
Springer
14 years 5 months ago
Using Rewards for Belief State Updates in Partially Observable Markov Decision Processes
Partially Observable Markov Decision Processes (POMDP) provide a standard framework for sequential decision making in stochastic environments. In this setting, an agent takes actio...
Masoumeh T. Izadi, Doina Precup
ECML
2005
Springer
14 years 5 months ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
ECML
2005
Springer
14 years 5 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...