Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Monday, April 23, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Hemant Tyagi (EPFL)

Learning multi ridge functions in high dimensions via low rank matrix recovery

We consider the problem of learning multi ridge functions of the form f(x) = g(Ax) from point evaluations of f. We assume that the function f is defined on an l2-ball in Rd, g is twice continuously differentiable, and A is a k x d, rank k matrix, k « d. We leverage recent techniques from low rank matrix recovery and propose a randomized, polynomial-complexity sampling scheme for uniform approximation of such functions. As a consequence we remove the commonly made compressibility assumption on the rows of A in the existing literature. Furthermore we establish the tractability of our scheme when f is a sum of k ridge functions provided f satisfies additional smoothness properties in a neighborhood of the origin.

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