← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14207 directly classified papers

Papers per year

Papers

SGD-QN: Careful Quasi-Newton Stochastic Gradient Descent JMLR 2009
Evolutionary Model Type Selection for Global Surrogate Modeling JMLR 2009
Efficient Bregman Range Search NIPS 2009
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NIPS 2009
Semi-supervised Regression using Hessian energy with an application to semi-supervised dimensionality reduction NIPS 2009
Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NIPS 2009
Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions NIPS 2009
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction NIPS 2009
Approximating MAP by Compensating for Structural Relaxations NIPS 2009
Slow Learners are Fast NIPS 2009
Local Rules for Global MAP: When Do They Work ? NIPS 2009
Robust Value Function Approximation Using Bilinear Programming NIPS 2009
Accelerated Gradient Methods for Stochastic Optimization and Online Learning NIPS 2009
Learning Non-Linear Combinations of Kernels NIPS 2009
DUOL: A Double Updating Approach for Online Learning NIPS 2009
Positive Semidefinite Metric Learning with Boosting NIPS 2009
Potential-Based Agnostic Boosting NIPS 2009
Sensitivity analysis in HMMs with application to likelihood maximization NIPS 2009
Sparse Estimation Using General Likelihoods and Non-Factorial Priors NIPS 2009
Heavy-Tailed Symmetric Stochastic Neighbor Embedding NIPS 2009
Information-theoretic lower bounds on the oracle complexity of convex optimization NIPS 2009
A Parameter-free Hedging Algorithm NIPS 2009
Sparse Metric Learning via Smooth Optimization NIPS 2009
Lattice Regression NIPS 2009
Efficient Recovery of Jointly Sparse Vectors NIPS 2009