← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking NIPS 2012
Online Sum-Product Computation Over Trees NIPS 2012
Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NIPS 2012
Learning Probability Measures with respect to Optimal Transport Metrics NIPS 2012
Exact and Stable Recovery of Sequences of Signals with Sparse Increments via Differential _1-Minimization NIPS 2012
Algebraic Geometric Comparison of Probability Distributions JMLR 2012
Spectral learning of linear dynamics from generalised-linear observations with application to neural population data NIPS 2012
Fast Approximation of Matrix Coherence and Statistical Leverage JMLR 2012
Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison NIPS 2012
Stability of Density-Based Clustering JMLR 2012
Gradient Weights help Nonparametric Regressors NIPS 2012
Dimensionality Dependent PAC-Bayes Margin Bound NIPS 2012
Generalization Bounds for Domain Adaptation NIPS 2012
Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction with Jeffreys Prior AISTATS 2012
A Geometric Approach to Sample Compression JMLR 2012
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012
Controlling Selection Bias in Causal Inference AISTATS 2012
Multiclass Learning with Simplex Coding NIPS 2012
L1 Covering Numbers for Uniformly Bounded Convex Functions COLT 2012
Multiclass Learning Approaches: A Theoretical Comparison with Implications NIPS 2012
Stochastic Bandit Based on Empirical Moments AISTATS 2012
Open Problem: Does AdaBoost Always Cycle? COLT 2012
Classification Calibration Dimension for General Multiclass Losses NIPS 2012
Kernels Based Tests with Non-asymptotic Bootstrap Approaches for Two-sample Problems COLT 2012
Computational Bounds on Statistical Query Learning COLT 2012