Sciweavers

ICML
2008
IEEE
15 years 10 days ago
An object-oriented representation for efficient reinforcement learning
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
Carlos Diuk, Andre Cohen, Michael L. Littman
ICML
2008
IEEE
15 years 10 days ago
A reproducing kernel Hilbert space framework for pairwise time series distances
A good distance measure for time series needs to properly incorporate the temporal structure, and should be applicable to sequences with unequal lengths. In this paper, we propose...
Zhengdong Lu, Todd K. Leen, Yonghong Huang, Deniz ...
ICML
2008
IEEE
15 years 10 days ago
Query-level stability and generalization in learning to rank
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
Yanyan Lan, Tie-Yan Liu, Tao Qin, Zhiming Ma, Hang...
ICML
2008
IEEE
15 years 10 days ago
Reinforcement learning in the presence of rare events
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
Jordan Frank, Shie Mannor, Doina Precup
ICML
2008
IEEE
15 years 10 days ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
ICML
2008
IEEE
15 years 10 days ago
Gaussian process product models for nonparametric nonstationarity
Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covaria...
Ryan Prescott Adams, Oliver Stegle
ICML
2008
IEEE
15 years 10 days ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
ICML
2008
IEEE
15 years 10 days ago
An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning
We show that linear value-function approximation is equivalent to a form of linear model approximation. We then derive a relationship between the model-approximation error and the...
Ronald Parr, Lihong Li, Gavin Taylor, Christopher ...
ICML
2008
IEEE
15 years 10 days ago
Optimizing estimated loss reduction for active sampling in rank learning
Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of insta...
Pinar Donmez, Jaime G. Carbonell
ICML
2008
IEEE
15 years 10 days ago
Large scale manifold transduction
We show how the regularizer of Transductive Support Vector Machines (TSVM) can be trained by stochastic gradient descent for linear models and multi-layer architectures. The resul...
Michael Karlen, Jason Weston, Ayse Erkan, Ronan Co...