conftrace_

computational complexity

399 papers

Explore in graph

Co-occurring keywords

approximation algorithm (630) complexity analysis (93) combinatorial optimization (1039) game theory (854) sample complexity (1169) argumentation framework (50) approval voting (66) neural network (6616) learning theory (519) abstract argumentation (49)

Papers

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