Sciweavers

1900 search results - page 100 / 380
» Gaussian Processes in Machine Learning
Sort
View
ICML
2003
IEEE
14 years 9 months ago
On Kernel Methods for Relational Learning
Kernel methods have gained a great deal of popularity in the machine learning community as a method to learn indirectly in highdimensional feature spaces. Those interested in rela...
Chad M. Cumby, Dan Roth
ECML
2006
Springer
13 years 11 months ago
Reinforcement Learning for MDPs with Constraints
In this article, I will consider Markov Decision Processes with two criteria, each defined as the expected value of an infinite horizon cumulative return. The second criterion is e...
Peter Geibel
MLDM
2005
Springer
14 years 2 months ago
Unsupervised Learning of Visual Feature Hierarchies
We propose an unsupervised, probabilistic method for learning visual feature hierarchies. Starting from local, low-level features computed at interest point locations, the method c...
Fabien Scalzo, Justus H. Piater
ICML
2004
IEEE
14 years 2 months ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul
NIPS
2007
13 years 10 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh