← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

Approachability, fast and slow COLT 2013
Eluder Dimension and the Sample Complexity of Optimistic Exploration NIPS 2013
Robust Low Rank Kernel Embeddings of Multivariate Distributions NIPS 2013
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NIPS 2013
On the Complexity and Approximation of Binary Evidence in Lifted Inference NIPS 2013
On the Representational Efficiency of Restricted Boltzmann Machines NIPS 2013
Honest Compressions and Their Application to Compression Schemes COLT 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification ACML 2013
Top-Down Segmentation of Non-rigid Visual Objects Using Derivative-Based Search on Sparse Manifolds CVPR 2013
Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights COLT 2013
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection COLT 2013
Context-Aware Modeling and Recognition of Activities in Video CVPR 2013
Noise-Enhanced Associative Memories NIPS 2013
On the Relationship Between Binary Classification, Bipartite Ranking, and Binary Class Probability Estimation NIPS 2013
Matrix Completion From any Given Set of Observations NIPS 2013
Predictive PAC Learning and Process Decompositions NIPS 2013
Characterizing the Representer Theorem ICML 2013
Marginals-to-Models Reducibility NIPS 2013
Linear decision rule as aspiration for simple decision heuristics NIPS 2013
Permutation estimation and minimax rates of identifiability AISTATS 2013
A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound NIPS 2012
Complexity of Bethe Approximation AISTATS 2012
The representer theorem for Hilbert spaces: a necessary and sufficient condition NIPS 2012
Toward Understanding Complex Spaces: Graph Laplacians on Manifolds with Singularities and Boundaries COLT 2012