Theory

Fast, smooth and adaptive regression in metric spaces NeurIPS 2009 Generalization Bounds for Ranking Algorithms via Algorithmic Stability JMLR 2009 Information-theoretic lower bounds on the oracle complexity of convex optimization NeurIPS 2009 Margin-based Ranking and an Equivalence between AdaBoost and RankBoost JMLR 2009 Measuring model complexity with the prior predictive NeurIPS 2009 Monte Carlo Sampling for Regret Minimization in Extensive Games NeurIPS 2009 Nash Equilibria of Static Prediction Games NeurIPS 2009 On the Convergence of the Concave-Convex Procedure NeurIPS 2009 On The Power of Membership Queries in Agnostic Learning JMLR 2009 Reconstruction of Sparse Circuits Using Multi-neuronal Excitation (RESCUME) NeurIPS 2009 Robustness and Regularization of Support Vector Machines JMLR 2009 Robust Nonparametric Regression with Metric-Space Valued Output NeurIPS 2009 Sparsistent Learning of Varying-coefficient Models with Structural Changes NeurIPS 2009 Statistical Analysis of Semi-Supervised Learning: The Limit of Infinite Unlabelled Data NeurIPS 2009 Strong Limit Theorems for the Bayesian Scoring Criterion in Bayesian Networks JMLR 2009 Universal Kernel-Based Learning with Applications to Regular Languages JMLR 2009 Which graphical models are difficult to learn? NeurIPS 2009 A Bahadur Representation of the Linear Support Vector Machine JMLR 2008 A general framework for investigating how far the decoding process in the brain can be simplified NeurIPS 2008 Approximation Schemes for Two-Player Pursuit Evasion Games with Visibility Constraints RSS 2008 Bounding Performance Loss in Approximate MDP Homomorphisms NeurIPS 2008 Clusters and Coarse Partitions in LP Relaxations NeurIPS 2008 Complete Identification Methods for the Causal Hierarchy JMLR 2008 Consistency of Trace Norm Minimization JMLR 2008 Convergence and Rate of Convergence of a Manifold-Based Dimension Reduction Algorithm NeurIPS 2008