Sciweavers

140 search results - page 13 / 28
» icml 2005
Sort
View
72
Voted
ICML
2005
IEEE
15 years 10 months ago
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
H. Brendan McMahan, Maxim Likhachev, Geoffrey J. G...
ICML
2005
IEEE
15 years 10 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
ICML
2005
IEEE
15 years 10 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
ICML
2005
IEEE
15 years 10 months ago
Learning strategies for story comprehension: a reinforcement learning approach
This paper describes the use of machine learning to improve the performance of natural language question answering systems. We present a model for improving story comprehension th...
Eugene Grois, David C. Wilkins
66
Voted
ICML
2005
IEEE
15 years 10 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi