Sciweavers

157 search results - page 6 / 32
» icml 2007
Sort
View
91
Voted
ICML
2007
IEEE
16 years 1 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
ICML
2007
IEEE
16 years 1 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
110
Voted
ICML
2007
IEEE
16 years 1 months ago
Dimensionality reduction and generalization
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
Sofia Mosci, Lorenzo Rosasco, Alessandro Verri
99
Voted
ICML
2007
IEEE
16 years 1 months ago
Adaptive dimension reduction using discriminant analysis and K-means clustering
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...
Chris H. Q. Ding, Tao Li
119
Voted
ICML
2007
IEEE
16 years 1 months ago
A transductive framework of distance metric learning by spectral dimensionality reduction
Distance metric learning and nonlinear dimensionality reduction are two interesting and active topics in recent years. However, the connection between them is not thoroughly studi...
Fuxin Li, Jian Yang, Jue Wang