convex optimization

1320 papers

Explore in graph

Also known as

ACO ADMM CO OCO

Co-occurring keywords

stochastic optimization (1060) convergence rate (606) stochastic gradient descent (1088) gradient descent (1143) online learning (1770) support vector machine (976) matrix completion (356) regret bound (1918) kernel methods (1096) sparse optimization (246)

Papers

Hierarchical Penalization NIPS 2007

A PAC-Bayes Risk Bound for General Loss Functions NIPS 2006

Max-margin classification of incomplete data NIPS 2006

Efficient Structure Learning of Markov Networks using $L_1$-Regularization NIPS 2006

Large Scale Multiple Kernel Learning JMLR 2006

Convex Repeated Games and Fenchel Duality NIPS 2006

Graph Laplacian Regularization for Large-Scale Semidefinite Programming NIPS 2006

Active learning for misspecified generalized linear models NIPS 2006

Linearly-solvable Markov decision problems NIPS 2006

No-regret Algorithms for Online Convex Programs NIPS 2006

Large Margin Hidden Markov Models for Automatic Speech Recognition NIPS 2006

Efficient sparse coding algorithms NIPS 2006

Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization JMLR 2006

An Efficient Implementation of an Active Set Method for SVMs JMLR 2006

A Direct Method for Building Sparse Kernel Learning Algorithms JMLR 2006

Structured Prediction, Dual Extragradient and Bregman Projections JMLR 2006

Learning the Kernel Function via Regularization JMLR 2005

A Robust Minimax Approach to Classification JMLR 2002

Lagrangian Support Vector Machines JMLR 2001

Efficient SVM Training Using Low-Rank Kernel Representations JMLR 2001