Sciweavers

1900 search results - page 118 / 380
» Gaussian Processes in Machine Learning
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Discovering options from example trajectories
We present a novel technique for automated problem decomposition to address the problem of scalability in reinforcement learning. Our technique makes use of a set of near-optimal ...
Peng Zang, Peng Zhou, David Minnen, Charles Lee Is...
ICML
2004
IEEE
14 years 10 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
COLT
2006
Springer
14 years 24 days ago
Unifying Divergence Minimization and Statistical Inference Via Convex Duality
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
Yasemin Altun, Alexander J. Smola
ICML
2005
IEEE
14 years 10 months ago
Large margin non-linear embedding
It is common in classification methods to first place data in a vector space and then learn decision boundaries. We propose reversing that process: for fixed decision boundaries, ...
Alexander Zien, Joaquin Quiñonero Candela
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 8 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir