Theory

Learning Multiple Models via Regularized Weighting NeurIPS 2013 Learning to Detect Partially Overlapping Instances CVPR 2013 Linear decision rule as aspiration for simple decision heuristics NeurIPS 2013 Marginals-to-Models Reducibility NeurIPS 2013 Matrix Completion From any Given Set of Observations NeurIPS 2013 Measures and Meta-Measures for the Supervised Evaluation of Image Segmentation CVPR 2013 Memory Limited, Streaming PCA NeurIPS 2013 Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation NeurIPS 2013 Moment-based Uniform Deviation Bounds for k-means and Friends NeurIPS 2013 More data speeds up training time in learning halfspaces over sparse vectors NeurIPS 2013 Multiple-source cross-validation ICML 2013 Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic NeurIPS 2013 Noise-Enhanced Associative Memories NeurIPS 2013 Nonlinearly Constrained MRFs: Exploring the Intrinsic Dimensions of Higher-Order Cliques CVPR 2013 On a Link Between Kernel Mean Maps and Fraunhofer Diffraction, with an Application to Super-Resolution Beyond the Diffraction Limit CVPR 2013 On Decomposing the Proximal Map NeurIPS 2013 On Flat versus Hierarchical Classification in Large-Scale Taxonomies NeurIPS 2013 On model selection consistency of penalized M-estimators: a geometric theory NeurIPS 2013 On the Complexity and Approximation of Binary Evidence in Lifted Inference NeurIPS 2013 On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013 On the Relationship Between Binary Classification, Bipartite Ranking, and Binary Class Probability Estimation NeurIPS 2013 On the Representational Efficiency of Restricted Boltzmann Machines NeurIPS 2013 Permutation estimation and minimax rates of identifiability AISTATS 2013 Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification ACML 2013 Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights COLT 2013