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: Thursday, December 03, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Saeed Ilchi

Sample Complexity of Learning Simplices

We study the problem of learning a d-dimensional simplex from a set of points uniformly sampled from its interior. This problem has applications in biology and remote sensing, mostly under the name of ``spectral unmixing''. We show that O(d2/ε log d/ε) samples are enough to learn a simplex up to a total-variation error of ε.  We also propose a heuristic approach for the inference of simplices. Experimental results on synthetic and real-world datasets demonstrate a comparable performance for our method on noiseless samples, while we outperform the state-of-the-art in noisy cases.

Joint work with Amir Najafi, Amirhosssein Saberi, Abolfazl Motahari, Babak Khalaj, and Hamid Rabiee.

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