ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce versio...
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
This paper describes an algorithm for generating compact 3D models of indoor environments with mobile robots. Our algorithm employs the expectation maximization algorithm to fit a...
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
Data noise is present in many machine learning problems domains, some of these are well studied but others have received less attention. In this paper we propose an algorithm for ...
ICML
2001
IEEE
15 years 7 days ago
2001
IEEE
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...