20. ALT 2009: Porto, Portugal

Invited Papers

• Sanjoy Dasgupta:
  The Two Faces of Active Learning. 1
  
• Hector Geffner:
  Inference and Learning in Planning. 2
  
• Jiawei Han:
  Mining Heterogeneous Information Networks by Exploring the Power of Links. 3
  
• Yishay Mansour:
  Learning and Domain Adaptation. 4-6
  
• Fernando C. N. Pereira:
  Learning on the Web. 7
  

Online Learning

• Alexey V. Chernov, Vladimir Vovk:
  Prediction with Expert Evaluators' Advice. 8-22
  
• Sébastien Bubeck, Rémi Munos, Gilles Stoltz:
  Pure Exploration in Multi-armed Bandits Problems. 23-37
  
• Vladimir V. V'yugin:
  The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses. 38-52
  
• Lukasz Debowski:
  Computable Bayesian Compression for Uniformly Discretizable Statistical Models. 53-67
  
• Vianney Perchet:
  Calibration and Internal No-Regret with Random Signals. 68-82
  
• László Györfi, Péter Kevei:
  St. Petersburg Portfolio Games. 83-96
  

Learning Graphs

• Nader H. Bshouty, Hanna Mazzawi:
  Reconstructing Weighted Graphs with Minimal Query Complexity. 97-109
  
• Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
  Learning Unknown Graphs. 110-125
  
• Tatsuya Akutsu, Takeyuki Tamura, Katsuhisa Horimoto:
  Completing Networks Using Observed Data. 126-140
  

Active Learning and Query Learning

• Andrew Guillory, Jeff A. Bilmes:
  Average-Case Active Learning with Costs. 141-155
  
• Marta Arias, José L. Balcázar:
  Canonical Horn Representations and Query Learning. 156-170
  
• Dana Angluin, Leonor Becerra-Bonache, Adrian Horia Dediu, Lev Reyzin:
  Learning Finite Automata Using Label Queries. 171-185
  
• Balázs Szörényi:
  Characterizing Statistical Query Learning: Simplified Notions and Proofs. 186-200
  
• Ricard Gavaldà, Denis Thérien:
  An Algebraic Perspective on Boolean Function Learning. 201-215
  

Statistical Learning

• Stéphan Clémençon, Nicolas Vayatis:
  Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm. 216-231
  
• Odalric-Ambrym Maillard, Nicolas Vayatis:
  Complexity versus Agreement for Many Views. 232-246
  
• Alina Beygelzimer, John Langford, Pradeep Ravikumar:
  Error-Correcting Tournaments. 247-262
  

Inductive Inference

• John Case, Timo Kötzing:
  Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. 263-277
  
• Ryo Yoshinaka:
  Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data. 278-292
  
• Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan:
  Uncountable Automatic Classes and Learning. 293-307
  
• Sanjay Jain, Efim B. Kinber:
  Iterative Learning from Texts and Counterexamples Using Additional Information. 308-322
  
• Lorenzo Carlucci:
  Incremental Learning with Ordinal Bounded Example Memory. 323-337
  
• Sanjay Jain, Frank Stephan, Nan Ye:
  Learning from Streams. 338-352
  

Semi-supervised and Unsupervised Learning

• Hans-Ulrich Simon:
  Smart PAC-Learners. 353-367
  
• Stefanie Jegelka, Suvrit Sra, Arindam Banerjee:
  Approximation Algorithms for Tensor Clustering. 368-383
  
• Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng:
  Agnostic Clustering. 384-398