Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, March 03, 2011, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Martin Jaggi
We consider parameterized convex optimization problems over the unit simplex, that depend on one additional parameter. We provide a simple scheme for maintaining an ε-approximate solution along the entire parameter path, using as few updates ("warm-start") as possible. Surprisingly the necessary number of updates is O(1/ε), independent of the dimension of the problem.
This idea can also be extended to optimization problems over matrices. We will in particular consider machine learning applications, where it is often difficult to select a good parameter. One consequence is that we can efficiently compute the solution path for matrix factorization problems.
Joint work with Joachim Giesen and Soeren Laue.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login