ALT
2006
Springer
14 years 8 months ago
2006
Springer
ALT
2006
Springer
14 years 8 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
ALT
2006
Springer
14 years 8 months ago
2006
Springer
We consider the problem of online learning in settings in which we want to compete not simply with the rewards of the best expert or stock, but with the best trade-off between rew...
ALT
2006
Springer
14 years 8 months ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
ALT
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
ALT
2006
Springer
14 years 8 months ago
2006
Springer
ALT
2007
Springer
14 years 8 months ago
2007
Springer
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
ALT
2007
Springer
14 years 8 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
ALT
2007
Springer
14 years 8 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
ALT
2007
Springer
14 years 8 months ago
2007
Springer
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...