Optimization
17,731 papers
Papers per year
10
10
17
7
18
64
72
82
92
117
146
178
377
337
350
415
546
768
1,185
1,385
1,651
1,697
2,026
2,683
2,825
673
'5
'10
'15
'20
'25
Papers
Manifold Precis: An Annealing Technique for Diverse Sampling of Manifolds
NeurIPS 2011
Matrix Completion for Multi-label Image Classification
NeurIPS 2011
Maximum Margin Multi-Label Structured Prediction
NeurIPS 2011
Maximum Volume Clustering
AISTATS 2011
Metric Learning with Multiple Kernels
NeurIPS 2011
Minimax Algorithm for Learning Rotations
COLT 2011
Multiclass Boosting: Theory and Algorithms
NeurIPS 2011
Multicore Gibbs Sampling in Dense, Unstructured Graphs
AISTATS 2011
Multi-Level Partitioning and Distribution of the Assignment Problem for Large-Scale Multi-Robot Task Allocation
RSS 2011
Multiple Instance Learning on Structured Data
NeurIPS 2011
Nearest Neighbor based Greedy Coordinate Descent
NeurIPS 2011
Neural Reconstruction with Approximate Message Passing (NeuRAMP)
NeurIPS 2011
Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction
NeurIPS 2011
Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning
NeurIPS 2011
Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels
NeurIPS 2011
-Norm Multiple Kernel Learning
JMLR 2011
On fast approximate submodular minimization
NeurIPS 2011
On the accuracy of l1-filtering of signals with block-sparse structure
NeurIPS 2011
On the Universality of Online Mirror Descent
NeurIPS 2011
Optimal and Robust Price Experimentation: Learning by Lottery
AISTATS 2011
Optimal Distributed Market-Based Planning for Multi-Agent Systems with Shared Resources
AISTATS 2011
Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness
NeurIPS 2011
Oracle inequalities for computationally budgeted model selection
COLT 2011
Orthogonal Matching Pursuit with Replacement
NeurIPS 2011
Parameter Screening and Optimisation for ILP using Designed Experiments
JMLR 2011