| 2014 | Approachability in unknown games: Online learning meets multi-objective optimization. | Shie Mannor, Vianney Perchet, Gilles Stoltz |
| 2014 | Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms. | Stefan Magureanu, Richard Combes, Alexandre Proutire |
| 2014 | Most Correlated Arms Identification. | Che-Yu Liu, Sbastien Bubeck |
| 2014 | Uniqueness of Ordinal Embedding. | Matthus Kleindessner, Ulrike von Luxburg |
| 2014 | Open Problem: A (missing) boosting-type convergence result for AdaBoost.MH with factorized multi-class classifiers. | Balzs Kgl |
| 2014 | On the Complexity of A/B Testing. | Emilie Kaufmann, Olivier Capp, Aurlien Garivier |
| 2014 | Principal Component Analysis and Higher Correlations for Distributed Data. | Ravi Kannan, Santosh S. Vempala, David P. Woodruff |
| 2014 | Distribution-independent Reliable Learning. | Varun Kanade, Justin Thaler |
| 2014 | Open Problem: Efficient Online Sparse Regression. | Satyen Kale |
| 2014 | Multiarmed Bandits With Limited Expert Advice. | Satyen Kale |
| 2014 | lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits. | Kevin Jamieson, Matthew Malloy, Robert D. Nowak, Sbastien Bubeck |
| 2014 | Volumetric Spanners: an Efficient Exploration Basis for Learning. | Elad Hazan, Zohar Shay Karnin, Raghu Meka |
| 2014 | Logistic Regression: Tight Bounds for Stochastic and Online Optimization. | Elad Hazan, Tomer Koren, Kfir Y. Levy |
| 2014 | Near-Optimal Herding. | Nick Harvey, Samira Samadi |
| 2014 | Fast matrix completion without the condition number. | Moritz Hardt, Mary Wootters |
| 2014 | Computational Limits for Matrix Completion. | Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz |
| 2014 | Stochastic Regret Minimization via Thompson Sampling. | Sudipto Guha, Kamesh Munagala |
| 2014 | Open Problem: Finding Good Cascade Sampling Processes for the Network Inference Problem. | Manuel Gomez-Rodriguez, Le Song, Bernhard Schlkopf |
| 2014 | Higher-Order Regret Bounds with Switching Costs. | Eyal Gofer |
| 2014 | A second-order bound with excess losses. | Pierre Gaillard, Gilles Stoltz, Tim van Erven |
| 2014 | Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. | Vitaly Feldman, David Xiao |
| 2014 | Learning Coverage Functions and Private Release of Marginals. | Vitaly Feldman, Pravesh Kothari |
| 2014 | Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces. | Vitaly Feldman |
| 2014 | Follow the Leader with Dropout Perturbations. | Tim van Erven, Wojciech Kotlowski |
| 2014 | Online Learning with Composite Loss Functions. | Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres |