IWCLS
1999
Springer
13 years 11 months ago
1999
Springer
IWCLS
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we describe a simple model of adaptive agents of different types, represented by Learning Classifier Systems (LCS), which make investment decisions about a risk fre...
IWCLS
1999
Springer
13 years 11 months ago
1999
Springer
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...