← Core Methods
Machine Learning › Core Methods ›

Optimization

1184 directly classified papers

Papers per year

Papers

Breaking Boundaries Between Induction Time and Diagnosis Time Active Information Acquisition NIPS 2009
A Gaussian Tree Approximation for Integer Least-Squares NIPS 2009
DUOL: A Double Updating Approach for Online Learning NIPS 2009
Efficient Learning using Forward-Backward Splitting NIPS 2009
Asymptotic Analysis of MAP Estimation via the Replica Method and Compressed Sensing NIPS 2009
Adaptive Regularization of Weight Vectors NIPS 2009
Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models NIPS 2008
Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management JMLR 2008
One sketch for all: Theory and Application of Conditional Random Sampling NIPS 2008
Tighter Bounds for Structured Estimation NIPS 2008
A Massively Parallel Digital Learning Processor NIPS 2008
Robust Regression and Lasso NIPS 2008
Bounding Performance Loss in Approximate MDP Homomorphisms NIPS 2008
PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NIPS 2008
Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method NIPS 2008
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models NIPS 2008
Clustering via LP-based Stabilities NIPS 2008
Sparse Signal Recovery Using Markov Random Fields NIPS 2008
Multi-stage Convex Relaxation for Learning with Sparse Regularization NIPS 2008
Spectral Clustering with Perturbed Data NIPS 2008
Estimating vector fields using sparse basis field expansions NIPS 2008
On the Efficient Minimization of Classification Calibrated Surrogates NIPS 2008
MDPs with Non-Deterministic Policies NIPS 2008
Estimating Robust Query Models with Convex Optimization NIPS 2008
On the Design of Loss Functions for Classification: theory, robustness to outliers, and SavageBoost NIPS 2008