Deploying SDP for machine learning

We discuss the use in machine learning of a general type of convex optimisation problem known as semi-definite 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.

• Type: Conference
• Year: 2007
• Where: ESANN
• Authors: Tijl De Bie
• Keywords: Convex Optimisation Problem, ESANN 2007, Machine Learning, Machine Learning Approaches, Neural Networks