Theory

A Stability-based Validation Procedure for Differentially Private Machine Learning NeurIPS 2013 Boundary Detection Benchmarking: Beyond F-Measures CVPR 2013 Capacity of strong attractor patterns to model behavioural and cognitive prototypes NeurIPS 2013 Characterizing the Representer Theorem ICML 2013 Clustering Oligarchies AISTATS 2013 Cluster Trees on Manifolds NeurIPS 2013 Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013 Complexity Theoretic Lower Bounds for Sparse Principal Component Detection COLT 2013 Consistency versus Realizable H-Consistency for Multiclass Classification ICML 2013 Context-Aware Modeling and Recognition of Activities in Video CVPR 2013 Correlations strike back (again): the case of associative memory retrieval NeurIPS 2013 Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NeurIPS 2013 Distributions of Angles in Random Packing on Spheres JMLR 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 Estimation, Optimization, and Parallelism when Data is Sparse NeurIPS 2013 Exploiting Urban Scenes for Vision-aided Inertial Navigation RSS 2013 First-order Decomposition Trees NeurIPS 2013 From Bandits to Experts: A Tale of Domination and Independence NeurIPS 2013 Generalized Method-of-Moments for Rank Aggregation NeurIPS 2013 Generalizing Analytic Shrinkage for Arbitrary Covariance Structures NeurIPS 2013 Honest Compressions and Their Application to Compression Schemes COLT 2013 Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NeurIPS 2013 Inverse Density as an Inverse Problem: the Fredholm Equation Approach NeurIPS 2013 Joint Harmonic Functions and Their Supervised Connections JMLR 2013 Learning Hidden Markov Models from Non-sequence Data via Tensor Decomposition NeurIPS 2013