Learning Theory

Consistency versus Realizable H-Consistency for Multiclass Classification ICML 2013 Convex Calibrated Surrogates for Low-Rank Loss Matrices with Applications to Subset Ranking Losses NeurIPS 2013 Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs ICML 2013 Cost-sensitive Multiclass Classification Risk Bounds ICML 2013 Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NeurIPS 2013 Distribution-Dependent Sample Complexity of Large Margin Learning JMLR 2013 Distribution-Free Distribution Regression AISTATS 2013 Distributions of Angles in Random Packing on Spheres JMLR 2013 Domain Generalization via Invariant Feature Representation ICML 2013 Dynamical Models and tracking regret in online convex programming ICML 2013 Efficient Exploration and Value Function Generalization in Deterministic Systems NeurIPS 2013 Efficient Learning of Simplices COLT 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion NeurIPS 2013 Estimating the Unseen: Improved Estimators for Entropy and other Properties NeurIPS 2013 Estimation, Optimization, and Parallelism when Data is Sparse NeurIPS 2013 Exact Learning of Bounded Tree-width Bayesian Networks AISTATS 2013 Excess risk bounds for multitask learning with trace norm regularization COLT 2013 Exploiting Ontology Structures and Unlabeled Data for Learning ICML 2013 Generalized Method-of-Moments for Rank Aggregation NeurIPS 2013 General Oracle Inequalities for Gibbs Posterior with Application to Ranking COLT 2013 Honest Compressions and Their Application to Compression Schemes COLT 2013 Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NeurIPS 2013 Information-theoretic lower bounds for distributed statistical estimation with communication constraints NeurIPS 2013 Large-Scale Bandit Problems and KWIK Learning ICML 2013