Papers
Online Learning: Stochastic, Constrained, and Smoothed Adversaries
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
Online Submodular Set Cover, Ranking, and Repeated Active Learning
Andrew Guillory, Jeff A. Bilmes
On Strategy Stitching in Large Extensive Form Multiplayer Games
Richard G. Gibson, Duane Szafron
On the accuracy of l1-filtering of signals with block-sparse structure
Fatma K. Karzan, Arkadi S. Nemirovski, Boris T. Polyak et al.
On the Analysis of Multi-Channel Neural Spike Data
Bo Chen, David E. Carlson, Lawrence Carin
On the Universality of Online Mirror Descent
Nati Srebro, Karthik Sridharan, Ambuj Tewari
On Tracking The Partition Function
Guillaume Desjardins, Yoshua Bengio, Aaron C. Courville
On U-processes and clustering performance
Stéphan J. Clémençcon
Optimal learning rates for least squares SVMs using Gaussian kernels
Mona Eberts, Ingo Steinwart
Optimal Reinforcement Learning for Gaussian Systems
Philipp Hennig
Orthogonal Matching Pursuit with Replacement
Prateek Jain, Ambuj Tewari, Inderjit S. Dhillon
PAC-Bayesian Analysis of Contextual Bandits
Yevgeny Seldin, Peter Auer, John S. Shawe-taylor et al.
Penalty Decomposition Methods for Rank Minimization
Yong Zhang, Zhaosong Lu
Periodic Finite State Controllers for Efficient POMDP and DEC-POMDP Planning
Joni K. Pajarinen, Jaakko Peltonen
Phase transition in the family of p-resistances
Morteza Alamgir, Ulrike V. Luxburg
PiCoDes: Learning a Compact Code for Novel-Category Recognition
Alessandro Bergamo, Lorenzo Torresani, Andrew W. Fitzgibbon
Policy Gradient Coagent Networks
Philip S. Thomas
Portmanteau Vocabularies for Multi-Cue Image Representation
Fahad S. Khan, Joost Weijer, Andrew D. Bagdanov et al.
Predicting Dynamic Difficulty
Olana Missura, Thomas Gärtner
Predicting response time and error rates in visual search
Bo Chen, Vidhya Navalpakkam, Pietro Perona
Prediction strategies without loss
Michael Kapralov, Rina Panigrahy
Priors over Recurrent Continuous Time Processes
Ardavan Saeedi, Alexandre Bouchard-côté