← Core Methods
Machine Learning › Core Methods ›

Optimization

1184 directly classified papers

Papers per year

Papers

Sparse Recovery with Brownian Sensing NIPS 2011
Semi-Supervised Learning with Measure Propagation JMLR 2011
Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NIPS 2011
Nearest Neighbor based Greedy Coordinate Descent NIPS 2011
Sparse Estimation with Structured Dictionaries NIPS 2011
Pylon Model for Semantic Segmentation NIPS 2011
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization NIPS 2010
Exploiting Feature Covariance in High-Dimensional Online Learning AISTATS 2010
Multi-Priority Cartesian Impedance Control RSS 2010
Random Conic Pursuit for Semidefinite Programming NIPS 2010
Fast Active-set-type Algorithms for $l1$-regularized Linear Regression AISTATS 2010
Structured sparsity-inducing norms through submodular functions NIPS 2010
Learning via Gaussian Herding NIPS 2010
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA NIPS 2010
Active Instance Sampling via Matrix Partition NIPS 2010
Shadow Dirichlet for Restricted Probability Modeling NIPS 2010
Descent Methods for Tuning Parameter Refinement AISTATS 2010
Boosted Optimization for Network Classification AISTATS 2010
On Herding and the Perceptron Cycling Theorem NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Tempered Markov Chain Monte Carlo for training of Restricted Boltzmann Machines AISTATS 2010
On the Convergence of the Concave-Convex Procedure NIPS 2009
An LP View of the M-best MAP problem NIPS 2009
Efficient Bregman Range Search NIPS 2009
Learning a Small Mixture of Trees NIPS 2009