The Special Issue on

Algorithmic Learning Theory

for ALT 2008 in

Theoretical Computer Science

ALT 08 Logo

appeared as:

Theoretical Computer Science, Volume 411, Issues 29-30, June 17, 2010.

The Special Issue on Algorithmic Learning Theory (ALT 2008) has been edited by László Győrfi, Győrgy Turán, and Thomas Zeugmann.

Table of Contents

László Győrfi, Győrgy Turán, and Thomas Zeugmann.
Guest editors' foreword,

pp. 2629-2631

Vladimir Vovk and Alexander Shen.
Prequential randomness and probability,

pp. 2632-2646

Alexey Chernov, Yuri Kalnishkan, Fedor Zhdanov, and Vladimir Vovk.
Supermartingales in prediction with expert advice,
pp. 2647-2669

Indraneel Mukherjee and Robert E. Schapire
Learning with continuous experts using drifting games,
pp. 2670-2683

Ronald Ortner.
Online regret bounds for Markov decision processes with deterministic transitions,
pp. 2684-2695

Ohad Shamir, Sivan Sabato, and Naftali Tishby,
Learning and generalization with the information bottleneck,
pp. 2696-2711

András Antos, Varun Grover, and Csaba Szepesvári.
Active learning in heteroscedastic noise,
pp. 2712-2728

Dana Angluin, James Aspnes, and Lev Reyzin.
Optimally learning social networks with activations and suppressions,
pp. 2729-2740

Leonor Becerra-Bonache, John Case, Sanjay Jain, and Frank Stephan.
Iterative learning of simple external contextual languages,
pp. 2741-2756

Sanjay Jain, Steffen Lange, Samuel E. Moelius III, and Sandra Zilles.
Incremental learning with temporary memory,
pp. 2757-2772

uparrowback to the ALT Archives page

Valid HTML 4.1!