NIPS
2001
14 years 29 days ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
NIPS
2001
14 years 29 days ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
NIPS
2001
14 years 29 days ago
2001
Tangential hand velocity profiles of rapid human arm movements often appear as sequences of several bell-shaped acceleration-deceleration phases called submovements or movement un...
NIPS
2001
14 years 29 days ago
2001
NIPS
2001
14 years 29 days ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
NIPS
2001
14 years 29 days ago
2001
NIPS
2001
14 years 29 days ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
NIPS
2001
14 years 29 days ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
NIPS
2001
14 years 29 days ago
2001
Partial information can trigger a complete memory. At the same time, human memory is not perfect. A cue can contain enough information to specify an item in memory, but fail to tr...