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, November 27, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Hafsteinn Einarsson

Towards more efficient one shot learning using inhibition in cell assemblies

One shot learning is the task of retaining information presented only once. We study abstract models of one shot learning inspired by biology in the sense that we restrict ourselves to bioplausible parameter regimes. This study eventually led us to questions regarding the spread of information in random graphs (bootstrap percolation / iterative retrieval). For example, how many subsets with density p in a graph on n vertices can you insert until it fails to have the property that the activation of one subset stays within that subset and does not spread to the rest of the graph?

As it turns out, even though many of the models have asymptotically satisfying memory capacities, the restriction to bioplausible parameters can have a detrimental effect on the leading constants. This raises the question, what is the secret ingredient biology has which we are missing?

In this talk I will present past and ongoing research regarding one shot learning in an attempt to unfold this mystery.

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