Sciweavers

2263 search results - page 115 / 453
» On learning in agent-centered search
Sort
View
UAI
2000
15 years 7 months ago
Exploiting Qualitative Knowledge in the Learning of Conditional Probabilities of Bayesian Networks
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
Frank Wittig, Anthony Jameson
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
15 years 4 months ago
Uncertainty handling CMA-ES for reinforcement learning
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
Verena Heidrich-Meisner, Christian Igel
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 6 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
AAAI
2010
15 years 7 months ago
Learning Simulation Control in General Game-Playing Agents
The aim of General Game Playing (GGP) is to create intelligent agents that can automatically learn how to play many different games at an expert level without any human interventi...
Hilmar Finnsson, Yngvi Björnsson
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 6 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....