Campus Event Calendar
Event Entry
What and Who
Convex Optimization for Machine Learning Made Fast and Easy
Soeren Laue
Universität Jena
AG1 Mittagsseminar (others' work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 25 June 2013
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Many machine learning problems can be cast as a convex
optimization problem. Among them are least squares regression, SVMs,
kernel learning, metric embeddings, etc. In the talk I will provide
a small general overview and I will present a project on how to
obtain fast solvers for convex optimization problems from
simple mathematical descriptions. The automatically generated code
can be orders of magnitude faster than comparable approaches.
optimization problem. Among them are least squares regression, SVMs,
kernel learning, metric embeddings, etc. In the talk I will provide
a small general overview and I will present a project on how to
obtain fast solvers for convex optimization problems from
simple mathematical descriptions. The automatically generated code
can be orders of magnitude faster than comparable approaches.
Contact
Andreas Karrenbauer
--email hidden
passcode not visible
logged in users only
Christina Fries, 06/04/2013 09:31 -- Created document.