Sciweavers

701 search results - page 64 / 141
» Self Bounding Learning Algorithms
Sort
View
ECML
2006
Springer
13 years 11 months ago
Bandit Based Monte-Carlo Planning
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
Levente Kocsis, Csaba Szepesvári
ICML
2010
IEEE
13 years 8 months ago
Generalizing Apprenticeship Learning across Hypothesis Classes
This paper develops a generalized apprenticeship learning protocol for reinforcementlearning agents with access to a teacher who provides policy traces (transition and reward obse...
Thomas J. Walsh, Kaushik Subramanian, Michael L. L...
ICML
2001
IEEE
14 years 8 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 7 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
ML
1998
ACM
102views Machine Learning» more  ML 1998»
13 years 7 months ago
Statistical Mechanics of Online Learning of Drifting Concepts: A Variational Approach
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
Renato Vicente, Osame Kinouchi, Nestor Caticha