conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4,955 papers

Papers per year

1
4
37
72
447
426
'00
'05
'10
'15
'20
'25

Papers

Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
The Fast Convergence of Incremental PCA NIPS 2013
Learning Hidden Markov Models from Non-sequence Data via Tensor Decomposition NIPS 2013
On Flat versus Hierarchical Classification in Large-Scale Taxonomies NIPS 2013
Scoring Workers in Crowdsourcing: How Many Control Questions are Enough? NIPS 2013
Cluster Trees on Manifolds NIPS 2013
Generalized Method-of-Moments for Rank Aggregation NIPS 2013
Regret based Robust Solutions for Uncertain Markov Decision Processes NIPS 2013
Understanding variable importances in forests of randomized trees NIPS 2013
Linear decision rule as aspiration for simple decision heuristics NIPS 2013
A Stability-based Validation Procedure for Differentially Private Machine Learning NIPS 2013
Unsupervised Spectral Learning of Finite State Transducers NIPS 2013
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima NIPS 2013
First-order Decomposition Trees NIPS 2013
Noise-Enhanced Associative Memories NIPS 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
Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification ACML 2013
Permutation estimation and minimax rates of identifiability AISTATS 2013
Clustering Oligarchies AISTATS 2013
Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Honest Compressions and Their Application to Compression Schemes COLT 2013
Approachability, fast and slow COLT 2013
Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights COLT 2013