![]() |
The 20th International Conference
|
|
|
The following papers have been accepted for ALT 2009.
There is no particular order in the list.
Please keep in mind that we need your final version until
|
|
Please prepare your final version in accordance with the
Instructions for authors.
| Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm | Stéphan Clémençon and Nicolas Vayatis
| |
| Agnostic Clustering |
Maria Florina Balcan, Heiko Röglin, and Shang-Hua Teng
| |
| An Algebraic Perspective on Boolean Function Learning |
Ricard Gavaldà and Denis Thérien
| |
| Approximation Algorithms for Tensor Clustering |
Stefanie Jegelka, Suvrit Sra, and Arindam Banerjee
| |
| Average-Case Active Learning with Costs |
Andrew Guillory and Jeff Bilmes
| |
| Calibration and Internal No-Regret with Random Signals |
Vianney Perchet
| |
| Canonical Horn Representations and Query Learning |
Marta Arias and José Luis Balcázar
| |
| Characterizing Statistical Query Learning: Simplified Notions and Proofs |
Balázs Szörényi
| |
| Complementing Networks Using Observed Data |
Tatsuya Akutsu, Takeyuki Tamura, and Katsuhisa Horimoto
| |
| Complexity versus Agreement for Many Views: Co-Regularization for Multi-View Semi-Supervised Learning |
Odalric-Ambrym Maillard and Nicolas Vayatis
| |
| Computable Bayesian Compression for Uniformly Discretizable Statistical Models |
Łukasz Dębowski
| |
| Difficulties in Forcing Fairness of Polynomial Time Inductive Inference |
John Case and Timo Koetzing
| |
| Error-Correcting Tournaments |
Alina Beygelzimer, John Langford, and Pradeep Ravikumar
| |
| Incremental Learning with Ordinal Bounded Example Memory |
Lorenzo Carlucci
| |
| Iterative Learning from Texts and Counterexamples Using Additional Information |
Sanjay Jain and Efim Kinber
| |
| Learning Finite Automata Using Label Queries |
Dana Angluin, Leonor Becerra-Bonache, Adrian Dediu, and Lev Reyzin
| |
| Learning from Streams |
Sanjay Jain, Frank Stephan, and Nan Ye
| |
| Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data |
Ryo Yoshinaka
| |
| Learning Unknown Graphs |
Nicolò Cesa-Bianchi, Claudio Gentile, and Fabio Vitale
| |
| Prediction with Expert Evaluators' Advice |
Alexey Chernov and Vladimir Vovk
| |
| Pure Exploration in Multi-Armed Bandits Problems |
Sebastien Bubeck, Remi Munos, and Gilles Stoltz
| |
| Reconstructing Weighted Graphs with Minimal Query Complexity |
Nader Bshouty and Hanna Mazzawi
| |
| Smart PAC-Learners |
Hans Simon
| |
| St. Petersburg Portfolio Games |
Laszlo Gyorfi and Peter Kevei
| |
| The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses |
Vladimir Vyugin
| |
| Uncountable Automatic Classes and Learning | Sanjay Jain, Pavel Semukhin, Qinglong Luo, and Frank Stephan |