computational complexity

Subsampling Methods for Persistent Homology ICML 2015 100+ Times Faster Weighted Median Filter (WMF) CVPR 2014 Computational Limits for Matrix Completion COLT 2014 Computing Nash Equilibria in Generalized Interdependent Security Games NeurIPS 2014 Hardness of parameter estimation in graphical models NeurIPS 2014 Learning to Discover Efficient Mathematical Identities NeurIPS 2014 On the Computational Efficiency of Training Neural Networks NeurIPS 2014 The Complexity of Learning Halfspaces using Generalized Linear Methods COLT 2014 Top Rank Optimization in Linear Time NeurIPS 2014 Complexity Theoretic Lower Bounds for Sparse Principal Component Detection COLT 2013 Learning Separable Filters CVPR 2013 More data speeds up training time in learning halfspaces over sparse vectors NeurIPS 2013 Computational Bounds on Statistical Query Learning COLT 2012 Fast Resampling Weighted v-Statistics NeurIPS 2012 Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NeurIPS 2012 Using More Data to Speed-up Training Time AISTATS 2012 (weak) Calibration is Computationally Hard COLT 2012 Complexity of Inference in Latent Dirichlet Allocation NeurIPS 2011 A Computational Decision Theory for Interactive Assistants NeurIPS 2010 Complexity of Decentralized Control: Special Cases NeurIPS 2009 On The Power of Membership Queries in Agnostic Learning JMLR 2009 Competition Adds Complexity NeurIPS 2007 The Tradeoffs of Large Scale Learning NeurIPS 2007 Exploiting Locality in SLAM by Nested Dissection RSS 2006 Fast Computation of Graph Kernels NeurIPS 2006