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, November 05, 2015, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Hemant Tyagi

A function $f: R^d -> R$ is referred to as a Sparse Additive Model (SPAM), if it is of the form $f(x) = \sum_{l \in S_1} \phi_{l}(x_l)$, where $S_1 \subset [d]$ with $|S_1| \ll d$. Assuming $\phi_l$'s and $S_1$ to be unknown, the problem of estimating f from its samples has been studied extensively. We consider a generalized SPAM, also allowing for a sparse number of unknown, pairwise interaction terms, represented by the set S_2. In this talk, we will look at a randomized algorithm that queries f at suitably chosen points and identifies S_1, S_2, along with non-asymptotic sampling bounds. Joint work with Bernd Gärtner, Andreas Krause and Anastasios Kyrillidis.

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