Sciweavers

340 search results - page 53 / 68
» Kernelized value function approximation for reinforcement le...
Sort
View
ICPR
2008
IEEE
16 years 3 months ago
Fast protein homology and fold detection with sparse spatial sample kernels
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the or...
Pai-Hsi Huang, Pavel P. Kuksa, Vladimir Pavlovic
AIPS
2007
15 years 4 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
ECAI
2006
Springer
15 years 6 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
AAAI
2006
15 years 3 months ago
Supporting Queries with Imprecise Constraints
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
Ullas Nambiar, Subbarao Kambhampati
ICML
2010
IEEE
15 years 3 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre