Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

ESANN
2007

favoriteEmaildiscussreport

114views Neural Networks» more ESANN 2007»

Deploying SDP for machine learning

14 years 10 days ago

Deploying SDP for machine learning

Download www.tijldebie.net

We discuss the use in machine learning of a general type of convex optimisation problem known as semi-deﬁnite programming (SDP) [1]. We intend to argue that SDP’s arise quite naturally in a variety of situations, accounting for their omnipresence in modern machine learning approaches, and we provide examples in support.

Tijl De Bie

Real-time Traffic

Convex Optimisation Problem | ESANN 2007 | Machine Learning | Machine Learning Approaches | Neural Networks |

claim paper

Related Content

» Fast maximum margin matrix factorization for collaborative prediction

» Fast SDP Relaxations of Graph Cut Clustering Transduction and Other Combinatorial Problem

» Maxmargin MultipleInstance Learning via Semidefinite Programming

» Discriminant kernel and regularization parameter learning via semidefinite programming

» SimpleNPKL simple nonparametric kernel learning

» Maximum margin clustering made practical

» A Simple Algorithm for Nuclear Norm Regularized Problems

» A Technology Enhanced Learning Case from Birth to Deployment Critical Analysis of the ALaR...

» Learning nonparametric kernel matrices from pairwise constraints

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	ESANN
Authors	Tijl De Bie

Comments (0)