Sciweavers

2263 search results - page 35 / 453
» On learning in agent-centered search
Sort
View
ICAART
2010
INSTICC
15 years 9 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
COLING
2010
14 years 6 months ago
Learning Web Query Patterns for Imitating Wikipedia Articles
This paper presents a novel method for acquiring a set of query patterns to retrieve documents containing important information about an entity. Given an existing Wikipedia catego...
Shohei Tanaka, Naoaki Okazaki, Mitsuru Ishizuka
NDT
2010
14 years 10 months ago
Web Document Classification by Keywords Using Random Forests
Web directory hierarchy is critical to serve user’s search request. Creating and maintaining such directories without human experts involvement requires good classification of we...
Myungsook Klassen, Nikhila Paturi
103
Voted
ICMLA
2010
14 years 9 months ago
Multimodal Parameter-exploring Policy Gradients
Abstract-- Policy Gradients with Parameter-based Exploration (PGPE) is a novel model-free reinforcement learning method that alleviates the problem of high-variance gradient estima...
Frank Sehnke, Alex Graves, Christian Osendorfer, J...
ICML
2004
IEEE
16 years 20 days ago
A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
Lourdes Peña Castillo, Stefan Wrobel