Algorithmic Learning Theory
for ALT 2009 in
Theoretical Computer Science
Algorithmic Learning Theoryfor ALT 2009 in Theoretical Computer Science |
|
|
appeared as:
The Special Issue on Algorithmic Learning Theory (ALT 2009) has been edited by Gábor Lugosi and Sandra Zilles. |
|
Gábor Lugosi and
Sandra Zilles.
Preface, | pp. 1755 |
|
|
|
|
Malte Darnstädt
and
Hans Ulrich Simon.
Smart PAC-learners, Abstract. | pp. 1756-1766 |
|
|
|
|
Sanjoy Dasgupta.
Two faces of active learning, Abstract. | pp. 1767-1781 |
|
|
|
|
Nader H. Bshouty
and
Hanna Mazzawi.
Reconstructing weighted graphs with minimal query complexity, Abstract. | pp. 1782-1790 |
|
|
|
|
Nicolò Cesa-Bianchi,
Claudio Gentile,
and
Fabio Vitale.
Predicting the labels of an unknown graph via adaptive exploration, Abstract. | pp. 1791-1804 |
|
|
|
|
Sanjay Jain,
Qinglong Luo,
Pavel Semukhin,
and
Frank Stephan,
Uncountable automatic classes and learning , Abstract. | pp. 1805-1820 |
|
|
|
|
Ryo Yoshinaka.
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data, Abstract. | pp. 1821-1831 |
|
|
|
|
Sébastien Bubeck,
Rémi Munos,
and
Gilles Stoltz.
Pure exploration in finitely-armed and continuous-armed bandits, Abstract. | pp. 1832-1852 |
|
|
|
|
|
