Special Issue on

Algorithmic Learning Theory

for ALT 2005 in

Theoretical Computer Science

ALT 05 Logo

appeared as:

Theoretical Computer Science, Volume 387, Issue 1, Nov. 6, 2007.

The Special Issue on Algorithmic Learning Theory (ALT 2005) has been edited by Hans Ulrich Simon and Etsuji Tomita.

Table of Contents

Hans Ulrich Simon and Etsuji Tomita
Guest editors' foreword,

pp. 1-3

Kazuho Watanabe and Sumio Watanabe.
Stochastic complexity for mixture of exponential families in generalized variational Bayes,

pp. 4-17

Nick Palmer and Paul W. Goldberg.
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance,
pp. 18-31

Rotem Bennet and Nader H. Bshouty.
Learning attribute-efficiently with corrupt oracles,
pp. 32-50

Sanjay Jain, Steffen Lange, and Sandra Zilles.
A general comparison of language learning from examples and from queries,
pp. 51-66

Sanjay Jain and Efim Kinber.
Learning multiple languages in groups,
pp. 67-76

Vladimir Vovk.
Non-asymptotic calibration and resolution,
pp. 77-89

uparrowback to the ALT Archives page

Valid HTML 4.1!