Paper list for presentations -- send us your choice by Monday Dec. 20th!

Here is our suggestion of papers for presentation. Chose your own if you prefer, we will look at it and accept it if it is up to standards.

1. Orthogonal Decision Trees
2. On Learning Thresholds of Parities and Unions of Rectangles in Random Walk Models
3. Exact Learning Composed Classes with a Small Number of Mistakes
4. Exact Learning Boolean Functions via the Monotone Theory
5. Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
6. Large Margin Classification Using the Perceptron Algorithm
7. Analysis of Perceptron-Based Active Learning
8. Efficient distribution-free learning of probabilistic concepts
9. Vox Populi: Collecting High-Quality Labels from a Crowd
10. Active Learning on Trees and Graphs
11. Ranking with kernels in Fourier space
12. Regret Minimization With Concept Drift
13. Agnostic Online Learning
14. Smart PAC-Learners
15. Robust Reductions from Ranking to Classification
16. Simple learning algorithms using divide and conquer
17. Teaching Dimension and the Complexity of Active Learning
18. The true sample complexity of active learning
19. Evolvability from learning algorithms
20. Inferring Social Networks from Outbreaks