Theory

Complexity of Bethe Approximation AISTATS 2012 Computational Bounds on Statistical Query Learning COLT 2012 Controlling Selection Bias in Causal Inference AISTATS 2012 Convergence Rate Analysis of MAP Coordinate Minimization Algorithms NeurIPS 2012 Dimensionality Dependent PAC-Bayes Margin Bound NeurIPS 2012 Exact and Stable Recovery of Sequences of Signals with Sparse Increments via Differential _1-Minimization NeurIPS 2012 Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction with Jeffreys Prior AISTATS 2012 Fast Approximation of Matrix Coherence and Statistical Leverage JMLR 2012 Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods NeurIPS 2012 Generalization Bounds for Domain Adaptation NeurIPS 2012 Gradient Weights help Nonparametric Regressors NeurIPS 2012 Kernels Based Tests with Non-asymptotic Bootstrap Approaches for Two-sample Problems COLT 2012 L1 Covering Numbers for Uniformly Bounded Convex Functions COLT 2012 Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NeurIPS 2012 Learning High-Density Regions for a Generalized Kolmogorov-Smirnov Test in High-Dimensional Data NeurIPS 2012 Learning Manifolds with K-Means and K-Flats NeurIPS 2012 Learning Probability Measures with respect to Optimal Transport Metrics NeurIPS 2012 Minimax hypothesis testing for curve registration AISTATS 2012 Mixability in Statistical Learning NeurIPS 2012 Mixing Properties of Conditional Markov Chains with Unbounded Feature Functions NeurIPS 2012 Multiclass Learning Approaches: A Theoretical Comparison with Implications NeurIPS 2012 Multiclass Learning with Simplex Coding NeurIPS 2012 Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison NeurIPS 2012 Online Sum-Product Computation Over Trees NeurIPS 2012 On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking NeurIPS 2012