← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

Regret based Robust Solutions for Uncertain Markov Decision Processes NIPS 2013
Rectangling Stereographic Projection for Wide-Angle Image Visualization ICCV 2013
Boundary Detection Benchmarking: Beyond F-Measures CVPR 2013
A Stability-based Validation Procedure for Differentially Private Machine Learning NIPS 2013
On model selection consistency of penalized M-estimators: a geometric theory NIPS 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Approximate inference in latent Gaussian-Markov models from continuous time observations NIPS 2013
A simple example of Dirichlet process mixture inconsistency for the number of components NIPS 2013
When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity NIPS 2013
Clustering Oligarchies AISTATS 2013
Consistency versus Realizable H-Consistency for Multiclass Classification ICML 2013
Learning to Detect Partially Overlapping Instances CVPR 2013
Measures and Meta-Measures for the Supervised Evaluation of Image Segmentation CVPR 2013
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima NIPS 2013
Inverse Density as an Inverse Problem: the Fredholm Equation Approach NIPS 2013
A memory frontier for complex synapses NIPS 2013
Generalizing Analytic Shrinkage for Arbitrary Covariance Structures NIPS 2013
The Fast Convergence of Incremental PCA NIPS 2013
Understanding variable importances in forests of randomized trees NIPS 2013
First-order Decomposition Trees NIPS 2013
Multiple-source cross-validation ICML 2013
Distributions of Angles in Random Packing on Spheres JMLR 2013
Capacity of strong attractor patterns to model behavioural and cognitive prototypes NIPS 2013
On a Link Between Kernel Mean Maps and Fraunhofer Diffraction, with an Application to Super-Resolution Beyond the Diffraction Limit CVPR 2013
Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013