Papers
Logistic Regression: Tight Bounds for Stochastic and Online Optimization
Elad Hazan, Tomer Koren, Kfir Y. Levy
A second-order bound with excess losses
Pierre Gaillard, Gilles Stoltz, Tim van Erven
Community Detection via Random and Adaptive Sampling
Se-Young Yun, Alexandre Proutiere
Learning Sparsely Used Overcomplete Dictionaries
Alekh Agarwal, Animashree Anandkumar, Prateek Jain et al.
Multiarmed Bandits With Limited Expert Advice
Satyen Kale
Bayes-Optimal Scorers for Bipartite Ranking
Aditya Krishna Menon, Robert C. Williamson
Uniqueness of Ordinal Embedding
Matthäus Kleindessner, Ulrike Luxburg
Learning without concentration
Shahar Mendelson
Distribution-independent Reliable Learning
Varun Kanade, Justin Thaler
Open Problem: Efficient Online Sparse Regression
Satyen Kale
Open Problem: Shifting Experts on Easy Data
Manfred K. Warmuth, Wouter M. Koolen
Open Problem: Online Local Learning
Paul Christiano
Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold?
Aditya Bhaskara, Moses Charikar, Ankur Moitra et al.
Open Problem: Finding Good Cascade Sampling Processes for the Network Inference Problem
Manuel Gomez-Rodriguez, Le Song, Bernhard Schoelkopf
Open Problem: Tightness of maximum likelihood semidefinite relaxations
Afonso S. Bandeira, Yuehaw Khoo, Amit Singer
Dependency Parsing: Past, Present, and Future
Wenliang Chen, Zhenghua Li, Min Zhang
Selection Bias, Label Bias, and Bias in Ground Truth
Anders Søgaard, Barbara Plank, Dirk Hovy
Automated Grammatical Error Correction for Language Learners
Joel Tetreault, Claudia Leacock
Multilingual Word Sense Disambiguation and Entity Linking
Roberto Navigli, Andrea Moro
Biomedical/Clinical NLP
Ozlem Uzuner, Meliha Yetişgen, Amber Stubbs