COLT
2006
Springer
13 years 8 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
We study functions with multiple output values, and use active sampling to identify an example for each of the possible output values. Our results for this setting include: (1) Eff...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
COLT
2006
Springer
13 years 8 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
U-shaped learning is a learning behaviour in which the learner first learns a given target behaviour, then unlearns it and finally relearns it. Such a behaviour, observed by psych...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
COLT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the infl...