Learning Theory

Robust Interactive Learning COLT 2012 Sample Complexity of Composite Likelihood AISTATS 2012 Selective Labeling via Error Bound Minimization NeurIPS 2012 Spectral Learning of General Weighted Automata via Constrained Matrix Completion NeurIPS 2012 Statistical Consistency of Ranking Methods in A Rank-Differentiable Probability Space NeurIPS 2012 Structured Sparsity and Generalization JMLR 2012 The adversarial stochastic shortest path problem with unknown transition probabilities AISTATS 2012 Tight Bounds on Profile Redundancy and Distinguishability NeurIPS 2012 Tight Bounds on Proper Equivalence Query Learning of DNF COLT 2012 Towards a learning-theoretic analysis of spike-timing dependent plasticity NeurIPS 2012 Using More Data to Speed-up Training Time AISTATS 2012 Volume Regularization for Binary Classification NeurIPS 2012 A Close Look to Margin Complexity and Related Parameters COLT 2011 A Collaborative Mechanism for Crowdsourcing Prediction Problems NeurIPS 2011 Action-Gap Phenomenon in Reinforcement Learning NeurIPS 2011 Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity NeurIPS 2011 Active Learning with a Drifting Distribution NeurIPS 2011 Active Ranking using Pairwise Comparisons NeurIPS 2011 Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011 Adaptive Hedge NeurIPS 2011 A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011 Agnostic KWIK learning and efficient approximate reinforcement learning COLT 2011 Agnostic Selective Classification NeurIPS 2011 Algorithms and hardness results for parallel large margin learning NeurIPS 2011 A More Powerful Two-Sample Test in High Dimensions using Random Projection NeurIPS 2011