Sums of Products Research GroupVision
Non-standard methodsespecially ones involving moderately exponential algorithmsfor evaluating large and structured sums of products have great prospects to significantly advance the state of the art in algorithm theory and computational statistics.
The group's current mission is to implement the vision by studying
- algorithm theory of computing sums of products,
- sums of products in computational statistics,
- applications in science and technology.
- Fast sum-product algorithms for set functions
- Efficient algorithms for structure learning in graphical models
- Bounding by products: global bounds via local views
- Ralf Eggeling, post-doc
- Kustaa Kangas, doctoral student (co-advisor Matti Järvisalo)
- Mikko Koivisto, advisor, coach, leader
- Topi Talvitie, doctoral student (co-advisor Valentin Polishchuk)
- Teppo Niinimäki, doctoral student, post-doc (PhD September 2015)
- Janne Korhonen, doctoral student, post-doc (PhD March 2014, co-advisor Petteri Kaski)
- Esther Galbrun, doctoral student (PhD January 2014, co-advisor Hannu TT Toivonen)
- Pekka Parviainen, doctoral student, post-doc (PhD March 2012)
The research is funded by scattered small to moderate-size grants for projects that loosely fit the group's mission: by the Academy of Finland (M.K. 9/2014-8/2018 and 8/2008-10/2013), the doctoral programmes DoCS (K.K. 1/2014-12/2016), FICS (P.P. 1/2010-6/2011) and Hecse (J.K. 1/2010-12/2013; T.N. 1/2011-12/2014), the NIH (UCLA subaward, PI: Heikki Mannila, 7/2007-6/2012), the Algodan CoE, and HIIT.
Last modified Nov 11, 2016.