<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://rctn.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Zayd</id>
	<title>RedwoodCenter - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://rctn.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Zayd"/>
	<link rel="alternate" type="text/html" href="https://rctn.org/wiki/Special:Contributions/Zayd"/>
	<updated>2026-06-14T03:22:57Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.4</generator>
	<entry>
		<id>https://rctn.org/w/index.php?title=Lab_meeting_schedule&amp;diff=7354</id>
		<title>Lab meeting schedule</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Lab_meeting_schedule&amp;diff=7354"/>
		<updated>2014-02-25T21:58:27Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Lab meeting schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Instructions ==&lt;br /&gt;
&lt;br /&gt;
Lab meetings are on fridays starting promptly at 10:45am in 560 Evans.&lt;br /&gt;
20 minutes organizational business followed by a scientific presentation.&lt;br /&gt;
&lt;br /&gt;
You&#039;re welcome to switch dates individually, but talk to the one you&#039;re switching with, and let me ([mailto:cwarner@berkeley.edu Chris]) know so that I can make the change in the schedule.&lt;br /&gt;
&lt;br /&gt;
== Lab meeting schedule ==&lt;br /&gt;
&lt;br /&gt;
1/3 - TBD...&lt;br /&gt;
&lt;br /&gt;
1/10 - Guy Isley&lt;br /&gt;
&lt;br /&gt;
1/17 - Yubei Chen         &lt;br /&gt;
&lt;br /&gt;
1/24 - James Arnemann&lt;br /&gt;
&lt;br /&gt;
1/31 - Katelyn Begany&lt;br /&gt;
&lt;br /&gt;
2/7 - Joe Thurkal&lt;br /&gt;
&lt;br /&gt;
2/14 - Pentti Kanerva &lt;br /&gt;
&lt;br /&gt;
2/21 - Urs Koster&lt;br /&gt;
&lt;br /&gt;
2/28 - &lt;br /&gt;
&lt;br /&gt;
3/7 - Eric Weiss&lt;br /&gt;
&lt;br /&gt;
3/14 - Jesse Engel&lt;br /&gt;
&lt;br /&gt;
3/21 - Brian Cheung / Charles Garfinkle&lt;br /&gt;
&lt;br /&gt;
3/28 - Spring Break&lt;br /&gt;
&lt;br /&gt;
4/4 - Sarah Marzen&lt;br /&gt;
&lt;br /&gt;
4/11 - Guy Isley&lt;br /&gt;
&lt;br /&gt;
4/18 - Zayd Enam&lt;br /&gt;
&lt;br /&gt;
== Previous Lab meetings ==&lt;br /&gt;
&lt;br /&gt;
===2013-2014===&lt;br /&gt;
&lt;br /&gt;
8/23 - Mike Schachter  &lt;br /&gt;
&lt;br /&gt;
8/30 -  Paul Rhodes (Evolved Machines)&lt;br /&gt;
&lt;br /&gt;
9/6 - Chris Warner &lt;br /&gt;
&lt;br /&gt;
9/13 - Michael Schachter&lt;br /&gt;
&lt;br /&gt;
9/20 - Tony Bell&lt;br /&gt;
&lt;br /&gt;
9/27 - Bruno Olshausen&lt;br /&gt;
&lt;br /&gt;
10/4 -  Cancelled for BAVM Meeting @ Facebook&lt;br /&gt;
&lt;br /&gt;
10/11 - Meeting Cancelled (ICBS seminar)&lt;br /&gt;
&lt;br /&gt;
10/18 - Meeting Cancelled (Neuro Retreat)&lt;br /&gt;
&lt;br /&gt;
10/25 - Tyler Lee&lt;br /&gt;
&lt;br /&gt;
11/1 - Meeting Cancelled - ICBS Seminar Robbie Jacobs U Rochester&lt;br /&gt;
&lt;br /&gt;
11/8 - Chris Hillar&lt;br /&gt;
&lt;br /&gt;
11/15 - Clemens Boucsein : &amp;quot;A sub-threshold bifurcation as the determinant for spiking precision in neocortical pyramidal cells.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
11/22 - Mayur Mudigonda&lt;br /&gt;
&lt;br /&gt;
11/29 - Thanksgiving&lt;br /&gt;
&lt;br /&gt;
12/6 - Cancelled : NIPS Conference&lt;br /&gt;
&lt;br /&gt;
12/13 - Dylan Paiton / Sean MacKasey&lt;br /&gt;
&lt;br /&gt;
12/20 - Evan Archer (visitor from Pillow lab)&lt;br /&gt;
&lt;br /&gt;
12/27 - Cancelled (Festivus)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===2012-2013===&lt;br /&gt;
&lt;br /&gt;
8/17 - Daniel Little&lt;br /&gt;
&lt;br /&gt;
8/24 - Chris Hillar&lt;br /&gt;
&lt;br /&gt;
8/31 - Ian Stevenson&lt;br /&gt;
&lt;br /&gt;
9/7 - John Collins &lt;br /&gt;
&lt;br /&gt;
9/14 - Fritz Sommer&lt;br /&gt;
&lt;br /&gt;
9/21 - Tyler Lee &lt;br /&gt;
&lt;br /&gt;
9/28 - Bruno Olshausen &lt;br /&gt;
&lt;br /&gt;
10/5 - Mike Deweese&lt;br /&gt;
&lt;br /&gt;
10/12 - SFN&lt;br /&gt;
&lt;br /&gt;
10/19 - Gert Van Dijck&lt;br /&gt;
&lt;br /&gt;
10/26 - Guy Isley --&amp;gt; Chris/Mayur&lt;br /&gt;
&lt;br /&gt;
11/2 - Gautam Agarwal&lt;br /&gt;
&lt;br /&gt;
11/9 - John Schulman (Bruno)&lt;br /&gt;
&lt;br /&gt;
11/16 - Eric Weiss &lt;br /&gt;
&lt;br /&gt;
11/23 - (thanksgiving)&lt;br /&gt;
&lt;br /&gt;
11/30 - Yan Karklin (Tyler)&lt;br /&gt;
&lt;br /&gt;
12/7 - (NIPS)&lt;br /&gt;
&lt;br /&gt;
12/14 - Daniel Little (exit talk)&lt;br /&gt;
&lt;br /&gt;
12/21 - (open if enough people around)&lt;br /&gt;
&lt;br /&gt;
1/4 -  Mike Schachter&lt;br /&gt;
&lt;br /&gt;
1/11 - SKIPPED &lt;br /&gt;
&lt;br /&gt;
1/18 -   Sarah Marzen&lt;br /&gt;
&lt;br /&gt;
1/25 - Guy Isely&lt;br /&gt;
&lt;br /&gt;
2/1 -  Mika Laiho&lt;br /&gt;
&lt;br /&gt;
2/8 -  Kevin  &lt;br /&gt;
&lt;br /&gt;
2/15 - Chris Warner&lt;br /&gt;
&lt;br /&gt;
2/22 - Ian Stevenson&lt;br /&gt;
&lt;br /&gt;
3/1 - COSYNE&lt;br /&gt;
&lt;br /&gt;
3/8 -  Cosyne summary&lt;br /&gt;
&lt;br /&gt;
3/15 -  Alan Yuille&lt;br /&gt;
&lt;br /&gt;
3/22 - Chris Hillar&lt;br /&gt;
&lt;br /&gt;
3/29 - holiday &lt;br /&gt;
&lt;br /&gt;
4/5 - Tyler Lee   &lt;br /&gt;
&lt;br /&gt;
4/12 - Gautam Agarwal&lt;br /&gt;
&lt;br /&gt;
4/19 - Bruno&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
4/26 - Mayur Mudigonda&lt;br /&gt;
&lt;br /&gt;
5/3 - Harel Shouval&lt;br /&gt;
&lt;br /&gt;
5/10 - Watson (Crutchfield Lab @ UC Davis)&lt;br /&gt;
&lt;br /&gt;
5/17 - Evan Lyall&lt;br /&gt;
&lt;br /&gt;
5/24 - Sarah Marzen &lt;br /&gt;
&lt;br /&gt;
5/31 - Cancelled- Simons Institute Kickoff Meeting&lt;br /&gt;
&lt;br /&gt;
6/7 - Joint Lab Meeting Surya Ganguli Lab&lt;br /&gt;
&lt;br /&gt;
6/14 - Ross Gayler&lt;br /&gt;
&lt;br /&gt;
6/21 - Georgios ICML talk&lt;br /&gt;
&lt;br /&gt;
6/28 - PhD Candidate from Allen Institute&lt;br /&gt;
&lt;br /&gt;
7/5 - No Meeting (4th July Holiday)&lt;br /&gt;
&lt;br /&gt;
7/12 -  Blerim Emruli&lt;br /&gt;
&lt;br /&gt;
7/19 - No Meeting (CRCNS Course)&lt;br /&gt;
&lt;br /&gt;
7/26 - No Meeting (CRCNS Course)&lt;br /&gt;
&lt;br /&gt;
8/2 -  Georgios&lt;br /&gt;
&lt;br /&gt;
8/9 - No Meeting&lt;br /&gt;
&lt;br /&gt;
8/16 - No Meeting (BAVRD Meeting)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===2009===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1/9&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Will&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1/16&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jack&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1/23&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Paul&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1/30&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian&lt;br /&gt;
* Title/abstract: Quaternionic Representations for 2D signals&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2/6&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Daniel&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2/13&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy / Jascha&lt;br /&gt;
* Title/abstract: Learning Lie Group operators from Natural Movie&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2/20&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Badr&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2/27&#039;&#039;&#039;&lt;br /&gt;
COSYNE, no meeting&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3/6&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vivienne&lt;br /&gt;
* Title/astract: AIM vs. JAS / I&#039;ll be multitasking by discussing the results of a sparse coding analysis of the Auditory Image Model. This is work with Fritz and Martin, so hopefully will be there sparing me another meeting afterwards. Depending on the available time I will also solicit feedback on an alternate approach to sounds representation. Individual sounds streams are modeled as successive and overlapping, amplitude and frequency modulated sound &amp;quot;textures&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3/13&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3/20&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3/27&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha and Peter&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4/3&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chris&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4/10&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Fritz&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4/17&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4/24&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pentti&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/1&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jeff&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/8&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Nicol&lt;br /&gt;
* Title/astract:CANCELED&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/15&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Martin&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/22&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/29&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/astract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6/5&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Will&lt;br /&gt;
* Title/astract:CANCELED&lt;br /&gt;
===2008===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 4&#039;&#039;&#039;&lt;br /&gt;
* Speaker: no meeting&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 11&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vivienne&lt;br /&gt;
* Title: A theoretical model of specific language impairment&lt;br /&gt;
* Abstract: Some form of developmental speech or language disorders affecting as many as 5-10% of all children (Leonard, 1998). While many disorders have been associated with specific problems in cognitive or linguistic development, specific language impairment (SLI) describes children with significantly delayed acquisition of language without evidence of brain damage, impaired hearing or vision, schizophrenia, autism or other neurological disorders (Tallal, 2004). As such, children with SLI show extreme difficulty in early language acquisition while other cognitive abilities appear to fall within the population norm. In many earlier theories of SLI, high-level, language-specific deficits were often hypothesized as the underlying cause of the delayed learning; however, findings over the last decade suggest that a more generic auditory deficit underlies the degraded phonological processing associated with SLI children (Leonard, 1998; Tallal et al., 1993, 1996, 1998; Wright et al.., 2000). Much of this literature indicates that impaired perception and discrimination of rapidly changing components of both speech and nonspeech stimuli undermines development of normal language abilities (Godfrey et al., 1981; Kraus et al.., 1996; McAnally &amp;amp; Stein, 1997; Nagarajan et al., 1999; Reed, 1989; Snowling et al.., 1986; Stark &amp;amp; Heinz, 1996a, 1996b; Werker &amp;amp; Tees, 1987; Wright et al., 2000; Goswami et al., 2002, Gaad et al., 2006), although some findings have questioned these findings (Heath &amp;amp; Hogben, 2004; White, Milne, et al., 2006; White, Frith, et al., 2006). Even within this body of research, there exist differing theories about the nature of the underlying deficit. Some groups have agued that deficits in rapid auditory processing (RAP) leads to impairment in the ability to perceive sounds characterized by brief or rapidly changing temporal cues, fundamental to speech perception (Fitch, et al., 1997; Benasich et al., 2002; Tallal et al., 2004), while an alternate hypothesis proposes that SLI develops due to a deficit in the perception of rhythmic timing (Goswami, 2002), which might subserve speech segmentation during language development. Neuroanatomical research suggests that deficits associated with SLI may well emerge in relatively low-level, subcortical auditory processing (Benasich et al., 2002). Here we propose a simple model of low-level auditory processing capable of explaining some of the specific deficits identified in SLI populations associated with both RAP and rhythmic perception. In this “spike coding” model (Smith &amp;amp; Lewicki, 2005 &amp;amp; 2006) sounds are decomposed into a highly sparse set of “spikes” representing the occurrence of acoustic events selected from a dictionary of learned acoustic features (kernel functions). Importantly, by optimizing these acoustic features to efficiently encode natural sounds the resulting code partitions time-frequency space in an identical fashion to the mammalian cochlear code (Smith &amp;amp; Lewicki, 2006). This model predicts that the peripheral auditory code should contain a diverse set of coding units, with some devoted to accurately tracking acoustic transients while others are devoted to tight frequency resolution. The research proposed here uses a combination of behavioral experiments and computation modeling to test whether deficits in RAP and rhythmic perception both emerge in this model from a disruption of the units responsible for tracking acoustic transients.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 18&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chris&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 25&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 1&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gianluca&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 8&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Pfau&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 15&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 22&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jack&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 29&#039;&#039;&#039;&lt;br /&gt;
* Speaker: No meeting, COSYNE&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3/7&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Paul Ivanov ([[Image:20080307pi.pdf|slides]])&lt;br /&gt;
* Title/abstract: I&#039;ll cover the Kozachenko and Leonenko binless entropy estimation method for which I&#039;m in the process of building a toolbox.&lt;br /&gt;
&lt;br /&gt;
I don&#039;t have any exciting new results yet, but I want to be prepared to explain the method for when the excitement does start.&lt;br /&gt;
&lt;br /&gt;
Depending on how long the above stretches out to, I&#039;ll also give an introduction to CUDA - nVidia&#039;s general purpose GPU API to start planting seeds inside your heads for the types of applications that could be sped up using graphics cards. &lt;br /&gt;
    &lt;br /&gt;
&#039;&#039;&#039;3/14&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3/21&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chetan&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;3/28&#039;&#039;&#039;&lt;br /&gt;
* Speaker: no meeting &lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;4/4&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;4/11&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;4/18&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;4/25&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Fritz&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;5/2&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/9&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tim&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/16&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chris&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/23&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Zipser&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5/30&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Greg Simpson&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6/6&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Will&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6/13&#039;&#039;&#039;&lt;br /&gt;
* Speaker: George Oster&lt;br /&gt;
* Title/abstract: The neural origins of sea shell patterns&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6/20&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6/27&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chris Fiorillo, Stanford&lt;br /&gt;
* Title/abstract: A SINGLE NEURON THEORY OF NEURAL COMPUTATION&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7/4&#039;&#039;&#039;&lt;br /&gt;
* Speaker:&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7/11&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7/18&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7/25&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vivienne&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8/1&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gianluca&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8/8&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8/15&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Paul ([[Image:20080815pi.pdf|slides]])&lt;br /&gt;
* Title/abstract:Nearest Neighbor search using CUDA: or how I learned to start worrying and fear the float.&lt;br /&gt;
&lt;br /&gt;
I&#039;ll talk about what kinds of computations can benefit from being&lt;br /&gt;
offloaded to graphics cards, as well as some interesting limitations of&lt;br /&gt;
using floating points that came to light and have been keeping me up at&lt;br /&gt;
night ever since.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8/22&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gianluca&lt;br /&gt;
* Title/abstract: Python tools for brain-inspired sound analysis.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8/29&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9/5&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9/12&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Badr (Mike DeWeese)&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9/19&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Peter (DeWeese lab)&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9/26&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10/3&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10/10&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Rich&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10/17&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Paul ([[Image:20081017pi.pdf|slides]]) (sub&#039;d for Fritz)&lt;br /&gt;
* Title/abstract: Electoral reform, clustering, and vector quantization. I&#039;ll cover instant run-off voting, and it&#039;s multi-seat cousin ranked choice voting, and how we can should be able to apply it to some of the problems that we have.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10/24&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jeff&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10/31&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Nicol&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11/7&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11/14&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11/21&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alex&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11/28&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thanksgiving&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12/5&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12/12&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12/19&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
===2007===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;January 5&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jack&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 12&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 19&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Scott Makeig&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;january 26&#039;&#039;&#039;&lt;br /&gt;
* Walter Freeman symposium (no meeting)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 2&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 9&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Frank Wood (Grad student in Michael Black&#039;s group)&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 16&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Cosyne practice talks and posters&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;february 22 - february 27&#039;&#039;&#039;&lt;br /&gt;
* COSYNE&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;march 2&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alexis Guanella, ETH/INI Zurich&lt;br /&gt;
* Title/abstract: Grid cells&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;march 9&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jeffrey Ng (visitor)&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;march 16&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;march 23&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Learning in the Kinetic Automaton&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;march 30&#039;&#039;&#039;&lt;br /&gt;
* Speaker: spring break&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;april 6&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Martin Rehn&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;april 13&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;april 20&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alexander Schmolck&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;april 27&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;may 4&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;may 11&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;may 18&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;may 25&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Evan&lt;br /&gt;
* Title/abstract: Auditory Scene Analysis / I&#039;ll give a quick tour of a few projects geared towards developing a large-scale model of auditory scene processing.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;june 1&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tim&lt;br /&gt;
* Title/abstract: Saccades, spike timing and large scale cortical dynamics / project update.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;june 8&#039;&#039;&#039;&lt;br /&gt;
* Speaker: cancelled&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;june 15&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;june 22&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;june 29&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;july 6&#039;&#039;&#039;&lt;br /&gt;
* Speaker: cancelled&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;july 13&#039;&#039;&#039;&lt;br /&gt;
* Speaker: no meeting&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;july 20&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract: fMRI analysis&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;july 27&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract: Learning overcomplete subspace structures on natural speech signal &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;august 3&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;august 10&#039;&#039;&#039;&lt;br /&gt;
* Speaker: no meeting&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;august 17&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chetan&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;august 24&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Russ Webb&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;august 31&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;september 7&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;sept 14&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir (granlibakken starts in the evening)&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;sept 21&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chris&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;sept 28&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Chetan&lt;br /&gt;
* Title/abstract: Psychophysics of Object Recognition&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;oct 5&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Fritz&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;oct 12&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;oct 19&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike D&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;oct 26&#039;&#039;&#039;&lt;br /&gt;
* Speaker: sfn poster preview&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;nov 2&#039;&#039;&#039;&lt;br /&gt;
* Speaker: sfn panic - last practice talks, posters should be printed...&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;nov 9&#039;&#039;&#039;&lt;br /&gt;
* Speaker: SFN nobody is back yet.&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;nov 16&#039;&#039;&#039;&lt;br /&gt;
* Speaker: SFN summary&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;nov 23&#039;&#039;&#039;&lt;br /&gt;
* Speaker: thanksgiving&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;nov 30&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;december 7&#039;&#039;&#039;&lt;br /&gt;
* Speaker: no meeting, NIPS&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;december 14&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dan Feldman&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;december 21&#039;&#039;&#039;&lt;br /&gt;
* Speaker: no meeting &lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
===2006===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;April 21&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Fritz&lt;br /&gt;
* Title/abstract: Endophysics&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;April 28&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/abstract: ICA, ISA, IVA and all that ([[Media:tony_lab_meeting_042806.ppt|slides]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;May 5&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian/Tony/Fritz&lt;br /&gt;
* Title/abstract: FQXI proposal [http://www.fqxi.org/ link]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;May 12&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;May 19&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy Wang&lt;br /&gt;
* Title/abstract: Non-negative Matrix Factorization and Sparse Coding&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;May 26&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract: Qualifying exams practice talk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;June 2&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tim&lt;br /&gt;
* Title/abstract: Polytrodes : large scale neuronal recording.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;June 9&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian+Charles&lt;br /&gt;
* Title/abstract: Generalizing the Hilbert Transformation to 2D -- The Monogenic Signal&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;June 16&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract: Preliminary stuff on coherence analysis of sustained attention fMRI experiments.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;June 23&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Rich Baraniuk&lt;br /&gt;
* Title/abstract: Compressed Sensing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;June 30&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;July 7&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;July 14&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;July 21&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract: Signal processing using Chromatic Derivatives &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;July 28&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract: Hierarchical Sparse Bayesian Learning&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;August 4&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Fritz (Jimmy)&lt;br /&gt;
* Title/abstract: Kingsbury/complex wavelets&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;August 11&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jack&lt;br /&gt;
* Title/abstract: Bilinear models&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;August 18&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tim&lt;br /&gt;
* Title/abstract: How sparse is the cortex?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;August 25&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir&lt;br /&gt;
* Title/abstract: Receptive fields&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;September 1&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;September 8&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jascha&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;September 15&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bin Yu&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;September 22&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Charles&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;September 29&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pierre&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;October 6&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kilian&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;October 13&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Horace Barlow&lt;br /&gt;
* Title/abstract: Glass patterns&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;October 20&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Evan&lt;br /&gt;
* Title/abstract: Coincidences and curious complexity&lt;br /&gt;
Is there a relationship between noticing a coincidence in a higher-level cognition sense, such as detecting &amp;quot;non-random&amp;quot; patterns in a series of coin flips, and experience-dependent changes in &amp;quot;attentional&amp;quot; preferences, such as developmental changes in looking times? Perhpas not but I&#039;ll spin a yarn in any case. I&#039;ll start with a review of Griffiths &amp;amp; Tenebaum (in press), &amp;quot;From mere coincidence to meaningful discoveries&amp;quot; (link here: http://cocosci.berkeley.edu/tom/papers/coincidences.pdf). Then I follow with some ill formed ideas of my own.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;October 27&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno -&amp;gt; Tim&lt;br /&gt;
* Title/abstract: SFN poster on sparseness in neural recordings&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;November 3&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Fritz&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;November 10&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jimmy&lt;br /&gt;
* Title/abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;November 17&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas&lt;br /&gt;
* Title/abstract: Functional cortical networks during sustained visuospatial attention. (fMRI data stuff).&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;November 24&#039;&#039;&#039;&lt;br /&gt;
* Speaker: thanksgiving, no meeting&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;December 1&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tony&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;December 8&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruno&lt;br /&gt;
* Title/abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;December 15&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Amir&lt;br /&gt;
* Title/abstract: Will have guest speaker, head of SETI@home and BOINC projects.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;December 22, 29&#039;&#039;&#039;&lt;br /&gt;
* Speaker: holidays, no meetings&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=7254</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=7254"/>
		<updated>2014-01-27T17:22:40Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Tentative / Confirmed Speakers */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Instructions ==&lt;br /&gt;
&lt;br /&gt;
# Check the internal calendar (here) for a free seminar slot. Seminars are usually Wednesdays at noon, but it is flexible in case there is a day that works better for the speaker.  However, it is usually best to avoid booking multiple speakers in the same week - it leads to &amp;quot;seminar burnout&amp;quot; and reduced attendance.  But use your own judgement here - if its a good opportunity and that&#039;s the only time that works then go ahead with it.&lt;br /&gt;
# Once you have proposed a date to a speaker, fill in the speaker information under the appropriate date (or change if necessary).  Use the status field to indicate whether the date is tentative or confirmed. Please also include your name as &#039;&#039;host&#039;&#039;  in case somebody wants to contact you.&lt;br /&gt;
# Once the invitation is confirmed with the speaker, change the status field to &#039;confirmed&#039;. Notify me [mailto:baolshausen@berkeley.edu] that we have a confirmed speaker so that I can update the public web page. Please include a title and abstract.&lt;br /&gt;
# Natalie (HWNI) checks our web page regularly and will send out an announcement a week before and also include with the weekly neuro announcements, but if you don&#039;t get it confirmed until the last minute then make sure to email Natalie  [mailto:nrterranova@berkeley.edu] as well to give her a heads up so she knows to send out an announcement in time.&lt;br /&gt;
# If the speaker needs accommodations you should contact Natalie [mailto:nrterranova@berkeley.edu] to reserve a room at the faculty club. Tell her its for a Redwood speaker so she knows how to bill it.&lt;br /&gt;
# During the visit you will need to look after the visitor, schedule visits with other labs, make plans for lunch, dinner, etc., and introduce at the seminar (don&#039;t ask Bruno to do this at the last moment).  Save receipts for any meals you paid for.&lt;br /&gt;
# After the seminar and before the speaker leaves, make sure to get their address and info for reimbursing travel expenses (receipts) and hand this over to Natalie, or if they prefer they can send these to Natalie after they get home.  Natalie can also help you with getting reimbursed for any expenses you incurred for meals and entertainment.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas Martinetz&lt;br /&gt;
* Affiliation: Univ Luebeck&lt;br /&gt;
* Host: Bruno/Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Orthogonal Sparse Coding and Sensing&lt;br /&gt;
* Abstract: Sparse Coding has been a very successful concept since many natural signals have the property of being sparse in some dictionary (basis). Some natural signals are even sparse in an orthogonal basis, most prominently natural images. They are sparse in a respective wavelet transform. An encoding in an orthogonal basis has a number of advantages,.e.g., finding the optimal coding coefficients is simply a projection instead of being NP-hard.&lt;br /&gt;
Given some data, we want to find the orthogonal basis which provides the sparsest code. This problem can be seen as a &lt;br /&gt;
generalization of Principal Component Analysis. We present an algorithm, Orthogonal Sparse Coding (OSC), which is able to find this basis very robustly. On natural images, it compresses on the level of JPEG, but can adapt to arbitrary and special data sets and achieve significant improvements. With the property of being sparse in some orthogonal basis, we show how signals can be sensed very efficiently in an hierarchical manner with at most k log D sensing actions. This hierarchical sensing might relate to the way we sense the world, with interesting applications in active vision. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Klein&lt;br /&gt;
* Affiliation: Audience&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Feb 2014&#039;&#039;&#039; (leave open for Barth/Martinetz seminar)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Feb 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Sutskever &lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Zayd&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Continuous vector representations for machine translation&lt;br /&gt;
* Abstract: Dictionaries and phrase tables are the basis of modern statistical machine translation systems. I will present a method that can automate the process of generating and extending dictionaries and phrase tables. Our method can translate missing word and phrase entries by learning language structures using large monolingual data, and by mapping between the languages using a small bilingual dataset. It uses distributed representations of words and learns a linear mapping between vector spaces of languages. Despite its simplicity, our method is surprisingly effective: we can achieve almost 90% precision@5 for translation of words between English and Spanish. This method makes little assumption about the languages, so it can be used to extend and refine dictionaries and translation tables for any language pairs. Joint work with Tomas Mikolov and Quoc Le.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Portera-Cailliau&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dean Buonomano&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Robert G. Smith&lt;br /&gt;
* Affiliation: University of Pennsylvania&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Role of Dendritic Computation in the Direction-Selective Circuit of Retina&lt;br /&gt;
* Abstract: The retina utilizes a variety of signal processing mechanisms to compute direction from image motion. The computation is accomplished by a circuit that includes starburst amacrine cells (SBACs), which are GABAergic neurons presynaptic to direction-selective ganglion cells (DSGCs). SBACs are symmetric neurons with several branched dendrites radiating out from the soma. When a stimulus moving back and forth along a SBAC dendrite sequentially activates synaptic inputs, larger post-synaptic potentials (PSPs) are produced in the dendritic tips when the stimulus moves outwards from the soma. The directional difference in EPSP amplitude is further amplified near the dendritic tips by voltage-gated channels to produce directional release of GABA. Reciprocal inhibition between adjacent SBACs may also amplify directional release. Directional signals in the independent SBAC branches are preserved because each dendrite makes selective contacts only with DSGCs of the appropriate preferred-direction. Directional signals are further enhanced within the dendritic arbor of the DSGC, which essentially comprises an array of distinct dendritic compartments. Each of these dendritic compartments locally sum excitatory and inhibitory inputs, amplifies them with voltage-gated channels, and generates spikes that propagate to the axon via the soma. Overall, the computation of direction in the retina is performed by several local dendritic mechanisms both presynaptic and postsynaptic, with the result that directional responses are robust over a broad range of stimuli.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jochen Braun&lt;br /&gt;
* Affiliation: Otto-von-Guericke University, Magdeburg&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Dynamics of visual perception and collective neural activity&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Guiseppe Vitiello&lt;br /&gt;
* Affiliation: University of Salerno&lt;br /&gt;
* Host: Fritz/Walter Freeman&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 May 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Allie Fletcher&lt;br /&gt;
* Affiliation: UC Santa Cruz&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Scalable Identification for Structured Nonlinear Neural Systems&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kanaka Rajan&lt;br /&gt;
* Affiliation: Princeton University&lt;br /&gt;
* Host: Jeff Teeters/Sarah Marzen&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Generation of sequences through reconfiguration of ongoing activity in neural networks: A model of choice-specific cortical dynamics in virtual navigation&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
== Previous Seminars ==&lt;br /&gt;
&lt;br /&gt;
=== 2013/14 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ekaterina Brocke&lt;br /&gt;
* Affiliation: KTH University, Stockholm, Sweden&lt;br /&gt;
* Host: Tony&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Multiscale modeling in Neuroscience: first steps towards multiscale co-simulation tool development.&lt;br /&gt;
* Abstract: Multiscale modeling/simulations attracts an increasing number of neuroscientists to study how different levels of organization (networks of neurons, cellular/subcellular levels) interact with each other across multiple scales, space and time, to mediate different brain functions. Different scales are usually described by different physical and mathematical formalisms thus making it non trivial to perform the integration. In this talk, I will discuss key phenomena in Neuroscience that can be addressed using subcellular/cellular models, possible approaches to perform multiscale simulations in particular a co-simulation method. I will also introduce several multiscale &amp;quot;toy&amp;quot; models of cellular/subcellular levels that were developed with the aim to understand numerical and technical problems which might appear during the co-simulation. And finally, the first steps made towards multiscale co-simulation tool development will be presented during the talk.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Oct 2013 - note: 4:00&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mitya Chkolovskii&lt;br /&gt;
* Affiliation: HHMI/Janelia Farm&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Nemanman&lt;br /&gt;
* Affiliation: Emory University, Departments of Physics and Biology&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Large N in neural data -- expecting the unexpected.&lt;br /&gt;
* Abstract: Recently it has become possible to directly measure simultaneous collective states of many biological components, such as neural activities, genetic sequences, or gene expression profiles. These data are revealing striking results, suggesting, for example, that biological systems are tuned to criticality, and that effective models of these systems based on only pairwise interactions among constitutive components provide surprisingly good fits to the data. We will explore a handful of simplified theoretical models, largely focusing on statistical mechanics of Ising spins, that suggest plausible explanations for these observations. Specifically, I will argue that, at least in certain contexts, these intriguing observations should be expected in multivariate interacting data in the thermodynamic limit of many interacting components.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Oriol Vinyals&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno/Brian&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Beyond Deep Learning: Scalable Methods and Models for Learning&lt;br /&gt;
* Abstract: In this talk I will briefly describe several techniques I explored in my thesis that improve how to efficiently model signal representations and learn useful information from them. The building block of my dissertation is based on machine learning approaches to classification, where a (typically non-linear) function is learned from labeled examples to map from signals to some useful information (e.g. an object class present an image, or a word present in an acoustic signal). One of the motivating factors of my work has been advances in neural networks in deep architectures (which has led to the terminology &amp;quot;deep learning&amp;quot;), and that has shown state-of-the-art performance in acoustic modeling and object recognition -- the main focus of this thesis. In my work, I have contributed to both the learning (or training) of such architectures through faster and robust optimization techniques, and also to the simplification of the deep architecture model to an approach that is simple to optimize. Furthermore, I derived a theoretical bound showing a fundamental limitation of shallow architectures based on sparse coding (which can be seen as a one hidden layer neural network), thus justifying the need for deeper architectures, while also empirically verifying these architectural choices on speech recognition. Many of my contributions have been used in a wide variety of applications, products and datasets as a result of many collaborations within ICSI and Berkeley, but also at Microsoft Research and Google Research.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 Nov 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Garrett T. Kenyon&lt;br /&gt;
* Affiliation: Los Alamos National Laboratory, The New Mexico Consortium&lt;br /&gt;
* Host: Dylan Paiton&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Using Locally Competitive Algorithms to Model Top-Down and Lateral Interactions&lt;br /&gt;
* Abstract: Cortical connections consist of feedforward, feedback and lateral pathways.  Infragranular layers project down the cortical hierarchy to both supra- and infragranular layers at the previous processing level, while the neurons in supragranular layers are linked by extensive long-range lateral projections that cross multiple cortical columns. However, most functional models of visual cortex only account for feedforward connections. Additionally, most models of visual cortex fail to account both for the thalamic projections to non-striate areas and the reciprocal connections from extrastriate areas back to the thalamus. In this talk, I will describe how a modified Locally Competitive Algorithm (LCA; Rozell et al, Neural Comp, 2008) can be used as a unifying framework for exploring the role of top-down and lateral cortical pathways within the context of deep, sparse, generative models.  I will also describe an open source software tool called PetaVision that can be used to implement and execute hierarchical LCA-based models on multi-core, multi-node computer platforms without requiring specific knowledge of parallel-programming constructs.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Nov 2013 (note: Thursday), ***12:30pm*** &#039;&#039;&#039;&lt;br /&gt;
* Speaker: Geoffrey J Goodhill&lt;br /&gt;
* Affiliation: Queensland Brain Institute and School of Mathematics and Physics, The University of Queensland, Australia&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Computational principles of neural wiring development&lt;br /&gt;
* Abstract: Brain function depends on precise patterns of neural wiring. An axon navigating to its target must make guidance decisions based on noisy information from molecular cues in its environment. I will describe a combination of experimental and computational work showing that (1) axons may act as ideal observers when sensing chemotactic gradients, (2) the complex influence of calcium and cAMP levels on guidance decisions can be predicted mathematically, (3) the morphology of growth cones at the axonal tip can be understood in terms of just a few eigenshapes, and remarkably these shapes oscillate in time with periods ranging from minutes to hours. Together this work may shed light on how neural wiring goes wrong in some developmental brain disorders, and how best to promote appropriate regrowth of axons after injury.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Zhenwen Dai&lt;br /&gt;
* Affiliation: FIAS, Goethe University Frankfurt, Germany.&lt;br /&gt;
* Host: Georgios Exarchakis&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: What Are the Invariant Occlusive Components of Image Patches? A Probabilistic Generative Approach &lt;br /&gt;
* Abstract: We study optimal image encoding based on a generative approach with non-linear feature combinations and explicit position encoding. By far most approaches to unsupervised learning of visual features, such as sparse coding or ICA, account for translations by representing the same features at different positions. Some earlier models used a separate encoding of features and their positions to facilitate invariant data encoding and recognition. All probabilistic generative models with explicit position encoding have so far assumed a linear superposition of components to encode image patches. Here, we for the first time apply a model with non-linear feature superposition and explicit position encoding for patches. By avoiding linear superpositions, the studied model represents a closer match to component occlusions which are ubiquitous in natural images. In order to account for occlusions, the non-linear model encodes patches qualitatively very different from linear models by using component representations separated into mask and feature parameters. We first investigated encodings learned by the model using artificial data with mutually occluding components. We find that the model extracts the components, and that it can correctly identify the occlusive components with the hidden variables of the model. On natural image patches, the model learns component masks and features for typical image components. By using reverse correlation, we estimate the receptive fields associated with the model’s hidden units. We find many Gabor-like or globular receptive fields as well as fields sensitive to more complex structures. Our results show that probabilistic models that capture occlusions and invariances can be trained efficiently on image patches, and that the resulting encoding represents an alternative model for the neural encoding of images in the primary visual cortex. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kai Siedenburg&lt;br /&gt;
* Affiliation: UC Davis, Petr Janata&#039;s Lab.&lt;br /&gt;
* Host: Jesse Engel&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Characterizing Short-Term Memory for Musical Timbre&lt;br /&gt;
* Abstract: Short-term memory is a cognitive faculty central for the apprehension of music and speech. Only little is known, however, about memory for musical timbre despite its“sisterhood”with speech; after all, speech can be regarded as sequencing of vocal timbre. Past research has isolated many characteristic effects of verbal memory. Are these also in play for non-vocal timbre sequences? We studied this question by considering short-term memory for serial order. Using timbres and dissimilarity data from McAdams et al. (Psych. Research, 1995), we employed a same/different discrimination paradigm. Experiment 1 (N = 30 MU + 30 nonMU) revealed effects of sequence length and timbral dissimilarity of items, as well as an interaction of musical training and pitch variability: in contrast to musicians, non-musicians&#039; performance was impaired by simultaneous changes in pitch, compared to a constant pitch baseline. Experiment 2 (N = 22) studied whether musicians&#039; memory for timbre sequences was independent of pitch irrespective of the degree of complexity of pitch progressions. Comparing sequences with pitch changing within and across standard and comparison to a constant pitch baseline, performance was now clearly impaired for the variable pitch condition. Experiment 3 (N = 22) showed primacy and recency effects for musicians, and reproduced a positive effect of timbral heterogeneity of sequences. Our findings demonstrate the presence of hallmark effects of verbal memory such as similarity, word length, primacy/recency for the domain of non-vocal timbre, and suggest that memory for speech and non- vocal timbre sequences might to a large extent share underlying mechanisms.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Matthias Bethge&lt;br /&gt;
* Affiliation: University of Tubingen&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2012/13 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Sept 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jason Yeatman&lt;br /&gt;
* Affiliation: Department of Psychology, Stanford University&lt;br /&gt;
* Host: Bruno/Susana Chung&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: The Development of White Matter and Reading Skills&lt;br /&gt;
* Abstract: The development of cerebral white matter involves both myelination and pruning of axons, and the balance between these two processes may differ between individuals. Cross-sectional measures of white matter development mask the interplay between these active developmental processes and their connection to cognitive development.  We followed a cohort of 39 children longitudinally for three years, and measured white matter development and reading development using diffusion tensor imaging and behavioral tests. In the left arcuate and inferior longitudinal fasciculus, children with above-average reading skills initially had low fractional anisotropy (FA) with a steady increase over the 3-year period, while children with below-average reading skills had higher initial FA that declined over time. We describe a dual-process model of white matter development that balances biological processes that have opposing effects on FA, such as axonal myelination and pruning, to explain the pattern of results.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Sophie Deneve&lt;br /&gt;
* Affiliation: Laboratoire de Neurosciences cognitives, ENS-INSERM&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Balanced spiking networks can implement dynamical systems with predictive coding&lt;br /&gt;
* Abstract: Neural networks can integrate sensory information and generate continuously varying outputs, even though individual neurons communicate only with spikes---all-or-none events. Here we show how this can be done efficiently if spikes communicate &amp;quot;prediction errors&amp;quot; between neurons. We focus on the implementation of linear dynamical systems and derive a spiking network model from a single optimization principle. Our model naturally accounts for two puzzling aspects of cortex. First, it provides a rationale for the tight balance and correlations between excitation and inhibition. Second, it predicts asynchronous and irregular firing as a consequence of predictive population coding, even in the limit of vanishing noise. We show that our spiking networks have error-correcting properties that make them far more accurate and robust than comparable rate models. Our approach suggests spike times do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly under-estimated.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gert Van Dijck&lt;br /&gt;
* Affiliation: Cambridge&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: A solution to identifying neurones using extracellular activity in awake animals: a probabilistic machine-learning approach&lt;br /&gt;
* Abstract: Electrophysiological studies over the last fifty years have been hampered by the difficulty of reliably assigning signals to identified cortical neurones. Previous studies have employed a variety of measures based on spike timing or waveform characteristics to tentatively classify other neurone types (Vos et al., Eur. J. Neurosci., 1999; Prsa et al., J. Neurosci., 2009), in some cases supported by juxtacellular labelling (Simpson et al., Prog. Brain Res., 2005; Holtzman et al., J. Physiol., 2006; Barmack and Yakhnitsa, J. Neurosci., 2008; Ruigrok et al., J. Neurosci., 2011), or intracellular staining and / or assessment of membrane properties (Chadderton et al., Nature, 2004; Jorntell and Ekerot, J. Neurosci., 2006; Rancz et al., Nature, 2007). Anaesthetised animals have been widely used as they can provide a ground-truth through neuronal labelling which is much harder to achieve in awake animals where spike-derived measures tend to be relied upon (Lansink et al., Eur. J. Neurosci., 2010). Whilst spike-shapes carry potentially useful information for classifying neuronal classes, they vary with electrode type and the geometric relationship between the electrode and the spike generation zone (Van Dijck et al., Int. J. Neural Syst., 2012). Moreover, spike-shape measurement is achieved with a variety of techniques, making it difficult to compare and standardise between laboratories.In this study we build probabilistic models on the statistics derived from the spike trains of spontaneously active neurones in the cerebellum and the ventral midbrain. The mean spike frequency in combination with the log-interval-entropy (Bhumbra and Dyball, J. Physiol.-London, 2004) of the inter-spike-interval distribution yields the highest prediction accuracy. The cerebellum model consists of two sub-models: a molecular layer - Purkinje layer model and a granular layer - Purkinje layer model. The first model identifies with high accuracy (92.7 %) molecular layer interneurones and Purkinje cells, while the latter identifies with high accuracy (99.2 %) Golgi cells, granule cells, mossy fibers and Purkinje cells. Furthermore, it is shown that the model trained on anaesthetized rat and decerebrate cat data has broad applicability to other species and behavioural states: anaesthetized mice (80 %), awake rabbits (94.2 %) and awake rhesus monkeys (89 - 90 %).Recently, opto-genetics allow to obtain a ground-truth about cell classes. Using opto-genetically identified GABA-ergic and dopaminergic cells we build similar statistical models to identify these neuron types from the ventral midbrain.Hence, this illustrates that our approach will be of general use to a broad variety of laboratories.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 23 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jaimie Sleigh&lt;br /&gt;
* Affiliation: University of Auckland&lt;br /&gt;
* Host: Fritz/Andrew Szeri&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Is General Anesthesia a failure of cortical information integration&lt;br /&gt;
* Abstract: General anesthesia and natural sleep share some commonalities and some differences. Quite a lot is known about the chemical and neuronal effects of general anesthetic drugs.  There are two main groups of anesthetic drugs, which can be distinguished by their effects on the EEG. The most commonly used drugs exert a strong GABAergic action; whereas a second group is characterized by minimal GABAergic effects, but significant NMDA blockade.  It is less clear which and how these various effects result in failure of the patient to wake up when the surgeon cuts them. I will present some results from experimental brain slice work, and theoretical mean field modelling of anesthesia and sleep, that support the idea that the final common mechanism of both types of anaesthesia is fragmentation of long distance information flow in the cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2012&#039;&#039;&#039; (Halloween)&lt;br /&gt;
* Speaker: Jonathan Landy&lt;br /&gt;
* Affiliation: UCSB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Mean-field replica theory: review of basics and a new approach&lt;br /&gt;
* Abstract: Replica theory provides a general method for evaluating the mode of a distribution, and has varied applications to problems in statistical mechanics, signal processing, etc.  Evaluation of the formal expressions arising in replica theory represents a formidable technical challenge, but one that physicists have apparently intuited correct methods for handling.  In this talk, I will first provide a review of the historical development of replica theory, covering: 1) motivation,  2) the intuited ``Parisi-ansatz&amp;quot; solution,  3) continued controversies, and 4) a survey of applications (including to neural networks).  Following this, I will discuss an exploratory effort of mine, aimed at developing an ansatz-free solution method.  As an example, I will work out the phase diagram for a simple spin-glass model.  This talk is intended primarily as a tutorial.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Tom Griffiths&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host:Daniel Little&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Identifying human inductive biases&lt;br /&gt;
* Abstract: People are remarkably good at acquiring complex knowledge from limited data, as is required in learning causal relationships, categories, or aspects of language. Successfully solving inductive problems of this kind requires having good &amp;quot;inductive biases&amp;quot; - constraints that guide inductive inference. Viewed abstractly, understanding human learning requires identifying these inductive biases and exploring their origins. I will argue that probabilistic models of cognition provide a framework that can facilitate this project, giving a transparent characterization of the inductive biases of ideal learners. I will outline how probabilistic models are traditionally used to solve this problem, and then present a new approach that uses Markov chain Monte Carlo algorithms as the basis for an experimental method that magnifies the effects of inductive biases.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2012&#039;&#039;&#039; (Monday) (Thanksgiving week)&lt;br /&gt;
* Speaker: Bin Yu&lt;br /&gt;
* Affiliation: Dept. of Statistics and EECS, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Representation of Natural Images in V4&lt;br /&gt;
* Abstract: The functional organization of area V4 in the mammalian ventral visual pathway is far from being well understood. V4 is believed to play an important role in the recognition of shapes and objects and in visual attention, but the complexity of this cortical area makes it hard to analyze. In particular, no current model of V4 has shown good predictions for neuronal responses to natural images and there is no consensus on the primary role of V4.&lt;br /&gt;
In this talk, we present analysis of electrophysiological data on the response of V4 neurons to natural images. We propose a new computational model that achieves comparable prediction performance for V4 as for V1 neurons. Our model does not rely on any pre-defined image features but only on invariance and sparse coding principles. We interpret our model using sparse principal component analysis and discover two groups of neurons: those selective to texture versus those selective to contours. This supports the thesis that one primary role of V4 is to extract objects from background in the visual field.  Moreover, our study also confirms the diversity of V4 neurons. Among those selective to contours, some of them are selective to orientation, others to acute curvature features.&lt;br /&gt;
(This is joint work with J. Mairal, Y. Benjamini, B. Willmore, M. Oliver&lt;br /&gt;
and J. Gallant.)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:  Yan Karklin&lt;br /&gt;
* Affiliation:  NYU&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Dec 2012 (note this would be the Monday after NIPS)&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Marius Pachitariu&lt;br /&gt;
* Affiliation: Gatsby / UCL&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title:  NIPS paper &amp;quot;Learning visual motion in recurrent neural networks&amp;quot;&lt;br /&gt;
* Abstract: We present a dynamic nonlinear generative model for visual motion based on a&lt;br /&gt;
latent representation of binary-gated Gaussian variables connected in a network. &lt;br /&gt;
Trained on sequences of images by an STDP-like rule the model learns &lt;br /&gt;
to represent different movement directions in different variables. We use an online &lt;br /&gt;
approximate inference scheme that can be mapped to the dynamics of networks &lt;br /&gt;
of neurons. Probed with drifting grating stimuli and moving bars of light, neurons &lt;br /&gt;
in the model show patterns of responses analogous to those of direction-selective &lt;br /&gt;
simple cells in primary visual cortex. We show how the computations of the model &lt;br /&gt;
are enabled by a specific pattern of learnt asymmetric recurrent connections. &lt;br /&gt;
I will also briefly discuss our application of recurrent neural networks as statistical &lt;br /&gt;
models of simultaneously recorded spiking neurons. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Ian Goodfellow&lt;br /&gt;
* Affiliation: U Montreal&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Stuart Hammeroff&lt;br /&gt;
* Affiliation: University of Arizona &lt;br /&gt;
* Host: Gautam Agarwal&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Quantum cognition and brain microtubules &lt;br /&gt;
* Abstract: Cognitive decision processes are generally seen as classical Bayesian probabilities, but better suited to quantum mathematics. For example: 1) Psychological conflict, ambiguity and uncertainty can be viewed as (quantum) superposition of multiple possible judgments and beliefs. 2) Measurement (e.g. answering a question, reaching a decision) reduces possibilities to definite states (‘constructing reality’, ‘collapsing the wave function’). 3) Previous questions influence subsequent answers, so sequence affects outcomes (‘contextual non-commutativity’). 4) Judgments and choices may deviate from classical logic, suggesting random, or ‘non-computable’ quantum influences. Can quantum cognition operate in the brain? Do classical brain activities simulate quantum processes? Or have biomolecular quantum devices evolved? In this talk I will discuss how a finer scale, intra-neuronal level of quantum information processing in cytoskeletal microtubules can accumulate, operate upon and integrate quantum information and memory for self-collapse to classical states which regulate axonal firings, controlling behavior.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday 14 Jan 2013, 1:00pm&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dibyendu Mandal &lt;br /&gt;
* Affiliation: Physics Dept., University of Maryland (Jarzynski group)&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: An exactly solvable model of Maxwell’s demon&lt;br /&gt;
* Abstract: The paradox of Maxwell’s demon has stimulated numerous thought experiments, leading to discussions about the thermodynamic implications of information processing. However, the field has lacked a tangible example or model of an autonomous, mechanical system that reproduces the actions of the demon. To address this issue, we introduce an explicit model of a device that can deliver work to lift a mass against gravity by rectifying thermal fluctuations, while writing information to a memory register. We solve for the steady-state behavior of the model and construct its nonequilibrium phase diagram. In addition to the engine-like action described above, we identify a Landauer eraser region in the phase diagram where the model uses externally supplied work to remove information from the memory register. Our model offers a simple paradigm for investigating the thermodynamics of information processing by exposing a transparent mechanism of operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Brody&lt;br /&gt;
* Affiliation: Princeton&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Neural substrates of decision-making in the rat&lt;br /&gt;
* Abstract: Gradual accumulation of evidence is thought to be a fundamental component of decision-making. Over the last 16 years, research in non-human primates has revealed neural correlates of evidence accumulation in parietal and frontal cortices, and other brain areas . However, the circuit mechanisms underlying these neural correlates remains unknown. Reasoning that a rodent model of evidence accumulation would allow a greater number of experimental subjects, and therefore experiments, as well as facilitate the use of molecular tools, we developed a rat accumulation of evidence task, the &amp;quot;Poisson Clicks&amp;quot; task. In this task, sensory evidence is delivered in pulses whose precisely-controlled timing varies widely within and across trials. The resulting data are analyzed with models of evidence accumulation that use the richly detailed information of each trial’s pulse timing to distinguish between different decision mechanisms. The method provides great statistical power, allowing us to: (1) provide compelling evidence that rats are indeed capable of gradually accumulating evidence for decision-making; (2) accurately estimate multiple parameters of the decision-making process from behavioral data; and (3) measure, for the first time, the diffusion constant of the evidence accumulator, which we show to be optimal (i.e., equal to zero). In addition, the method provides a trial-by-trial, moment-by-moment estimate of the value of the accumulator, which can then be compared in awake behaving electrophysiology experiments to trial-by-trial, moment-by-moment neural firing rate measures. Based on such a comparison, we describe data and a novel analysis approach that reveals differences between parietal and frontal cortices in the neural encoding of accumulating evidence. Finally, using semi-automated training methods to produce tens of rats trained in the Poisson Clicks accumulation of evidence task, we have also used pharmacological inactivation to ask, for the first time, whether parietal and frontal cortices are required for accumulation of evidence, and we are using optogenetic methods to rapidly and transiently inactivate brain regions so as to establish precisely when, during each decision-making trial, it is that each brain region&#039;s activity is necessary for performance of the task.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eugene M. Izhikevich&lt;br /&gt;
* Affiliation: Brain Corporation&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Spikes&lt;br /&gt;
* Abstract: Most communication in the brain is via spikes. While we understand the spike-generation mechanism of individual neurons, we fail to appreciate the spike-timing code and its role in neural computations. The speaker starts with simple models of neuronal spiking and bursting, describes small neuronal circuits that learn spike-timing code via spike-timing dependent plasticity (STDP), and finishes with biologically detailed and anatomically accurate large-scale brain models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Goren Gordon&lt;br /&gt;
* Affiliation: Weizman Intitute&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Hierarchical Curiosity Loops – Model, Behavior and Robotics&lt;br /&gt;
* Abstract: Autonomously learning about one&#039;s own body and its interaction with the environment is a formidable challenge, yet it is ubiquitous in biology: every animal’s pup and every human infant accomplish this task in their first few months of life. Furthermore, biological agents’ curiosity actively drives them to explore and experiment in order to expedite their learning progress. To bridge the gap between biological and artificial agents, a formal mathematical theory of curiosity was developed that attempts to explain observed biological behaviors and enable curiosity emergence in robots. In the talk, I will present the hierarchical curiosity loops model, its application to rodent’s exploratory behavior and its implementation in a fully autonomously learning and behaving reaching robot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jenny Read&lt;br /&gt;
* Affiliation: Institute of Neuroscience, Newcastle University&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Stereoscopic vision&lt;br /&gt;
* Abstract: [To be written]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Valero Laparra&lt;br /&gt;
* Affiliation:  University of Valencia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Empirical statistical analysis of phases in Gabor filtered natural images&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dolores Bozovic&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Bifurcations and phase-locking dynamics in the auditory system&lt;br /&gt;
* Abstract: The inner ear constitutes a remarkable biological sensor that exhibits nanometer-scale sensitivity of mechanical detection. The first step in auditory processing is performed by hair cells, which convert movement into electrical signals via opening of mechanically gated ion channels. These cells are operant in a viscous medium, but can nevertheless sustain oscillations, amplify incoming signals, and even exhibit spontaneous motility, indicating the presence of an underlying active amplification system. Theoretical models have proposed that a hair cell constitutes a nonlinear system with an internal feedback mechanism that can drive it across a bifurcation and into an unstable regime. Our experiments explore the nonlinear response as well as feedback mechanisms  that enable self-tuning already at the peripheral level, as measured in vitro on sensory tissue. A simple dynamic systems framework will be discussed, that captures the main features of the experimentally observed behavior in the form of an Arnold Tongue.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 March 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dale Purves&lt;br /&gt;
* Affiliation: Duke&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: How Visual Evolution Determines What We See&lt;br /&gt;
* Abstract: Information about the physical world is excluded from visual stimuli by the nature of biological vision (the inverse optics problem). Nonetheless, humans and other visual animals routinely succeed in their environments. The talk will explain how the assignment of perceptual values to visual stimuli according to the frequency of occurrence of stimulus patterns resolves the inverse problem and determines the basic visual qualities we see. This interpretation of vision implies that the best (and perhaps the only) way to understand visual system circuitry is to evolve it, an idea supported by recent work.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mounya Elhilali&lt;br /&gt;
* Affiliation: Johns Hopkins&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Attention at the cocktail party: Neural bases and computational strategies for auditory scene analysis&lt;br /&gt;
* Abstract: The perceptual organization of sounds in the environment into coherent objects is a feat constantly facing the auditory system. It manifests itself in the everyday challenge faced by humans and animals alike to parse complex acoustic information arising from multiple sound sources into separate auditory streams. While seemingly effortless, uncovering the neural mechanisms and computational principles underlying this remarkable ability remain a challenge for both the experimental and theoretical neuroscience communities. In this talk, I discuss the potential role of neuronal tuning in mammalian primary auditory cortex in mediating this process. I also examine the role of mechanisms of attention in adapting this neural representation to reflect both the sensory content and the changing behavioral context of complex acoustic scenes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;17th of April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Wiktor Młynarski&lt;br /&gt;
* Affiliation: Max Planck Institute for Mathematics in the Sciences&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Statistical Models of Binaural Sounds&lt;br /&gt;
* Abstract: The auditory system exploits disparities in the sounds arriving at the left and right ear to extract information about the spatial configuration of sound sources. According to the widely acknowledged Duplex Theory, sounds of low frequency are localized based on Interaural Time Differences (ITDs) and localization of high frequency sources relies on Interaural Level Differences (ILDs). Natural sounds, however,  possess a rich structure and contain multiple frequency components.  This leads to the question: what are the contributions of different cues to sound position identification in the natural environment and how much information do they carry about its spatial structure? In this talk, I will present my attempts to answer the above questions using statistical, generative models of naturalistic (simulated) and fully natural binaural sounds.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Byron Yu&lt;br /&gt;
* Affiliation: CMU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bijan Pesaran&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2011/12 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Sep 2011 (Thursday, at noon)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kathrin Berkner&lt;br /&gt;
* Affiliation: Ricoh Innovations Inc.&lt;br /&gt;
* Host: Ivana Tosic&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;21 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike Kilgard&lt;br /&gt;
* Affiliation: UT Dallas&lt;br /&gt;
* Host: Michael Silver&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Moshe Gur&lt;br /&gt;
* Affiliation: Dept. of Biomedical Engineering, Technion, Israel Institute of Technology&lt;br /&gt;
* Host: Bruno/Stan&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: On the unity of perception: How does the brain integrate activity evoked at different cortical loci?&lt;br /&gt;
* Abstract: Any physical device we know, including computers, when comparing A to B must send the information to point C. I have done experiments in three modalities, somato-sensory, auditory, and visual, where 2 different loci at the primary cortex are stimulated and I argue that the &amp;quot;machine&amp;quot; converging hypothesis cannot explain the perceptual results. Thus we must assume a non-converging mechanism whereby the  brain, at times, can compare (integrate, process) events that take place at different loci without sending the information to a common target. Once we allow for such a mechanism, many phenomena can be viewed differently. Take for example the question of how and where does multi-sensory integration take place;  we perceive a synchronized talking face yet detailed  visual and auditory information are represented at very different brain loci.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: University of Hawaii at Manoa&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Predictive power, memory and dissipation in learning systems operating far from thermodynamic equilibrium&lt;br /&gt;
* Abstract: Understanding the physical processes that underly the functioning of biological computing machinery often requires describing processes that occur far from thermodynamic equilibrium. In recent years significant progress has been made in this area, most notably Jarzynski’s work relation and Crooks’ fluctuation theorem. In this talk I will explore how dissipation of energy is related to a system&#039;s information processing inefficiency. The focus is on driven systems that are embedded in a stochastic operating environment. If we describe the system as a state machine, then we can interpret the stochastic dynamics as performing a computation that results in an (implicit) model of the stochastic driving signal. I will show that instantaneous non-predictive information, which serves as a measure of model inefficiency, provides a lower bound on the average dissipated work. This implies that learning systems with larger predictive power can operate more energetically efficiently. We could speculate that perhaps biological systems may have evolved to reflect this kind of adaptation. One interesting insight here is that purely physical notions require what is perfectly in line with the general belief that a useful model must be predictive (at fixed model complexity). Our result thereby ties together ideas from learning theory with basic non-equilibrium thermodynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Graham Cummins&lt;br /&gt;
* Affiliation: WSU&lt;br /&gt;
* Host: Jeff Teeters&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Shinji Nishimoto&lt;br /&gt;
* Affiliation: Gallant lab, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Dec 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Austin Roorda&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: How the unstable eye sees a stable and moving world&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ken Nakayama&lt;br /&gt;
* Affiliation: Harvard University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Subjective Contours&lt;br /&gt;
* Abstract: The concept of the receptive field in visual science has been transformative. It fueled great discoveries of the second half of the 20th C,   providing the dominant understanding of how the visual system works at its early stages.   Its reign has been extended to the field of object recognition where in the form of a linear classifier, it provides a framework to understand visual object recognition (DiCarlo and Cox, 2007).&lt;br /&gt;
Untamed, however, are areas of visual perception, now more or less ignored, dubbed variously as the 2.5 D sketch, mid-level vision, surface representations. Here, neurons with their receptive fields seem unable to bridge the gap, to supply us with even a plausible speculative framework to understand amodal completion, subjective contours and other surface phenomena.  Correspondingly, these areas have become backwater, ignored, leapt over.&lt;br /&gt;
Subjective contours, however, remain as vivid as ever, even more so.&lt;br /&gt;
Everyday, our visual system makes countless visual inferences as to the layout of the world surfaces and objects.  What’s remarkable is that subjective contours  visibly reveal these inferences.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 24 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aniruddha Das&lt;br /&gt;
* Affiliation: Columbia University&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Elad Schneidman &lt;br /&gt;
* Affiliation: Department of Neurobiology, Weizmann Institute of Science&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Sparse high order interaction networks underlie learnable neural population codes&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Feb 2012 (at noon as usual)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Heather Read&lt;br /&gt;
* Affiliation: U. Connecticut&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &amp;quot;Transformation of sparse temporal coding from auditory colliculus and cortex&amp;quot;&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Mar 2012 (note: Thurs)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Daniel Zoran&lt;br /&gt;
* Affiliation: Hebrew University, Jerusalem&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sivak&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ivan Schwab&lt;br /&gt;
* Affiliation: UC Davis&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Evolution&#039;s Witness: How Eyes Evolved&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sussillo&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 April 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kristofer Bouchard&lt;br /&gt;
* Affiliation: UCSF&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Cortical Foundations of Human Speech Production&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 May 2012&#039;&#039;&#039; (rescheduled from April 11)&lt;br /&gt;
* Speaker: Logan Grosenick&lt;br /&gt;
* Affiliation: Stanford, Deisseroth &amp;amp; Suppes Labs&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Acquisition, creation, &amp;amp; analysis of 4D light fields with applications to calcium imaging &amp;amp; optogenetics&lt;br /&gt;
* Abstract: In Light Field Microscopy (LFM), images can be computationally refocused after they are captured [1]. This permits acquiring focal stacks and reconstructing volumes from a single camera frame. In Light Field Illumination (LFI), the same ideas can be used to create an illumination system that can deliver focused light to any position in a volume without moving optics, and these two devices (LFM/LFI) can be used together in the same system [2]. So far, these imaging and illumination systems have largely been used independently in proof-of-concept experiments [1,2]. In this talk I will discuss applications of a combined scanless volumetric imaging and volumetric illumination system applied to 4D calcium imaging and photostimulation of neurons in vivo and in vitro. The volumes resulting from these methods are large (&amp;gt;500,000 voxels per time point), collected at 10-100 frames per second, and highly correlated in space and time. Analyzing such data has required the development and application of machine learning methods appropriate to large, sparse, nonnegative data, as well as the estimation of neural graphical models from calcium transients. This talk will cover the reconstruction and creation of volumes in a microscope using Light Fields [1,2], and the current state-of-the-art for analyzing these large volumes in the context of calcium imaging and optogenetics. &lt;br /&gt;
&lt;br /&gt;
[1] M. Levoy, R. Ng, A. Adams, M. Footer, and M. Horowitz. Light Field Microscopy. ACM Transactions on Graphics 25(3), Proceedings of SIGGRAPH 2006.&lt;br /&gt;
[2] M. Levoy, Z. Zhang, and I. McDowall. Recording and controlling the 4D light field in a microscope. Journal of Microscopy, Volume 235, Part 2, 2009, pp. 144-162. Cover article.&lt;br /&gt;
&lt;br /&gt;
BIO: Logan received bachelors degrees with honors in Biology and Psychology from Stanford, and a Masters in Statistics from Stanford. He is a Ph.D. candidate in the Neurosciences Program working in the labs of Karl Deisseroth and Patrick Suppes, and a trainee at the Stanford Center for Mind, Brain, and Computation. He is interested in developing and applying novel computational imaging and machine learning techniques in order to observe, control, and understand neuronal circuit dynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 June 2012&#039;&#039;&#039; (Thursday)&lt;br /&gt;
* Speaker:  Mitya Chklovskii&lt;br /&gt;
* Affiliation: janelia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jerry Feldman&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Lucas Theis&lt;br /&gt;
* Affiliation: Matthias Bethge lab, Werner Reichardt Centre for Integrative Neuroscience, Tübingen&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Hierarchical models of natural images&lt;br /&gt;
* Abstract: Probabilistic models of natural images have been used to solve a variety of computer vision tasks as well as a means to better understand the computations performed by the visual system in the brain. A lot of theoretical considerations and biological observations point to the fact that natural image models should be hierarchically organized, yet to date, the best known models are still based on what is better described as shallow representations. In this talk, I will present two image models. One is based on the idea of Gaussianization for greedily constructing hierarchical generative models. I will show that when combined with independent subspace analysis, it is able to compete with the state of the art for modeling image patches. The other model combines mixtures of Gaussian scale mixtures with a directed graphical model and multiscale image representations and is able to generate highly structured images of arbitrary size. Evaluating the model&#039;s likelihood and comparing it to a large number of other image models shows that it might well be the best model for natural images yet.&lt;br /&gt;
&lt;br /&gt;
(joint work with Reshad Hosseini and Matthias Bethge)&lt;br /&gt;
&lt;br /&gt;
=== 2010/11 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;02 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Johannes Burge&lt;br /&gt;
* Affiliation: University of Texas at Austin&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tobi Szuts&lt;br /&gt;
* Affiliation: Meister Lab/ Harvard U.&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Wireless recording of neural activity in the visual cortex of a freely moving rat.&lt;br /&gt;
* Abstract: Conventional neural recording systems restrict behavioral experiments to a flat indoor environment compatible with the cable that tethers the subject to the recording instruments. To overcome these constraints, we developed a wireless multi-channel system for recording neural signals from a freely moving animal the size of a rat or larger. The device takes up to 64 voltage signals from implanted electrodes, samples each at 20 kHz, time-division multiplexes them onto a single output line, and transmits that output by radio frequency to a receiver and recording computer up to &amp;gt;60 m away. The system introduces less than 4 ?V RMS of electrode-referred noise, comparable to wired recording systems and considerably less than biological noise. The system has greater channel count or transmission distance than existing telemetry systems. The wireless system has been used to record from the visual cortex of a rat during unconstrained conditions. Outdoor recordings show V1 activity is modulated by nest-building activity. During unguided behavior indoors, neurons responded rapidly and consistently to changes in light level, suppressive effects were prominent in response to an illuminant transition, and firing rate was strongly modulated by locomotion. Neural firing in the visual cortex is relatively sparse and moderate correlations are observed over large distances, suggesting that synchrony is driven by global processes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vikash Gilja&lt;br /&gt;
* Affiliation: Stanford University&lt;br /&gt;
* Host: Charles&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Towards Clinically Viable Neural Prosthetic Systems.&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Oct 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alexandre Francois&lt;br /&gt;
* Affiliation: USC&lt;br /&gt;
* Host: &lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eric Jonas and Vikash Mansinghka&lt;br /&gt;
* Affiliation:  Navia Systems&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Natively Probabilistic Computation: Principles, Artifacts, Architectures and Applications&lt;br /&gt;
* Abstract: Complex probabilistic models and Bayesian inference are becoming&lt;br /&gt;
increasingly critical across science and industry, especially in&lt;br /&gt;
large-scale data analysis. They are also central to our best&lt;br /&gt;
computational accounts of human cognition, perception and action.&lt;br /&gt;
However, all these efforts struggle with the infamous curse of&lt;br /&gt;
dimensionality. Rich probabilistic models can seem hard to write and&lt;br /&gt;
even harder to solve, as specifying and calculating probabilities&lt;br /&gt;
often appears to require the manipulation of exponentially (and&lt;br /&gt;
sometimes infinitely) large tables of numbers.&lt;br /&gt;
&lt;br /&gt;
We argue that these difficulties reflect a basic mismatch between the&lt;br /&gt;
needs of probabilistic reasoning and the deterministic, functional&lt;br /&gt;
orientation of our current hardware, programming languages and CS&lt;br /&gt;
theory. To mitigate these issues, we have been developing a stack of&lt;br /&gt;
abstractions for natively probabilistic computation, based around&lt;br /&gt;
stochastic simulators (or samplers) for distributions, rather than&lt;br /&gt;
evaluators for deterministic functions. Ultimately, our aim is to&lt;br /&gt;
produce a model of computation and the associated hardware and&lt;br /&gt;
programming tools that are as suited for uncertain inference and&lt;br /&gt;
decision-making as our current computers are for precise arithmetic.&lt;br /&gt;
&lt;br /&gt;
In this talk, we will give an overview of the entire stack of&lt;br /&gt;
abstractions supporting natively probabilistic computation, with&lt;br /&gt;
technical detail on several hardware and software artifacts we have&lt;br /&gt;
implemented so far. we will also touch on some new theoretical results&lt;br /&gt;
regarding the computational complexity of probabilistic programs.&lt;br /&gt;
Throughout, we will motivate and connect this work to some current&lt;br /&gt;
applications in biomedical data analysis and computer vision, as well&lt;br /&gt;
as potential hypotheses regarding the implementation of probabilistic&lt;br /&gt;
computation in the brain.&lt;br /&gt;
&lt;br /&gt;
This talk includes joint work with Keith Bonawitz, Beau Cronin,&lt;br /&gt;
Cameron Freer, Daniel Roy and Joshua Tenenbaum.&lt;br /&gt;
&lt;br /&gt;
BRIEF BIOGRAPHY&lt;br /&gt;
&lt;br /&gt;
Vikash Mansinghka is a co-founder and the CTO of Navia Systems, a&lt;br /&gt;
venture-funded startup company building natively probabilistic&lt;br /&gt;
computing machines. He spent 10 years at MIT, eventually earning an&lt;br /&gt;
SB. in Mathematics, an SB. in Computer Science, an MEng in Computer&lt;br /&gt;
Science, and a PhD in Computation. He held graduate fellowships from&lt;br /&gt;
the NSF and MIT&#039;s Lincoln Laboratories, and his PhD dissertation won&lt;br /&gt;
the 2009 MIT George M. Sprowls award for best dissertation in computer&lt;br /&gt;
science. He currently serves on DARPA&#039;s Information Science and&lt;br /&gt;
Technology (ISAT) Study Group.&lt;br /&gt;
&lt;br /&gt;
Eric Jonas is a co-founder of Navia Systems, responsible for in-house&lt;br /&gt;
accelerated inference research and development. He spent ten years at&lt;br /&gt;
MIT, where he earned SB degrees in electrical engineering and computer&lt;br /&gt;
science and neurobiology, an MEng in EECS, with a neurobiology PhD&lt;br /&gt;
expected really soon.  He’s passionate about biological applications&lt;br /&gt;
of probabilistic reasoning and hopes to use Navia’s capabilities to&lt;br /&gt;
combine data from biological science, clinical histories, and patient&lt;br /&gt;
outcomes into seamless models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Patrick Ruther&lt;br /&gt;
* Affiliation:  Imtek, University of Freiburg&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aurel Lazar&lt;br /&gt;
* Affiliation: Department of Electrical Engineering, Columbia University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Encoding Visual Stimuli with a Population of Hodgkin-Huxley Neurons&lt;br /&gt;
* Abstract: We first present a general framework for the reconstruction of natural video&lt;br /&gt;
scenes encoded with a population of spiking neural circuits with random thresholds.&lt;br /&gt;
The visual encoding system consists of a bank of filters, modeling the visual&lt;br /&gt;
receptive fields, in cascade with a population of neural circuits, modeling encoding&lt;br /&gt;
with spikes in the early visual system.&lt;br /&gt;
The neuron models considered include integrate-and-fire neurons and ON-OFF&lt;br /&gt;
neuron pairs with threshold-and-fire spiking mechanisms. All thresholds are assumed&lt;br /&gt;
to be random. We show that for both time-varying and space-time-varying stimuli neural&lt;br /&gt;
spike encoding is akin to taking noisy measurements on the stimulus.&lt;br /&gt;
Second, we formulate the reconstruction problem as the minimization of a&lt;br /&gt;
suitable cost functional in a finite-dimensional vector space and provide an explicit&lt;br /&gt;
algorithm for stimulus recovery. We also present a general solution using the theory of&lt;br /&gt;
smoothing splines in Reproducing Kernel Hilbert Spaces. We provide examples of both&lt;br /&gt;
synthetic video as well as for natural scenes and show that the quality of the&lt;br /&gt;
reconstruction degrades gracefully as the threshold variability of the neurons increases.&lt;br /&gt;
Third, we demonstrate a number of simple operations on the original visual stimulus&lt;br /&gt;
including translations, rotations and zooming. All these operations are natively executed&lt;br /&gt;
in the spike domain. The processed spike trains are decoded for the faithful recovery&lt;br /&gt;
of the stimulus and its transformations.&lt;br /&gt;
Finally, we extend the above results to neural encoding circuits built with Hodking-Huxley&lt;br /&gt;
neurons.&lt;br /&gt;
References:&lt;br /&gt;
Aurel A. Lazar, Eftychios A. Pnevmatikakis and Yiyin Zhou,&lt;br /&gt;
Encoding Natural Scenes with Neural Circuits with Random Thresholds, Vision Research, 2010,&lt;br /&gt;
Special Issue on Mathematical Models of Visual Coding,&lt;br /&gt;
http://dx.doi.org/10.1016/j.visres.2010.03.015&lt;br /&gt;
Aurel A. Lazar,&lt;br /&gt;
Population Encoding with Hodgkin-Huxley Neurons,&lt;br /&gt;
IEEE Transactions on Information Theory, Volume 56, Number 2, pp. 821-837, February, 2010,&lt;br /&gt;
Special Issue on Molecular Biology and Neuroscience,&lt;br /&gt;
http://dx.doi.org/10.1109/TIT.2009.2037040&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Nov 2010&#039;&#039;&#039; (UCB holiday)&lt;br /&gt;
* Speaker: Martha Nari Havenith&lt;br /&gt;
* Affiliation: UCL&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Finding spike timing in the visual cortex - Oscillations as the internal clock of vision?&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2010&#039;&#039;&#039;  (note: on Friday because of SFN)&lt;br /&gt;
* Speaker: Dan Butts&lt;br /&gt;
* Affiliation: UMD&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Common roles of inhibition in visual and auditory processing.&lt;br /&gt;
* Abstract: The role of inhibition in sensory processing is often obscured in extracellular recordings, because the absence of a neuronal response associated with inhibition might also be explained by a simple lack of excitation. However, increasingly, evidence from intracellular recordings demonstrates important roles of inhibition in shaping the stimulus selectivity of sensory neurons in both the visual and auditory systems. We have developed a nonlinear modeling approach that can identify putative excitatory and inhibitory inputs to a neuron using standard extracellular recordings, and have applied these techniques to understand the role of inhibition in shaping sensory processing in visual and auditory areas.  In pre-cortical visual areas (retina and LGN), we find that inhibition likely plays a role in generating temporally precise responses, and mediates adaptation to changing contrast. In an auditory pre-cortical area (inferior colliculus) identified inhibition has nearly identical appearance and functions in temporal processing and adaptation. Thus, we predict common roles of inhibition in these sensory areas, and more generally demonstrate general methods for characterizing the nonlinear computations that comprise sensory processing.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;24 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eizaburo Doi&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Nov 2010 - informal talk&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eero Lehtonen&lt;br /&gt;
* Affiliation: UTU Finland&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Memristors&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gadi Geiger&lt;br /&gt;
* Affiliation: MIT&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Visual and Auditory Perceptual Modes that Characterize Dyslexics&lt;br /&gt;
* Abstract: I will describe how dyslexics’ visual and auditory perception is wider and more diffuse than that of typical readers. This suggests wider neural tuning in dyslexics. In addition I will describe how this processing relates to difficulties in reading. Strengthening the argument and more so helping dyslexics I will describe a regimen of practice that results in improved reading in dyslexics while narrowing perception.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;13 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jorg Lueke&lt;br /&gt;
* Affiliation: FIAS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Linear and Non-linear Approaches to Component Extraction and Their Applications to Visual Data&lt;br /&gt;
* Abstract:  In the nervous system of humans and animals, sensory data are represented as combinations of elementary data components. While for data such as sound waveforms the elementary components combine linearly, other data can better be modeled by non-linear forms of component superpositions. I motivate and discuss two models with binary latent variables: one using standard linear superpositions of basis functions and one using non-linear superpositions.  Crucial for the applicability of both models are efficient learning procedures. I briefly introduce a novel training scheme (ET) and show how it can be applied to probabilistic generative models. For linear and non-linear models the scheme efficiently infers the basis functions as well as the level of sparseness and data noise.  In large-scale applications to image patches, we show results on the statistics of inferred model parameters. Differences between the linear and non-linear models are discussed, and both models are compared to results of standard approaches in the literature and to experimental findings.  Finally, I briefly discuss learning in a recent model that takes explicit component occlusions into account.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Claudia Clopath&lt;br /&gt;
* Affiliation: Universite Paris Decartes&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Siwei Lyu&lt;br /&gt;
* Affiliation: Computer Science Department, University at Albany, SUNY&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: Divisive Normalization as an Efficient Coding Transform: Justification and Evaluation&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  David Field (informal talk)&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;25 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ruth Rosenholtz&lt;br /&gt;
* Affiliation: Dept. of Brain &amp;amp; Cognitive Sciences, Computer Science and AI Lab, MIT&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: What your visual system sees where you are not looking&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ernst Niebur&lt;br /&gt;
* Affiliation: Johns Hopkins U&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vladimir Itskov&lt;br /&gt;
* Affiliation: University of Nebraska-Lincoln&lt;br /&gt;
* Host: Chris&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruce Cumming&lt;br /&gt;
* Affiliation: National Institutes of Health&lt;br /&gt;
* Host: Ivana&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 April 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Lubomir Bourdev&lt;br /&gt;
* Affiliation: Computer Science, UC Berkeley&lt;br /&gt;
* Host:Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &amp;quot;Poselets and Their Applications in High-Level Computer Vision Problems&amp;quot;&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2011 (note: Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Jack Culpepper&lt;br /&gt;
* Affiliation: Redwood Center/EECS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title:  TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 May 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Ian Stevenson&lt;br /&gt;
* Affiliation:  Northwestern University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Explaining tuning curves by estimating interactions between neurons&lt;br /&gt;
* Abstract: One of the central tenets of systems neuroscience is that tuning curves are a byproduct of the interactions between neurons. Using multi-electrode recordings and recently developed inference techniques we can begin to examine this idea in detail and study how well we can explain the functional properties of neurons using the activity of other simultaneously recorded neurons. Here we examine datasets from 6 different brain areas recorded during typical sensorimotor tasks each with ~100 simultaneously recorded neurons. Using these datasets we measured the extent to which interactions between neurons can explain the tuning properties of individual neurons. We found that, in almost all areas, modeling interactions between 30-50 neurons allows more accurate spike prediction than tuning curves. This suggests that tuning can, in some sense, be explained by interactions between neurons in a variety of brain areas, even when recordings consist of relatively small numbers of neurons.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Michael Oliver&lt;br /&gt;
* Affiliation: Gallant lab&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alyson Fletcher&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: Generalized Approximate Message Passing for Neural Receptive Field Estimation and Connectivity&lt;br /&gt;
* Abstract:  Fundamental to understanding sensory encoding and connectivity of neurons are effective tools for developing and validating complex mathematical models from experimental data.  In this talk, I present a graphical models approach to the problems of neural connectivity reconstruction under multi-neuron excitation and to receptive field estimation of sensory neurons in response to stimuli.  I describe a new class of Generalized Approximate Message Passing (GAMP) algorithms for a general class of inference problems on graphical models based Gaussian approximations of loopy belief propagation.  The GAMP framework is extremely general, provides a systematic procedure for incorporating a rich class of nonlinearities, and is computationally tractable with large amounts of data.  In addition, for both the connectivity reconstruction and parameter estimation problems, I show that GAMP-based estimation can naturally incorporate sparsity constraints in the model that arise from the fact that only a small fraction of the potential inputs have any influence on the output of a particular neuron.  A simulation of reconstruction of cortical neural mapping under multi-neuron excitation shows that GAMP offers  improvement over previous compressed sensing methods.  The GAMP method is also validated on estimation of linear nonlinear Poisson (LNP) cascade models for neural responses of salamander retinal ganglion cells.&lt;br /&gt;
&lt;br /&gt;
=== 2009/10 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2 September 2009&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Keith Godfrey&lt;br /&gt;
* Affiliation: University of Cambridge&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anita Schmid&lt;br /&gt;
* Affiliation: Cornell University&lt;br /&gt;
* Host: Kilian&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Subpopulations of neurons in visual area V2 perform differentiation and integration operations in space and time&lt;br /&gt;
* Abstract: The interconnected areas of the visual system work together to find object boundaries in visual scenes. Primary visual cortex (V1) mainly extracts oriented luminance boundaries, while secondary visual cortex (V2) also detects boundaries defined by differences in texture. How the outputs of V1 neurons are combined to allow for the extraction of these more complex boundaries in V2 is as of yet unclear. To address this question, we probed the processing of orientation signals in single neurons in V1 and V2, focusing on response dynamics of neurons to patches of oriented gratings and to combinations of gratings in neighboring patches and sequential time frames. We found two kinds of response dynamics in V2, both of which are different from those of V1 neurons. While V1 neurons in general prefer one orientation, one subpopulation of V2 neurons (“transient”) shows a temporally dynamic preference, resulting in a preference for changes in orientation. The second subpopulation of V2 neurons (“sustained”) responds similarly to V1 neurons, but with a delay. The dynamics of nonlinear responses to combinations of gratings reinforce these distinctions: the dynamics enhance the preference of V1 neurons for continuous orientations, and enhance the preference of V2 transient neurons for discontinuous ones. We propose that transient neurons in V2 perform a differentiation operation on the V1 input, both spatially and temporally, while the sustained neurons perform an integration operation. We show that a simple feedforward network with delayed inhibition can account for the temporal but not for the spatial differentiation operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Andrea Benucci&lt;br /&gt;
* Affiliation: Institute of Ophthalmology, University College London&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Stimulus dependence of the functional connectivity between neurons in primary visual cortex&lt;br /&gt;
* Abstract:  It is known that visual stimuli are encoded by the concerted activity of large populations of neurons in visual cortical areas. However, it is only recently that recording techniques have been made available to study such activations from large ensembles of neurons simultaneously, with millisecond temporal precision and tens of microns spatial resolution. I will present data from voltage-sensitive dye (VSD) imaging and multi-electrode recordings (“Utah” probes) from the primary visual cortex of the cat (V1).  I will discuss the relationship between two fundamental cortical maps of the visual system: the map of retinotopy and the map of orientation. Using spatially localized and full-field oriented stimuli, we studied the functional interdependency of these maps. I will describe traveling and standing waves of cortical activity and their key role as a dynamical substrate for the spatio-temporal coding of visual information.  I will further discuss the properties of the spatio-temporal code in the context of continuous visual stimulation.  While recording population responses to a sequence of oriented stimuli, we asked how responses to individual stimuli summate over time. We found that such rules are mostly linear, supporting the idea that spatial and temporal codes in area V1 operate largely independently. However, these linear rules of summation fail when the visual drive is removed, suggesting that the visual cortex can readily switch between a dynamical regime where either feed-forward or intra-cortical inputs determine the response properties of the network.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 November 2009 (Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Song-Chun Zhu&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 November 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dan Graham&lt;br /&gt;
* Affiliation: Dept. of Mathematics, Dartmouth College&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: The Packet-Switching Brain: A Hypothesis&lt;br /&gt;
* Abstract: Despite great advances in our understanding of neural responses to natural stimuli, the basic structure of the neural code remains elusive. In this talk, I will describe a novel hypothesis regarding the fundamental structure of neural coding in mammals. In particular, I propose that an internet-like routing architecture (specifically packet-switching) underlies neocortical processing, and I propose means of testing this hypothesis via neural response sparseness measurements. I will synthesize a host of suggestive evidence that supports this notion and will, more generally, argue in favor of a large scale shift from the now dominant “computer metaphor,” to the “internet metaphor.” This shift is intended to spur new thinking with regard to neural coding, and its main contribution is to privilege communication over computation as the prime goal of neural systems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 December 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pietro Berkes&lt;br /&gt;
* Affiliation: Volen Center for Complex Systems, Brandeis University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Generative models of vision: from sparse coding toward structured models&lt;br /&gt;
* Abstract: From a computational perspective, one can think of visual perception as the problem of analyzing the light patterns detected by the retina to recover their external causes.  This process requires combining the incoming sensory evidence with internal prior knowledge about general properties of visual elements and the way they interact, and can be formalized in a class of models known as causal generative models.  In the first part of the talk, I will discuss the first and most established generative model, namely the sparse coding model. Sparse coding has been largely successful in showing how the main characteristics of simple cells receptive fields can be accounted for based uniquely on the statistics of natural images. I will briefly review the evidence supporting this model, and contrast it with recent data from the primary visual cortex of ferrets and rats showing that the sparseness of neural activity over development and anesthesia seems to follow trends opposite to those predicted by sparse coding.  In the second part, I will argue that the generative point of view calls for models of natural images that take into account more of the structure of the visual environment. I will present a model that takes a first step in this direction by incorporating the fundamental distinction between identity and attributes of visual elements. After learning, the model mirrors several aspects of the organization of V1, and results in a novel interpretation of complex and simple cells as parallel population of cells, coding for different aspects of the visual input. Further steps toward more structured generative models might thus lead to the development of a more comprehensive account of visual processing in the visual cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: U of Hawaii&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tom Dean&lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Accelerating Computer Vision and Machine Learning Algorithms with Graphics Processors&lt;br /&gt;
* Abstract: Graphics processors (GPUs) and massively-multi-core architectures are becoming more powerful, less costly and more energy efficient, and the related programming language issues are beginning to sort themselves out. That said most researchers don’t want to be writing code that depends on any particular architecture or parallel programming model. Linear algebra, Fourier analysis and image processing have standard libraries that are being ported to exploit SIMD parallelism in GPUs. We can depend on the massively-multiple-core machines du jour to support these libraries and on the high-performance-computing (HPC) community to do the porting for us or with us. These libraries can significantly accelerate important applications in image processing, data analysis and information retrieval. We can develop APIs and the necessary run-time support so that code relying on these libraries will run on any machine in a cluster of computers but exploit GPUs whenever available. This strategy allows us to move toward hybrid computing models that enable a wider range of opportunities for parallelism without requiring the special training of programmers or the disadvantages of developing code that depends on specialized hardware or programming models. This talk summarizes the state of the art in massively-multi-core architectures, presents experimental results that demonstrate the potential for significant performance gains in the two general areas of image processing and machine learning, provides examples of the proposed programming interface, and some more detailed experimental results on one particular problem involving video-content analysis.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Philiponna&lt;br /&gt;
* Affiliation: Paris&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;24 Feburary 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gordon Pipa&lt;br /&gt;
* Affiliation: U Osnabrueck/MPI Frankfurt&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gaute Einevoll&lt;br /&gt;
* Affiliation: UMB, Norway&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Harvey Swadlow&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alan Yuille &lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed (for 1pm)&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dharmendra Modha - cancelled&lt;br /&gt;
* Affiliation: IBM&lt;br /&gt;
* Host:Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Zipser&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: Brytes 2:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
Brytes are little brains that can be assembled into larger, smarter brains. In my first talk I presented a biologically plausible, computationally tractable model of brytes and described how they can be used as subunits to build brains with interesting behaviors.&lt;br /&gt;
&lt;br /&gt;
In this talk I will first show how large numbers of brytes can cooperate to perform complicated actions such as arm and hand manipulations in the presence of obstacles. Then I describe a strategy for a higher level of control that informs each bryte what role it should play in accomplishing the current task. These results could have considerable significance for understanding the brain and possibly be applicable to robotics and BMI.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Frank Werblin  (Redwood group meeting - internal only)&lt;br /&gt;
* Affiliation:  Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anna Judith&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little (Redwood Lab Meeting - internal only)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=7253</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=7253"/>
		<updated>2014-01-27T17:22:11Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Tentative / Confirmed Speakers */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Instructions ==&lt;br /&gt;
&lt;br /&gt;
# Check the internal calendar (here) for a free seminar slot. Seminars are usually Wednesdays at noon, but it is flexible in case there is a day that works better for the speaker.  However, it is usually best to avoid booking multiple speakers in the same week - it leads to &amp;quot;seminar burnout&amp;quot; and reduced attendance.  But use your own judgement here - if its a good opportunity and that&#039;s the only time that works then go ahead with it.&lt;br /&gt;
# Once you have proposed a date to a speaker, fill in the speaker information under the appropriate date (or change if necessary).  Use the status field to indicate whether the date is tentative or confirmed. Please also include your name as &#039;&#039;host&#039;&#039;  in case somebody wants to contact you.&lt;br /&gt;
# Once the invitation is confirmed with the speaker, change the status field to &#039;confirmed&#039;. Notify me [mailto:baolshausen@berkeley.edu] that we have a confirmed speaker so that I can update the public web page. Please include a title and abstract.&lt;br /&gt;
# Natalie (HWNI) checks our web page regularly and will send out an announcement a week before and also include with the weekly neuro announcements, but if you don&#039;t get it confirmed until the last minute then make sure to email Natalie  [mailto:nrterranova@berkeley.edu] as well to give her a heads up so she knows to send out an announcement in time.&lt;br /&gt;
# If the speaker needs accommodations you should contact Natalie [mailto:nrterranova@berkeley.edu] to reserve a room at the faculty club. Tell her its for a Redwood speaker so she knows how to bill it.&lt;br /&gt;
# During the visit you will need to look after the visitor, schedule visits with other labs, make plans for lunch, dinner, etc., and introduce at the seminar (don&#039;t ask Bruno to do this at the last moment).  Save receipts for any meals you paid for.&lt;br /&gt;
# After the seminar and before the speaker leaves, make sure to get their address and info for reimbursing travel expenses (receipts) and hand this over to Natalie, or if they prefer they can send these to Natalie after they get home.  Natalie can also help you with getting reimbursed for any expenses you incurred for meals and entertainment.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas Martinetz&lt;br /&gt;
* Affiliation: Univ Luebeck&lt;br /&gt;
* Host: Bruno/Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Orthogonal Sparse Coding and Sensing&lt;br /&gt;
* Abstract: Sparse Coding has been a very successful concept since many natural signals have the property of being sparse in some dictionary (basis). Some natural signals are even sparse in an orthogonal basis, most prominently natural images. They are sparse in a respective wavelet transform. An encoding in an orthogonal basis has a number of advantages,.e.g., finding the optimal coding coefficients is simply a projection instead of being NP-hard.&lt;br /&gt;
Given some data, we want to find the orthogonal basis which provides the sparsest code. This problem can be seen as a &lt;br /&gt;
generalization of Principal Component Analysis. We present an algorithm, Orthogonal Sparse Coding (OSC), which is able to find this basis very robustly. On natural images, it compresses on the level of JPEG, but can adapt to arbitrary and special data sets and achieve significant improvements. With the property of being sparse in some orthogonal basis, we show how signals can be sensed very efficiently in an hierarchical manner with at most k log D sensing actions. This hierarchical sensing might relate to the way we sense the world, with interesting applications in active vision. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Klein&lt;br /&gt;
* Affiliation: Audience&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Feb 2014&#039;&#039;&#039; (leave open for Barth/Martinetz seminar)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Feb 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Sutskever &lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Zayd&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Continuous vector representations for machine translation&lt;br /&gt;
* Abstract: Dictionaries and phrase tables are the basis of modern statistical machine translation systems. I will present a method that can automate the process of generating and extending dictionaries and phrase tables. Our method can translate missing word and phrase entries by learning language structures using large monolingual data, and by mapping between the languages using a small bilingual dataset. It uses distributed representations of words and learns a linear mapping between vector spaces of languages. Despite its simplicity, our method is surprisingly effective: we can achieve almost 90% precision@5 for translation of words between English and Spanish. This method makes little assumption about the languages, so it can be used to extend and refine dictionaries and translation tables for any language pairs.&lt;br /&gt;
&lt;br /&gt;
Joint work with Tomas Mikolov and Quoc Le.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Portera-Cailliau&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dean Buonomano&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Robert G. Smith&lt;br /&gt;
* Affiliation: University of Pennsylvania&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Role of Dendritic Computation in the Direction-Selective Circuit of Retina&lt;br /&gt;
* Abstract: The retina utilizes a variety of signal processing mechanisms to compute direction from image motion. The computation is accomplished by a circuit that includes starburst amacrine cells (SBACs), which are GABAergic neurons presynaptic to direction-selective ganglion cells (DSGCs). SBACs are symmetric neurons with several branched dendrites radiating out from the soma. When a stimulus moving back and forth along a SBAC dendrite sequentially activates synaptic inputs, larger post-synaptic potentials (PSPs) are produced in the dendritic tips when the stimulus moves outwards from the soma. The directional difference in EPSP amplitude is further amplified near the dendritic tips by voltage-gated channels to produce directional release of GABA. Reciprocal inhibition between adjacent SBACs may also amplify directional release. Directional signals in the independent SBAC branches are preserved because each dendrite makes selective contacts only with DSGCs of the appropriate preferred-direction. Directional signals are further enhanced within the dendritic arbor of the DSGC, which essentially comprises an array of distinct dendritic compartments. Each of these dendritic compartments locally sum excitatory and inhibitory inputs, amplifies them with voltage-gated channels, and generates spikes that propagate to the axon via the soma. Overall, the computation of direction in the retina is performed by several local dendritic mechanisms both presynaptic and postsynaptic, with the result that directional responses are robust over a broad range of stimuli.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jochen Braun&lt;br /&gt;
* Affiliation: Otto-von-Guericke University, Magdeburg&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Dynamics of visual perception and collective neural activity&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Guiseppe Vitiello&lt;br /&gt;
* Affiliation: University of Salerno&lt;br /&gt;
* Host: Fritz/Walter Freeman&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 May 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Allie Fletcher&lt;br /&gt;
* Affiliation: UC Santa Cruz&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Scalable Identification for Structured Nonlinear Neural Systems&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kanaka Rajan&lt;br /&gt;
* Affiliation: Princeton University&lt;br /&gt;
* Host: Jeff Teeters/Sarah Marzen&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Generation of sequences through reconfiguration of ongoing activity in neural networks: A model of choice-specific cortical dynamics in virtual navigation&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
== Previous Seminars ==&lt;br /&gt;
&lt;br /&gt;
=== 2013/14 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ekaterina Brocke&lt;br /&gt;
* Affiliation: KTH University, Stockholm, Sweden&lt;br /&gt;
* Host: Tony&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Multiscale modeling in Neuroscience: first steps towards multiscale co-simulation tool development.&lt;br /&gt;
* Abstract: Multiscale modeling/simulations attracts an increasing number of neuroscientists to study how different levels of organization (networks of neurons, cellular/subcellular levels) interact with each other across multiple scales, space and time, to mediate different brain functions. Different scales are usually described by different physical and mathematical formalisms thus making it non trivial to perform the integration. In this talk, I will discuss key phenomena in Neuroscience that can be addressed using subcellular/cellular models, possible approaches to perform multiscale simulations in particular a co-simulation method. I will also introduce several multiscale &amp;quot;toy&amp;quot; models of cellular/subcellular levels that were developed with the aim to understand numerical and technical problems which might appear during the co-simulation. And finally, the first steps made towards multiscale co-simulation tool development will be presented during the talk.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Oct 2013 - note: 4:00&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mitya Chkolovskii&lt;br /&gt;
* Affiliation: HHMI/Janelia Farm&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Nemanman&lt;br /&gt;
* Affiliation: Emory University, Departments of Physics and Biology&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Large N in neural data -- expecting the unexpected.&lt;br /&gt;
* Abstract: Recently it has become possible to directly measure simultaneous collective states of many biological components, such as neural activities, genetic sequences, or gene expression profiles. These data are revealing striking results, suggesting, for example, that biological systems are tuned to criticality, and that effective models of these systems based on only pairwise interactions among constitutive components provide surprisingly good fits to the data. We will explore a handful of simplified theoretical models, largely focusing on statistical mechanics of Ising spins, that suggest plausible explanations for these observations. Specifically, I will argue that, at least in certain contexts, these intriguing observations should be expected in multivariate interacting data in the thermodynamic limit of many interacting components.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Oriol Vinyals&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno/Brian&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Beyond Deep Learning: Scalable Methods and Models for Learning&lt;br /&gt;
* Abstract: In this talk I will briefly describe several techniques I explored in my thesis that improve how to efficiently model signal representations and learn useful information from them. The building block of my dissertation is based on machine learning approaches to classification, where a (typically non-linear) function is learned from labeled examples to map from signals to some useful information (e.g. an object class present an image, or a word present in an acoustic signal). One of the motivating factors of my work has been advances in neural networks in deep architectures (which has led to the terminology &amp;quot;deep learning&amp;quot;), and that has shown state-of-the-art performance in acoustic modeling and object recognition -- the main focus of this thesis. In my work, I have contributed to both the learning (or training) of such architectures through faster and robust optimization techniques, and also to the simplification of the deep architecture model to an approach that is simple to optimize. Furthermore, I derived a theoretical bound showing a fundamental limitation of shallow architectures based on sparse coding (which can be seen as a one hidden layer neural network), thus justifying the need for deeper architectures, while also empirically verifying these architectural choices on speech recognition. Many of my contributions have been used in a wide variety of applications, products and datasets as a result of many collaborations within ICSI and Berkeley, but also at Microsoft Research and Google Research.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 Nov 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Garrett T. Kenyon&lt;br /&gt;
* Affiliation: Los Alamos National Laboratory, The New Mexico Consortium&lt;br /&gt;
* Host: Dylan Paiton&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Using Locally Competitive Algorithms to Model Top-Down and Lateral Interactions&lt;br /&gt;
* Abstract: Cortical connections consist of feedforward, feedback and lateral pathways.  Infragranular layers project down the cortical hierarchy to both supra- and infragranular layers at the previous processing level, while the neurons in supragranular layers are linked by extensive long-range lateral projections that cross multiple cortical columns. However, most functional models of visual cortex only account for feedforward connections. Additionally, most models of visual cortex fail to account both for the thalamic projections to non-striate areas and the reciprocal connections from extrastriate areas back to the thalamus. In this talk, I will describe how a modified Locally Competitive Algorithm (LCA; Rozell et al, Neural Comp, 2008) can be used as a unifying framework for exploring the role of top-down and lateral cortical pathways within the context of deep, sparse, generative models.  I will also describe an open source software tool called PetaVision that can be used to implement and execute hierarchical LCA-based models on multi-core, multi-node computer platforms without requiring specific knowledge of parallel-programming constructs.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Nov 2013 (note: Thursday), ***12:30pm*** &#039;&#039;&#039;&lt;br /&gt;
* Speaker: Geoffrey J Goodhill&lt;br /&gt;
* Affiliation: Queensland Brain Institute and School of Mathematics and Physics, The University of Queensland, Australia&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Computational principles of neural wiring development&lt;br /&gt;
* Abstract: Brain function depends on precise patterns of neural wiring. An axon navigating to its target must make guidance decisions based on noisy information from molecular cues in its environment. I will describe a combination of experimental and computational work showing that (1) axons may act as ideal observers when sensing chemotactic gradients, (2) the complex influence of calcium and cAMP levels on guidance decisions can be predicted mathematically, (3) the morphology of growth cones at the axonal tip can be understood in terms of just a few eigenshapes, and remarkably these shapes oscillate in time with periods ranging from minutes to hours. Together this work may shed light on how neural wiring goes wrong in some developmental brain disorders, and how best to promote appropriate regrowth of axons after injury.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Zhenwen Dai&lt;br /&gt;
* Affiliation: FIAS, Goethe University Frankfurt, Germany.&lt;br /&gt;
* Host: Georgios Exarchakis&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: What Are the Invariant Occlusive Components of Image Patches? A Probabilistic Generative Approach &lt;br /&gt;
* Abstract: We study optimal image encoding based on a generative approach with non-linear feature combinations and explicit position encoding. By far most approaches to unsupervised learning of visual features, such as sparse coding or ICA, account for translations by representing the same features at different positions. Some earlier models used a separate encoding of features and their positions to facilitate invariant data encoding and recognition. All probabilistic generative models with explicit position encoding have so far assumed a linear superposition of components to encode image patches. Here, we for the first time apply a model with non-linear feature superposition and explicit position encoding for patches. By avoiding linear superpositions, the studied model represents a closer match to component occlusions which are ubiquitous in natural images. In order to account for occlusions, the non-linear model encodes patches qualitatively very different from linear models by using component representations separated into mask and feature parameters. We first investigated encodings learned by the model using artificial data with mutually occluding components. We find that the model extracts the components, and that it can correctly identify the occlusive components with the hidden variables of the model. On natural image patches, the model learns component masks and features for typical image components. By using reverse correlation, we estimate the receptive fields associated with the model’s hidden units. We find many Gabor-like or globular receptive fields as well as fields sensitive to more complex structures. Our results show that probabilistic models that capture occlusions and invariances can be trained efficiently on image patches, and that the resulting encoding represents an alternative model for the neural encoding of images in the primary visual cortex. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kai Siedenburg&lt;br /&gt;
* Affiliation: UC Davis, Petr Janata&#039;s Lab.&lt;br /&gt;
* Host: Jesse Engel&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Characterizing Short-Term Memory for Musical Timbre&lt;br /&gt;
* Abstract: Short-term memory is a cognitive faculty central for the apprehension of music and speech. Only little is known, however, about memory for musical timbre despite its“sisterhood”with speech; after all, speech can be regarded as sequencing of vocal timbre. Past research has isolated many characteristic effects of verbal memory. Are these also in play for non-vocal timbre sequences? We studied this question by considering short-term memory for serial order. Using timbres and dissimilarity data from McAdams et al. (Psych. Research, 1995), we employed a same/different discrimination paradigm. Experiment 1 (N = 30 MU + 30 nonMU) revealed effects of sequence length and timbral dissimilarity of items, as well as an interaction of musical training and pitch variability: in contrast to musicians, non-musicians&#039; performance was impaired by simultaneous changes in pitch, compared to a constant pitch baseline. Experiment 2 (N = 22) studied whether musicians&#039; memory for timbre sequences was independent of pitch irrespective of the degree of complexity of pitch progressions. Comparing sequences with pitch changing within and across standard and comparison to a constant pitch baseline, performance was now clearly impaired for the variable pitch condition. Experiment 3 (N = 22) showed primacy and recency effects for musicians, and reproduced a positive effect of timbral heterogeneity of sequences. Our findings demonstrate the presence of hallmark effects of verbal memory such as similarity, word length, primacy/recency for the domain of non-vocal timbre, and suggest that memory for speech and non- vocal timbre sequences might to a large extent share underlying mechanisms.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Matthias Bethge&lt;br /&gt;
* Affiliation: University of Tubingen&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2012/13 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Sept 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jason Yeatman&lt;br /&gt;
* Affiliation: Department of Psychology, Stanford University&lt;br /&gt;
* Host: Bruno/Susana Chung&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: The Development of White Matter and Reading Skills&lt;br /&gt;
* Abstract: The development of cerebral white matter involves both myelination and pruning of axons, and the balance between these two processes may differ between individuals. Cross-sectional measures of white matter development mask the interplay between these active developmental processes and their connection to cognitive development.  We followed a cohort of 39 children longitudinally for three years, and measured white matter development and reading development using diffusion tensor imaging and behavioral tests. In the left arcuate and inferior longitudinal fasciculus, children with above-average reading skills initially had low fractional anisotropy (FA) with a steady increase over the 3-year period, while children with below-average reading skills had higher initial FA that declined over time. We describe a dual-process model of white matter development that balances biological processes that have opposing effects on FA, such as axonal myelination and pruning, to explain the pattern of results.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Sophie Deneve&lt;br /&gt;
* Affiliation: Laboratoire de Neurosciences cognitives, ENS-INSERM&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Balanced spiking networks can implement dynamical systems with predictive coding&lt;br /&gt;
* Abstract: Neural networks can integrate sensory information and generate continuously varying outputs, even though individual neurons communicate only with spikes---all-or-none events. Here we show how this can be done efficiently if spikes communicate &amp;quot;prediction errors&amp;quot; between neurons. We focus on the implementation of linear dynamical systems and derive a spiking network model from a single optimization principle. Our model naturally accounts for two puzzling aspects of cortex. First, it provides a rationale for the tight balance and correlations between excitation and inhibition. Second, it predicts asynchronous and irregular firing as a consequence of predictive population coding, even in the limit of vanishing noise. We show that our spiking networks have error-correcting properties that make them far more accurate and robust than comparable rate models. Our approach suggests spike times do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly under-estimated.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gert Van Dijck&lt;br /&gt;
* Affiliation: Cambridge&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: A solution to identifying neurones using extracellular activity in awake animals: a probabilistic machine-learning approach&lt;br /&gt;
* Abstract: Electrophysiological studies over the last fifty years have been hampered by the difficulty of reliably assigning signals to identified cortical neurones. Previous studies have employed a variety of measures based on spike timing or waveform characteristics to tentatively classify other neurone types (Vos et al., Eur. J. Neurosci., 1999; Prsa et al., J. Neurosci., 2009), in some cases supported by juxtacellular labelling (Simpson et al., Prog. Brain Res., 2005; Holtzman et al., J. Physiol., 2006; Barmack and Yakhnitsa, J. Neurosci., 2008; Ruigrok et al., J. Neurosci., 2011), or intracellular staining and / or assessment of membrane properties (Chadderton et al., Nature, 2004; Jorntell and Ekerot, J. Neurosci., 2006; Rancz et al., Nature, 2007). Anaesthetised animals have been widely used as they can provide a ground-truth through neuronal labelling which is much harder to achieve in awake animals where spike-derived measures tend to be relied upon (Lansink et al., Eur. J. Neurosci., 2010). Whilst spike-shapes carry potentially useful information for classifying neuronal classes, they vary with electrode type and the geometric relationship between the electrode and the spike generation zone (Van Dijck et al., Int. J. Neural Syst., 2012). Moreover, spike-shape measurement is achieved with a variety of techniques, making it difficult to compare and standardise between laboratories.In this study we build probabilistic models on the statistics derived from the spike trains of spontaneously active neurones in the cerebellum and the ventral midbrain. The mean spike frequency in combination with the log-interval-entropy (Bhumbra and Dyball, J. Physiol.-London, 2004) of the inter-spike-interval distribution yields the highest prediction accuracy. The cerebellum model consists of two sub-models: a molecular layer - Purkinje layer model and a granular layer - Purkinje layer model. The first model identifies with high accuracy (92.7 %) molecular layer interneurones and Purkinje cells, while the latter identifies with high accuracy (99.2 %) Golgi cells, granule cells, mossy fibers and Purkinje cells. Furthermore, it is shown that the model trained on anaesthetized rat and decerebrate cat data has broad applicability to other species and behavioural states: anaesthetized mice (80 %), awake rabbits (94.2 %) and awake rhesus monkeys (89 - 90 %).Recently, opto-genetics allow to obtain a ground-truth about cell classes. Using opto-genetically identified GABA-ergic and dopaminergic cells we build similar statistical models to identify these neuron types from the ventral midbrain.Hence, this illustrates that our approach will be of general use to a broad variety of laboratories.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 23 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jaimie Sleigh&lt;br /&gt;
* Affiliation: University of Auckland&lt;br /&gt;
* Host: Fritz/Andrew Szeri&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Is General Anesthesia a failure of cortical information integration&lt;br /&gt;
* Abstract: General anesthesia and natural sleep share some commonalities and some differences. Quite a lot is known about the chemical and neuronal effects of general anesthetic drugs.  There are two main groups of anesthetic drugs, which can be distinguished by their effects on the EEG. The most commonly used drugs exert a strong GABAergic action; whereas a second group is characterized by minimal GABAergic effects, but significant NMDA blockade.  It is less clear which and how these various effects result in failure of the patient to wake up when the surgeon cuts them. I will present some results from experimental brain slice work, and theoretical mean field modelling of anesthesia and sleep, that support the idea that the final common mechanism of both types of anaesthesia is fragmentation of long distance information flow in the cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2012&#039;&#039;&#039; (Halloween)&lt;br /&gt;
* Speaker: Jonathan Landy&lt;br /&gt;
* Affiliation: UCSB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Mean-field replica theory: review of basics and a new approach&lt;br /&gt;
* Abstract: Replica theory provides a general method for evaluating the mode of a distribution, and has varied applications to problems in statistical mechanics, signal processing, etc.  Evaluation of the formal expressions arising in replica theory represents a formidable technical challenge, but one that physicists have apparently intuited correct methods for handling.  In this talk, I will first provide a review of the historical development of replica theory, covering: 1) motivation,  2) the intuited ``Parisi-ansatz&amp;quot; solution,  3) continued controversies, and 4) a survey of applications (including to neural networks).  Following this, I will discuss an exploratory effort of mine, aimed at developing an ansatz-free solution method.  As an example, I will work out the phase diagram for a simple spin-glass model.  This talk is intended primarily as a tutorial.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Tom Griffiths&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host:Daniel Little&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Identifying human inductive biases&lt;br /&gt;
* Abstract: People are remarkably good at acquiring complex knowledge from limited data, as is required in learning causal relationships, categories, or aspects of language. Successfully solving inductive problems of this kind requires having good &amp;quot;inductive biases&amp;quot; - constraints that guide inductive inference. Viewed abstractly, understanding human learning requires identifying these inductive biases and exploring their origins. I will argue that probabilistic models of cognition provide a framework that can facilitate this project, giving a transparent characterization of the inductive biases of ideal learners. I will outline how probabilistic models are traditionally used to solve this problem, and then present a new approach that uses Markov chain Monte Carlo algorithms as the basis for an experimental method that magnifies the effects of inductive biases.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2012&#039;&#039;&#039; (Monday) (Thanksgiving week)&lt;br /&gt;
* Speaker: Bin Yu&lt;br /&gt;
* Affiliation: Dept. of Statistics and EECS, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Representation of Natural Images in V4&lt;br /&gt;
* Abstract: The functional organization of area V4 in the mammalian ventral visual pathway is far from being well understood. V4 is believed to play an important role in the recognition of shapes and objects and in visual attention, but the complexity of this cortical area makes it hard to analyze. In particular, no current model of V4 has shown good predictions for neuronal responses to natural images and there is no consensus on the primary role of V4.&lt;br /&gt;
In this talk, we present analysis of electrophysiological data on the response of V4 neurons to natural images. We propose a new computational model that achieves comparable prediction performance for V4 as for V1 neurons. Our model does not rely on any pre-defined image features but only on invariance and sparse coding principles. We interpret our model using sparse principal component analysis and discover two groups of neurons: those selective to texture versus those selective to contours. This supports the thesis that one primary role of V4 is to extract objects from background in the visual field.  Moreover, our study also confirms the diversity of V4 neurons. Among those selective to contours, some of them are selective to orientation, others to acute curvature features.&lt;br /&gt;
(This is joint work with J. Mairal, Y. Benjamini, B. Willmore, M. Oliver&lt;br /&gt;
and J. Gallant.)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:  Yan Karklin&lt;br /&gt;
* Affiliation:  NYU&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Dec 2012 (note this would be the Monday after NIPS)&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Marius Pachitariu&lt;br /&gt;
* Affiliation: Gatsby / UCL&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title:  NIPS paper &amp;quot;Learning visual motion in recurrent neural networks&amp;quot;&lt;br /&gt;
* Abstract: We present a dynamic nonlinear generative model for visual motion based on a&lt;br /&gt;
latent representation of binary-gated Gaussian variables connected in a network. &lt;br /&gt;
Trained on sequences of images by an STDP-like rule the model learns &lt;br /&gt;
to represent different movement directions in different variables. We use an online &lt;br /&gt;
approximate inference scheme that can be mapped to the dynamics of networks &lt;br /&gt;
of neurons. Probed with drifting grating stimuli and moving bars of light, neurons &lt;br /&gt;
in the model show patterns of responses analogous to those of direction-selective &lt;br /&gt;
simple cells in primary visual cortex. We show how the computations of the model &lt;br /&gt;
are enabled by a specific pattern of learnt asymmetric recurrent connections. &lt;br /&gt;
I will also briefly discuss our application of recurrent neural networks as statistical &lt;br /&gt;
models of simultaneously recorded spiking neurons. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Ian Goodfellow&lt;br /&gt;
* Affiliation: U Montreal&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Stuart Hammeroff&lt;br /&gt;
* Affiliation: University of Arizona &lt;br /&gt;
* Host: Gautam Agarwal&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Quantum cognition and brain microtubules &lt;br /&gt;
* Abstract: Cognitive decision processes are generally seen as classical Bayesian probabilities, but better suited to quantum mathematics. For example: 1) Psychological conflict, ambiguity and uncertainty can be viewed as (quantum) superposition of multiple possible judgments and beliefs. 2) Measurement (e.g. answering a question, reaching a decision) reduces possibilities to definite states (‘constructing reality’, ‘collapsing the wave function’). 3) Previous questions influence subsequent answers, so sequence affects outcomes (‘contextual non-commutativity’). 4) Judgments and choices may deviate from classical logic, suggesting random, or ‘non-computable’ quantum influences. Can quantum cognition operate in the brain? Do classical brain activities simulate quantum processes? Or have biomolecular quantum devices evolved? In this talk I will discuss how a finer scale, intra-neuronal level of quantum information processing in cytoskeletal microtubules can accumulate, operate upon and integrate quantum information and memory for self-collapse to classical states which regulate axonal firings, controlling behavior.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday 14 Jan 2013, 1:00pm&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dibyendu Mandal &lt;br /&gt;
* Affiliation: Physics Dept., University of Maryland (Jarzynski group)&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: An exactly solvable model of Maxwell’s demon&lt;br /&gt;
* Abstract: The paradox of Maxwell’s demon has stimulated numerous thought experiments, leading to discussions about the thermodynamic implications of information processing. However, the field has lacked a tangible example or model of an autonomous, mechanical system that reproduces the actions of the demon. To address this issue, we introduce an explicit model of a device that can deliver work to lift a mass against gravity by rectifying thermal fluctuations, while writing information to a memory register. We solve for the steady-state behavior of the model and construct its nonequilibrium phase diagram. In addition to the engine-like action described above, we identify a Landauer eraser region in the phase diagram where the model uses externally supplied work to remove information from the memory register. Our model offers a simple paradigm for investigating the thermodynamics of information processing by exposing a transparent mechanism of operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Brody&lt;br /&gt;
* Affiliation: Princeton&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Neural substrates of decision-making in the rat&lt;br /&gt;
* Abstract: Gradual accumulation of evidence is thought to be a fundamental component of decision-making. Over the last 16 years, research in non-human primates has revealed neural correlates of evidence accumulation in parietal and frontal cortices, and other brain areas . However, the circuit mechanisms underlying these neural correlates remains unknown. Reasoning that a rodent model of evidence accumulation would allow a greater number of experimental subjects, and therefore experiments, as well as facilitate the use of molecular tools, we developed a rat accumulation of evidence task, the &amp;quot;Poisson Clicks&amp;quot; task. In this task, sensory evidence is delivered in pulses whose precisely-controlled timing varies widely within and across trials. The resulting data are analyzed with models of evidence accumulation that use the richly detailed information of each trial’s pulse timing to distinguish between different decision mechanisms. The method provides great statistical power, allowing us to: (1) provide compelling evidence that rats are indeed capable of gradually accumulating evidence for decision-making; (2) accurately estimate multiple parameters of the decision-making process from behavioral data; and (3) measure, for the first time, the diffusion constant of the evidence accumulator, which we show to be optimal (i.e., equal to zero). In addition, the method provides a trial-by-trial, moment-by-moment estimate of the value of the accumulator, which can then be compared in awake behaving electrophysiology experiments to trial-by-trial, moment-by-moment neural firing rate measures. Based on such a comparison, we describe data and a novel analysis approach that reveals differences between parietal and frontal cortices in the neural encoding of accumulating evidence. Finally, using semi-automated training methods to produce tens of rats trained in the Poisson Clicks accumulation of evidence task, we have also used pharmacological inactivation to ask, for the first time, whether parietal and frontal cortices are required for accumulation of evidence, and we are using optogenetic methods to rapidly and transiently inactivate brain regions so as to establish precisely when, during each decision-making trial, it is that each brain region&#039;s activity is necessary for performance of the task.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eugene M. Izhikevich&lt;br /&gt;
* Affiliation: Brain Corporation&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Spikes&lt;br /&gt;
* Abstract: Most communication in the brain is via spikes. While we understand the spike-generation mechanism of individual neurons, we fail to appreciate the spike-timing code and its role in neural computations. The speaker starts with simple models of neuronal spiking and bursting, describes small neuronal circuits that learn spike-timing code via spike-timing dependent plasticity (STDP), and finishes with biologically detailed and anatomically accurate large-scale brain models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Goren Gordon&lt;br /&gt;
* Affiliation: Weizman Intitute&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Hierarchical Curiosity Loops – Model, Behavior and Robotics&lt;br /&gt;
* Abstract: Autonomously learning about one&#039;s own body and its interaction with the environment is a formidable challenge, yet it is ubiquitous in biology: every animal’s pup and every human infant accomplish this task in their first few months of life. Furthermore, biological agents’ curiosity actively drives them to explore and experiment in order to expedite their learning progress. To bridge the gap between biological and artificial agents, a formal mathematical theory of curiosity was developed that attempts to explain observed biological behaviors and enable curiosity emergence in robots. In the talk, I will present the hierarchical curiosity loops model, its application to rodent’s exploratory behavior and its implementation in a fully autonomously learning and behaving reaching robot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jenny Read&lt;br /&gt;
* Affiliation: Institute of Neuroscience, Newcastle University&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Stereoscopic vision&lt;br /&gt;
* Abstract: [To be written]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Valero Laparra&lt;br /&gt;
* Affiliation:  University of Valencia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Empirical statistical analysis of phases in Gabor filtered natural images&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dolores Bozovic&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Bifurcations and phase-locking dynamics in the auditory system&lt;br /&gt;
* Abstract: The inner ear constitutes a remarkable biological sensor that exhibits nanometer-scale sensitivity of mechanical detection. The first step in auditory processing is performed by hair cells, which convert movement into electrical signals via opening of mechanically gated ion channels. These cells are operant in a viscous medium, but can nevertheless sustain oscillations, amplify incoming signals, and even exhibit spontaneous motility, indicating the presence of an underlying active amplification system. Theoretical models have proposed that a hair cell constitutes a nonlinear system with an internal feedback mechanism that can drive it across a bifurcation and into an unstable regime. Our experiments explore the nonlinear response as well as feedback mechanisms  that enable self-tuning already at the peripheral level, as measured in vitro on sensory tissue. A simple dynamic systems framework will be discussed, that captures the main features of the experimentally observed behavior in the form of an Arnold Tongue.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 March 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dale Purves&lt;br /&gt;
* Affiliation: Duke&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: How Visual Evolution Determines What We See&lt;br /&gt;
* Abstract: Information about the physical world is excluded from visual stimuli by the nature of biological vision (the inverse optics problem). Nonetheless, humans and other visual animals routinely succeed in their environments. The talk will explain how the assignment of perceptual values to visual stimuli according to the frequency of occurrence of stimulus patterns resolves the inverse problem and determines the basic visual qualities we see. This interpretation of vision implies that the best (and perhaps the only) way to understand visual system circuitry is to evolve it, an idea supported by recent work.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mounya Elhilali&lt;br /&gt;
* Affiliation: Johns Hopkins&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Attention at the cocktail party: Neural bases and computational strategies for auditory scene analysis&lt;br /&gt;
* Abstract: The perceptual organization of sounds in the environment into coherent objects is a feat constantly facing the auditory system. It manifests itself in the everyday challenge faced by humans and animals alike to parse complex acoustic information arising from multiple sound sources into separate auditory streams. While seemingly effortless, uncovering the neural mechanisms and computational principles underlying this remarkable ability remain a challenge for both the experimental and theoretical neuroscience communities. In this talk, I discuss the potential role of neuronal tuning in mammalian primary auditory cortex in mediating this process. I also examine the role of mechanisms of attention in adapting this neural representation to reflect both the sensory content and the changing behavioral context of complex acoustic scenes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;17th of April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Wiktor Młynarski&lt;br /&gt;
* Affiliation: Max Planck Institute for Mathematics in the Sciences&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Statistical Models of Binaural Sounds&lt;br /&gt;
* Abstract: The auditory system exploits disparities in the sounds arriving at the left and right ear to extract information about the spatial configuration of sound sources. According to the widely acknowledged Duplex Theory, sounds of low frequency are localized based on Interaural Time Differences (ITDs) and localization of high frequency sources relies on Interaural Level Differences (ILDs). Natural sounds, however,  possess a rich structure and contain multiple frequency components.  This leads to the question: what are the contributions of different cues to sound position identification in the natural environment and how much information do they carry about its spatial structure? In this talk, I will present my attempts to answer the above questions using statistical, generative models of naturalistic (simulated) and fully natural binaural sounds.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Byron Yu&lt;br /&gt;
* Affiliation: CMU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bijan Pesaran&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2011/12 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Sep 2011 (Thursday, at noon)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kathrin Berkner&lt;br /&gt;
* Affiliation: Ricoh Innovations Inc.&lt;br /&gt;
* Host: Ivana Tosic&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;21 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike Kilgard&lt;br /&gt;
* Affiliation: UT Dallas&lt;br /&gt;
* Host: Michael Silver&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Moshe Gur&lt;br /&gt;
* Affiliation: Dept. of Biomedical Engineering, Technion, Israel Institute of Technology&lt;br /&gt;
* Host: Bruno/Stan&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: On the unity of perception: How does the brain integrate activity evoked at different cortical loci?&lt;br /&gt;
* Abstract: Any physical device we know, including computers, when comparing A to B must send the information to point C. I have done experiments in three modalities, somato-sensory, auditory, and visual, where 2 different loci at the primary cortex are stimulated and I argue that the &amp;quot;machine&amp;quot; converging hypothesis cannot explain the perceptual results. Thus we must assume a non-converging mechanism whereby the  brain, at times, can compare (integrate, process) events that take place at different loci without sending the information to a common target. Once we allow for such a mechanism, many phenomena can be viewed differently. Take for example the question of how and where does multi-sensory integration take place;  we perceive a synchronized talking face yet detailed  visual and auditory information are represented at very different brain loci.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: University of Hawaii at Manoa&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Predictive power, memory and dissipation in learning systems operating far from thermodynamic equilibrium&lt;br /&gt;
* Abstract: Understanding the physical processes that underly the functioning of biological computing machinery often requires describing processes that occur far from thermodynamic equilibrium. In recent years significant progress has been made in this area, most notably Jarzynski’s work relation and Crooks’ fluctuation theorem. In this talk I will explore how dissipation of energy is related to a system&#039;s information processing inefficiency. The focus is on driven systems that are embedded in a stochastic operating environment. If we describe the system as a state machine, then we can interpret the stochastic dynamics as performing a computation that results in an (implicit) model of the stochastic driving signal. I will show that instantaneous non-predictive information, which serves as a measure of model inefficiency, provides a lower bound on the average dissipated work. This implies that learning systems with larger predictive power can operate more energetically efficiently. We could speculate that perhaps biological systems may have evolved to reflect this kind of adaptation. One interesting insight here is that purely physical notions require what is perfectly in line with the general belief that a useful model must be predictive (at fixed model complexity). Our result thereby ties together ideas from learning theory with basic non-equilibrium thermodynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Graham Cummins&lt;br /&gt;
* Affiliation: WSU&lt;br /&gt;
* Host: Jeff Teeters&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Shinji Nishimoto&lt;br /&gt;
* Affiliation: Gallant lab, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Dec 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Austin Roorda&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: How the unstable eye sees a stable and moving world&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ken Nakayama&lt;br /&gt;
* Affiliation: Harvard University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Subjective Contours&lt;br /&gt;
* Abstract: The concept of the receptive field in visual science has been transformative. It fueled great discoveries of the second half of the 20th C,   providing the dominant understanding of how the visual system works at its early stages.   Its reign has been extended to the field of object recognition where in the form of a linear classifier, it provides a framework to understand visual object recognition (DiCarlo and Cox, 2007).&lt;br /&gt;
Untamed, however, are areas of visual perception, now more or less ignored, dubbed variously as the 2.5 D sketch, mid-level vision, surface representations. Here, neurons with their receptive fields seem unable to bridge the gap, to supply us with even a plausible speculative framework to understand amodal completion, subjective contours and other surface phenomena.  Correspondingly, these areas have become backwater, ignored, leapt over.&lt;br /&gt;
Subjective contours, however, remain as vivid as ever, even more so.&lt;br /&gt;
Everyday, our visual system makes countless visual inferences as to the layout of the world surfaces and objects.  What’s remarkable is that subjective contours  visibly reveal these inferences.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 24 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aniruddha Das&lt;br /&gt;
* Affiliation: Columbia University&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Elad Schneidman &lt;br /&gt;
* Affiliation: Department of Neurobiology, Weizmann Institute of Science&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Sparse high order interaction networks underlie learnable neural population codes&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Feb 2012 (at noon as usual)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Heather Read&lt;br /&gt;
* Affiliation: U. Connecticut&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &amp;quot;Transformation of sparse temporal coding from auditory colliculus and cortex&amp;quot;&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Mar 2012 (note: Thurs)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Daniel Zoran&lt;br /&gt;
* Affiliation: Hebrew University, Jerusalem&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sivak&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ivan Schwab&lt;br /&gt;
* Affiliation: UC Davis&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Evolution&#039;s Witness: How Eyes Evolved&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sussillo&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 April 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kristofer Bouchard&lt;br /&gt;
* Affiliation: UCSF&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Cortical Foundations of Human Speech Production&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 May 2012&#039;&#039;&#039; (rescheduled from April 11)&lt;br /&gt;
* Speaker: Logan Grosenick&lt;br /&gt;
* Affiliation: Stanford, Deisseroth &amp;amp; Suppes Labs&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Acquisition, creation, &amp;amp; analysis of 4D light fields with applications to calcium imaging &amp;amp; optogenetics&lt;br /&gt;
* Abstract: In Light Field Microscopy (LFM), images can be computationally refocused after they are captured [1]. This permits acquiring focal stacks and reconstructing volumes from a single camera frame. In Light Field Illumination (LFI), the same ideas can be used to create an illumination system that can deliver focused light to any position in a volume without moving optics, and these two devices (LFM/LFI) can be used together in the same system [2]. So far, these imaging and illumination systems have largely been used independently in proof-of-concept experiments [1,2]. In this talk I will discuss applications of a combined scanless volumetric imaging and volumetric illumination system applied to 4D calcium imaging and photostimulation of neurons in vivo and in vitro. The volumes resulting from these methods are large (&amp;gt;500,000 voxels per time point), collected at 10-100 frames per second, and highly correlated in space and time. Analyzing such data has required the development and application of machine learning methods appropriate to large, sparse, nonnegative data, as well as the estimation of neural graphical models from calcium transients. This talk will cover the reconstruction and creation of volumes in a microscope using Light Fields [1,2], and the current state-of-the-art for analyzing these large volumes in the context of calcium imaging and optogenetics. &lt;br /&gt;
&lt;br /&gt;
[1] M. Levoy, R. Ng, A. Adams, M. Footer, and M. Horowitz. Light Field Microscopy. ACM Transactions on Graphics 25(3), Proceedings of SIGGRAPH 2006.&lt;br /&gt;
[2] M. Levoy, Z. Zhang, and I. McDowall. Recording and controlling the 4D light field in a microscope. Journal of Microscopy, Volume 235, Part 2, 2009, pp. 144-162. Cover article.&lt;br /&gt;
&lt;br /&gt;
BIO: Logan received bachelors degrees with honors in Biology and Psychology from Stanford, and a Masters in Statistics from Stanford. He is a Ph.D. candidate in the Neurosciences Program working in the labs of Karl Deisseroth and Patrick Suppes, and a trainee at the Stanford Center for Mind, Brain, and Computation. He is interested in developing and applying novel computational imaging and machine learning techniques in order to observe, control, and understand neuronal circuit dynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 June 2012&#039;&#039;&#039; (Thursday)&lt;br /&gt;
* Speaker:  Mitya Chklovskii&lt;br /&gt;
* Affiliation: janelia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jerry Feldman&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Lucas Theis&lt;br /&gt;
* Affiliation: Matthias Bethge lab, Werner Reichardt Centre for Integrative Neuroscience, Tübingen&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Hierarchical models of natural images&lt;br /&gt;
* Abstract: Probabilistic models of natural images have been used to solve a variety of computer vision tasks as well as a means to better understand the computations performed by the visual system in the brain. A lot of theoretical considerations and biological observations point to the fact that natural image models should be hierarchically organized, yet to date, the best known models are still based on what is better described as shallow representations. In this talk, I will present two image models. One is based on the idea of Gaussianization for greedily constructing hierarchical generative models. I will show that when combined with independent subspace analysis, it is able to compete with the state of the art for modeling image patches. The other model combines mixtures of Gaussian scale mixtures with a directed graphical model and multiscale image representations and is able to generate highly structured images of arbitrary size. Evaluating the model&#039;s likelihood and comparing it to a large number of other image models shows that it might well be the best model for natural images yet.&lt;br /&gt;
&lt;br /&gt;
(joint work with Reshad Hosseini and Matthias Bethge)&lt;br /&gt;
&lt;br /&gt;
=== 2010/11 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;02 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Johannes Burge&lt;br /&gt;
* Affiliation: University of Texas at Austin&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tobi Szuts&lt;br /&gt;
* Affiliation: Meister Lab/ Harvard U.&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Wireless recording of neural activity in the visual cortex of a freely moving rat.&lt;br /&gt;
* Abstract: Conventional neural recording systems restrict behavioral experiments to a flat indoor environment compatible with the cable that tethers the subject to the recording instruments. To overcome these constraints, we developed a wireless multi-channel system for recording neural signals from a freely moving animal the size of a rat or larger. The device takes up to 64 voltage signals from implanted electrodes, samples each at 20 kHz, time-division multiplexes them onto a single output line, and transmits that output by radio frequency to a receiver and recording computer up to &amp;gt;60 m away. The system introduces less than 4 ?V RMS of electrode-referred noise, comparable to wired recording systems and considerably less than biological noise. The system has greater channel count or transmission distance than existing telemetry systems. The wireless system has been used to record from the visual cortex of a rat during unconstrained conditions. Outdoor recordings show V1 activity is modulated by nest-building activity. During unguided behavior indoors, neurons responded rapidly and consistently to changes in light level, suppressive effects were prominent in response to an illuminant transition, and firing rate was strongly modulated by locomotion. Neural firing in the visual cortex is relatively sparse and moderate correlations are observed over large distances, suggesting that synchrony is driven by global processes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vikash Gilja&lt;br /&gt;
* Affiliation: Stanford University&lt;br /&gt;
* Host: Charles&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Towards Clinically Viable Neural Prosthetic Systems.&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Oct 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alexandre Francois&lt;br /&gt;
* Affiliation: USC&lt;br /&gt;
* Host: &lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eric Jonas and Vikash Mansinghka&lt;br /&gt;
* Affiliation:  Navia Systems&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Natively Probabilistic Computation: Principles, Artifacts, Architectures and Applications&lt;br /&gt;
* Abstract: Complex probabilistic models and Bayesian inference are becoming&lt;br /&gt;
increasingly critical across science and industry, especially in&lt;br /&gt;
large-scale data analysis. They are also central to our best&lt;br /&gt;
computational accounts of human cognition, perception and action.&lt;br /&gt;
However, all these efforts struggle with the infamous curse of&lt;br /&gt;
dimensionality. Rich probabilistic models can seem hard to write and&lt;br /&gt;
even harder to solve, as specifying and calculating probabilities&lt;br /&gt;
often appears to require the manipulation of exponentially (and&lt;br /&gt;
sometimes infinitely) large tables of numbers.&lt;br /&gt;
&lt;br /&gt;
We argue that these difficulties reflect a basic mismatch between the&lt;br /&gt;
needs of probabilistic reasoning and the deterministic, functional&lt;br /&gt;
orientation of our current hardware, programming languages and CS&lt;br /&gt;
theory. To mitigate these issues, we have been developing a stack of&lt;br /&gt;
abstractions for natively probabilistic computation, based around&lt;br /&gt;
stochastic simulators (or samplers) for distributions, rather than&lt;br /&gt;
evaluators for deterministic functions. Ultimately, our aim is to&lt;br /&gt;
produce a model of computation and the associated hardware and&lt;br /&gt;
programming tools that are as suited for uncertain inference and&lt;br /&gt;
decision-making as our current computers are for precise arithmetic.&lt;br /&gt;
&lt;br /&gt;
In this talk, we will give an overview of the entire stack of&lt;br /&gt;
abstractions supporting natively probabilistic computation, with&lt;br /&gt;
technical detail on several hardware and software artifacts we have&lt;br /&gt;
implemented so far. we will also touch on some new theoretical results&lt;br /&gt;
regarding the computational complexity of probabilistic programs.&lt;br /&gt;
Throughout, we will motivate and connect this work to some current&lt;br /&gt;
applications in biomedical data analysis and computer vision, as well&lt;br /&gt;
as potential hypotheses regarding the implementation of probabilistic&lt;br /&gt;
computation in the brain.&lt;br /&gt;
&lt;br /&gt;
This talk includes joint work with Keith Bonawitz, Beau Cronin,&lt;br /&gt;
Cameron Freer, Daniel Roy and Joshua Tenenbaum.&lt;br /&gt;
&lt;br /&gt;
BRIEF BIOGRAPHY&lt;br /&gt;
&lt;br /&gt;
Vikash Mansinghka is a co-founder and the CTO of Navia Systems, a&lt;br /&gt;
venture-funded startup company building natively probabilistic&lt;br /&gt;
computing machines. He spent 10 years at MIT, eventually earning an&lt;br /&gt;
SB. in Mathematics, an SB. in Computer Science, an MEng in Computer&lt;br /&gt;
Science, and a PhD in Computation. He held graduate fellowships from&lt;br /&gt;
the NSF and MIT&#039;s Lincoln Laboratories, and his PhD dissertation won&lt;br /&gt;
the 2009 MIT George M. Sprowls award for best dissertation in computer&lt;br /&gt;
science. He currently serves on DARPA&#039;s Information Science and&lt;br /&gt;
Technology (ISAT) Study Group.&lt;br /&gt;
&lt;br /&gt;
Eric Jonas is a co-founder of Navia Systems, responsible for in-house&lt;br /&gt;
accelerated inference research and development. He spent ten years at&lt;br /&gt;
MIT, where he earned SB degrees in electrical engineering and computer&lt;br /&gt;
science and neurobiology, an MEng in EECS, with a neurobiology PhD&lt;br /&gt;
expected really soon.  He’s passionate about biological applications&lt;br /&gt;
of probabilistic reasoning and hopes to use Navia’s capabilities to&lt;br /&gt;
combine data from biological science, clinical histories, and patient&lt;br /&gt;
outcomes into seamless models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Patrick Ruther&lt;br /&gt;
* Affiliation:  Imtek, University of Freiburg&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aurel Lazar&lt;br /&gt;
* Affiliation: Department of Electrical Engineering, Columbia University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Encoding Visual Stimuli with a Population of Hodgkin-Huxley Neurons&lt;br /&gt;
* Abstract: We first present a general framework for the reconstruction of natural video&lt;br /&gt;
scenes encoded with a population of spiking neural circuits with random thresholds.&lt;br /&gt;
The visual encoding system consists of a bank of filters, modeling the visual&lt;br /&gt;
receptive fields, in cascade with a population of neural circuits, modeling encoding&lt;br /&gt;
with spikes in the early visual system.&lt;br /&gt;
The neuron models considered include integrate-and-fire neurons and ON-OFF&lt;br /&gt;
neuron pairs with threshold-and-fire spiking mechanisms. All thresholds are assumed&lt;br /&gt;
to be random. We show that for both time-varying and space-time-varying stimuli neural&lt;br /&gt;
spike encoding is akin to taking noisy measurements on the stimulus.&lt;br /&gt;
Second, we formulate the reconstruction problem as the minimization of a&lt;br /&gt;
suitable cost functional in a finite-dimensional vector space and provide an explicit&lt;br /&gt;
algorithm for stimulus recovery. We also present a general solution using the theory of&lt;br /&gt;
smoothing splines in Reproducing Kernel Hilbert Spaces. We provide examples of both&lt;br /&gt;
synthetic video as well as for natural scenes and show that the quality of the&lt;br /&gt;
reconstruction degrades gracefully as the threshold variability of the neurons increases.&lt;br /&gt;
Third, we demonstrate a number of simple operations on the original visual stimulus&lt;br /&gt;
including translations, rotations and zooming. All these operations are natively executed&lt;br /&gt;
in the spike domain. The processed spike trains are decoded for the faithful recovery&lt;br /&gt;
of the stimulus and its transformations.&lt;br /&gt;
Finally, we extend the above results to neural encoding circuits built with Hodking-Huxley&lt;br /&gt;
neurons.&lt;br /&gt;
References:&lt;br /&gt;
Aurel A. Lazar, Eftychios A. Pnevmatikakis and Yiyin Zhou,&lt;br /&gt;
Encoding Natural Scenes with Neural Circuits with Random Thresholds, Vision Research, 2010,&lt;br /&gt;
Special Issue on Mathematical Models of Visual Coding,&lt;br /&gt;
http://dx.doi.org/10.1016/j.visres.2010.03.015&lt;br /&gt;
Aurel A. Lazar,&lt;br /&gt;
Population Encoding with Hodgkin-Huxley Neurons,&lt;br /&gt;
IEEE Transactions on Information Theory, Volume 56, Number 2, pp. 821-837, February, 2010,&lt;br /&gt;
Special Issue on Molecular Biology and Neuroscience,&lt;br /&gt;
http://dx.doi.org/10.1109/TIT.2009.2037040&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Nov 2010&#039;&#039;&#039; (UCB holiday)&lt;br /&gt;
* Speaker: Martha Nari Havenith&lt;br /&gt;
* Affiliation: UCL&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Finding spike timing in the visual cortex - Oscillations as the internal clock of vision?&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2010&#039;&#039;&#039;  (note: on Friday because of SFN)&lt;br /&gt;
* Speaker: Dan Butts&lt;br /&gt;
* Affiliation: UMD&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Common roles of inhibition in visual and auditory processing.&lt;br /&gt;
* Abstract: The role of inhibition in sensory processing is often obscured in extracellular recordings, because the absence of a neuronal response associated with inhibition might also be explained by a simple lack of excitation. However, increasingly, evidence from intracellular recordings demonstrates important roles of inhibition in shaping the stimulus selectivity of sensory neurons in both the visual and auditory systems. We have developed a nonlinear modeling approach that can identify putative excitatory and inhibitory inputs to a neuron using standard extracellular recordings, and have applied these techniques to understand the role of inhibition in shaping sensory processing in visual and auditory areas.  In pre-cortical visual areas (retina and LGN), we find that inhibition likely plays a role in generating temporally precise responses, and mediates adaptation to changing contrast. In an auditory pre-cortical area (inferior colliculus) identified inhibition has nearly identical appearance and functions in temporal processing and adaptation. Thus, we predict common roles of inhibition in these sensory areas, and more generally demonstrate general methods for characterizing the nonlinear computations that comprise sensory processing.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;24 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eizaburo Doi&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Nov 2010 - informal talk&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eero Lehtonen&lt;br /&gt;
* Affiliation: UTU Finland&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Memristors&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gadi Geiger&lt;br /&gt;
* Affiliation: MIT&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Visual and Auditory Perceptual Modes that Characterize Dyslexics&lt;br /&gt;
* Abstract: I will describe how dyslexics’ visual and auditory perception is wider and more diffuse than that of typical readers. This suggests wider neural tuning in dyslexics. In addition I will describe how this processing relates to difficulties in reading. Strengthening the argument and more so helping dyslexics I will describe a regimen of practice that results in improved reading in dyslexics while narrowing perception.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;13 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jorg Lueke&lt;br /&gt;
* Affiliation: FIAS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Linear and Non-linear Approaches to Component Extraction and Their Applications to Visual Data&lt;br /&gt;
* Abstract:  In the nervous system of humans and animals, sensory data are represented as combinations of elementary data components. While for data such as sound waveforms the elementary components combine linearly, other data can better be modeled by non-linear forms of component superpositions. I motivate and discuss two models with binary latent variables: one using standard linear superpositions of basis functions and one using non-linear superpositions.  Crucial for the applicability of both models are efficient learning procedures. I briefly introduce a novel training scheme (ET) and show how it can be applied to probabilistic generative models. For linear and non-linear models the scheme efficiently infers the basis functions as well as the level of sparseness and data noise.  In large-scale applications to image patches, we show results on the statistics of inferred model parameters. Differences between the linear and non-linear models are discussed, and both models are compared to results of standard approaches in the literature and to experimental findings.  Finally, I briefly discuss learning in a recent model that takes explicit component occlusions into account.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Claudia Clopath&lt;br /&gt;
* Affiliation: Universite Paris Decartes&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Siwei Lyu&lt;br /&gt;
* Affiliation: Computer Science Department, University at Albany, SUNY&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: Divisive Normalization as an Efficient Coding Transform: Justification and Evaluation&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  David Field (informal talk)&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;25 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ruth Rosenholtz&lt;br /&gt;
* Affiliation: Dept. of Brain &amp;amp; Cognitive Sciences, Computer Science and AI Lab, MIT&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: What your visual system sees where you are not looking&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ernst Niebur&lt;br /&gt;
* Affiliation: Johns Hopkins U&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vladimir Itskov&lt;br /&gt;
* Affiliation: University of Nebraska-Lincoln&lt;br /&gt;
* Host: Chris&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruce Cumming&lt;br /&gt;
* Affiliation: National Institutes of Health&lt;br /&gt;
* Host: Ivana&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 April 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Lubomir Bourdev&lt;br /&gt;
* Affiliation: Computer Science, UC Berkeley&lt;br /&gt;
* Host:Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &amp;quot;Poselets and Their Applications in High-Level Computer Vision Problems&amp;quot;&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2011 (note: Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Jack Culpepper&lt;br /&gt;
* Affiliation: Redwood Center/EECS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title:  TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 May 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Ian Stevenson&lt;br /&gt;
* Affiliation:  Northwestern University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Explaining tuning curves by estimating interactions between neurons&lt;br /&gt;
* Abstract: One of the central tenets of systems neuroscience is that tuning curves are a byproduct of the interactions between neurons. Using multi-electrode recordings and recently developed inference techniques we can begin to examine this idea in detail and study how well we can explain the functional properties of neurons using the activity of other simultaneously recorded neurons. Here we examine datasets from 6 different brain areas recorded during typical sensorimotor tasks each with ~100 simultaneously recorded neurons. Using these datasets we measured the extent to which interactions between neurons can explain the tuning properties of individual neurons. We found that, in almost all areas, modeling interactions between 30-50 neurons allows more accurate spike prediction than tuning curves. This suggests that tuning can, in some sense, be explained by interactions between neurons in a variety of brain areas, even when recordings consist of relatively small numbers of neurons.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Michael Oliver&lt;br /&gt;
* Affiliation: Gallant lab&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alyson Fletcher&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: Generalized Approximate Message Passing for Neural Receptive Field Estimation and Connectivity&lt;br /&gt;
* Abstract:  Fundamental to understanding sensory encoding and connectivity of neurons are effective tools for developing and validating complex mathematical models from experimental data.  In this talk, I present a graphical models approach to the problems of neural connectivity reconstruction under multi-neuron excitation and to receptive field estimation of sensory neurons in response to stimuli.  I describe a new class of Generalized Approximate Message Passing (GAMP) algorithms for a general class of inference problems on graphical models based Gaussian approximations of loopy belief propagation.  The GAMP framework is extremely general, provides a systematic procedure for incorporating a rich class of nonlinearities, and is computationally tractable with large amounts of data.  In addition, for both the connectivity reconstruction and parameter estimation problems, I show that GAMP-based estimation can naturally incorporate sparsity constraints in the model that arise from the fact that only a small fraction of the potential inputs have any influence on the output of a particular neuron.  A simulation of reconstruction of cortical neural mapping under multi-neuron excitation shows that GAMP offers  improvement over previous compressed sensing methods.  The GAMP method is also validated on estimation of linear nonlinear Poisson (LNP) cascade models for neural responses of salamander retinal ganglion cells.&lt;br /&gt;
&lt;br /&gt;
=== 2009/10 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2 September 2009&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Keith Godfrey&lt;br /&gt;
* Affiliation: University of Cambridge&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anita Schmid&lt;br /&gt;
* Affiliation: Cornell University&lt;br /&gt;
* Host: Kilian&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Subpopulations of neurons in visual area V2 perform differentiation and integration operations in space and time&lt;br /&gt;
* Abstract: The interconnected areas of the visual system work together to find object boundaries in visual scenes. Primary visual cortex (V1) mainly extracts oriented luminance boundaries, while secondary visual cortex (V2) also detects boundaries defined by differences in texture. How the outputs of V1 neurons are combined to allow for the extraction of these more complex boundaries in V2 is as of yet unclear. To address this question, we probed the processing of orientation signals in single neurons in V1 and V2, focusing on response dynamics of neurons to patches of oriented gratings and to combinations of gratings in neighboring patches and sequential time frames. We found two kinds of response dynamics in V2, both of which are different from those of V1 neurons. While V1 neurons in general prefer one orientation, one subpopulation of V2 neurons (“transient”) shows a temporally dynamic preference, resulting in a preference for changes in orientation. The second subpopulation of V2 neurons (“sustained”) responds similarly to V1 neurons, but with a delay. The dynamics of nonlinear responses to combinations of gratings reinforce these distinctions: the dynamics enhance the preference of V1 neurons for continuous orientations, and enhance the preference of V2 transient neurons for discontinuous ones. We propose that transient neurons in V2 perform a differentiation operation on the V1 input, both spatially and temporally, while the sustained neurons perform an integration operation. We show that a simple feedforward network with delayed inhibition can account for the temporal but not for the spatial differentiation operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Andrea Benucci&lt;br /&gt;
* Affiliation: Institute of Ophthalmology, University College London&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Stimulus dependence of the functional connectivity between neurons in primary visual cortex&lt;br /&gt;
* Abstract:  It is known that visual stimuli are encoded by the concerted activity of large populations of neurons in visual cortical areas. However, it is only recently that recording techniques have been made available to study such activations from large ensembles of neurons simultaneously, with millisecond temporal precision and tens of microns spatial resolution. I will present data from voltage-sensitive dye (VSD) imaging and multi-electrode recordings (“Utah” probes) from the primary visual cortex of the cat (V1).  I will discuss the relationship between two fundamental cortical maps of the visual system: the map of retinotopy and the map of orientation. Using spatially localized and full-field oriented stimuli, we studied the functional interdependency of these maps. I will describe traveling and standing waves of cortical activity and their key role as a dynamical substrate for the spatio-temporal coding of visual information.  I will further discuss the properties of the spatio-temporal code in the context of continuous visual stimulation.  While recording population responses to a sequence of oriented stimuli, we asked how responses to individual stimuli summate over time. We found that such rules are mostly linear, supporting the idea that spatial and temporal codes in area V1 operate largely independently. However, these linear rules of summation fail when the visual drive is removed, suggesting that the visual cortex can readily switch between a dynamical regime where either feed-forward or intra-cortical inputs determine the response properties of the network.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 November 2009 (Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Song-Chun Zhu&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 November 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dan Graham&lt;br /&gt;
* Affiliation: Dept. of Mathematics, Dartmouth College&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: The Packet-Switching Brain: A Hypothesis&lt;br /&gt;
* Abstract: Despite great advances in our understanding of neural responses to natural stimuli, the basic structure of the neural code remains elusive. In this talk, I will describe a novel hypothesis regarding the fundamental structure of neural coding in mammals. In particular, I propose that an internet-like routing architecture (specifically packet-switching) underlies neocortical processing, and I propose means of testing this hypothesis via neural response sparseness measurements. I will synthesize a host of suggestive evidence that supports this notion and will, more generally, argue in favor of a large scale shift from the now dominant “computer metaphor,” to the “internet metaphor.” This shift is intended to spur new thinking with regard to neural coding, and its main contribution is to privilege communication over computation as the prime goal of neural systems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 December 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pietro Berkes&lt;br /&gt;
* Affiliation: Volen Center for Complex Systems, Brandeis University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Generative models of vision: from sparse coding toward structured models&lt;br /&gt;
* Abstract: From a computational perspective, one can think of visual perception as the problem of analyzing the light patterns detected by the retina to recover their external causes.  This process requires combining the incoming sensory evidence with internal prior knowledge about general properties of visual elements and the way they interact, and can be formalized in a class of models known as causal generative models.  In the first part of the talk, I will discuss the first and most established generative model, namely the sparse coding model. Sparse coding has been largely successful in showing how the main characteristics of simple cells receptive fields can be accounted for based uniquely on the statistics of natural images. I will briefly review the evidence supporting this model, and contrast it with recent data from the primary visual cortex of ferrets and rats showing that the sparseness of neural activity over development and anesthesia seems to follow trends opposite to those predicted by sparse coding.  In the second part, I will argue that the generative point of view calls for models of natural images that take into account more of the structure of the visual environment. I will present a model that takes a first step in this direction by incorporating the fundamental distinction between identity and attributes of visual elements. After learning, the model mirrors several aspects of the organization of V1, and results in a novel interpretation of complex and simple cells as parallel population of cells, coding for different aspects of the visual input. Further steps toward more structured generative models might thus lead to the development of a more comprehensive account of visual processing in the visual cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: U of Hawaii&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tom Dean&lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Accelerating Computer Vision and Machine Learning Algorithms with Graphics Processors&lt;br /&gt;
* Abstract: Graphics processors (GPUs) and massively-multi-core architectures are becoming more powerful, less costly and more energy efficient, and the related programming language issues are beginning to sort themselves out. That said most researchers don’t want to be writing code that depends on any particular architecture or parallel programming model. Linear algebra, Fourier analysis and image processing have standard libraries that are being ported to exploit SIMD parallelism in GPUs. We can depend on the massively-multiple-core machines du jour to support these libraries and on the high-performance-computing (HPC) community to do the porting for us or with us. These libraries can significantly accelerate important applications in image processing, data analysis and information retrieval. We can develop APIs and the necessary run-time support so that code relying on these libraries will run on any machine in a cluster of computers but exploit GPUs whenever available. This strategy allows us to move toward hybrid computing models that enable a wider range of opportunities for parallelism without requiring the special training of programmers or the disadvantages of developing code that depends on specialized hardware or programming models. This talk summarizes the state of the art in massively-multi-core architectures, presents experimental results that demonstrate the potential for significant performance gains in the two general areas of image processing and machine learning, provides examples of the proposed programming interface, and some more detailed experimental results on one particular problem involving video-content analysis.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Philiponna&lt;br /&gt;
* Affiliation: Paris&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;24 Feburary 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gordon Pipa&lt;br /&gt;
* Affiliation: U Osnabrueck/MPI Frankfurt&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gaute Einevoll&lt;br /&gt;
* Affiliation: UMB, Norway&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Harvey Swadlow&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alan Yuille &lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed (for 1pm)&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dharmendra Modha - cancelled&lt;br /&gt;
* Affiliation: IBM&lt;br /&gt;
* Host:Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Zipser&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: Brytes 2:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
Brytes are little brains that can be assembled into larger, smarter brains. In my first talk I presented a biologically plausible, computationally tractable model of brytes and described how they can be used as subunits to build brains with interesting behaviors.&lt;br /&gt;
&lt;br /&gt;
In this talk I will first show how large numbers of brytes can cooperate to perform complicated actions such as arm and hand manipulations in the presence of obstacles. Then I describe a strategy for a higher level of control that informs each bryte what role it should play in accomplishing the current task. These results could have considerable significance for understanding the brain and possibly be applicable to robotics and BMI.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Frank Werblin  (Redwood group meeting - internal only)&lt;br /&gt;
* Affiliation:  Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anna Judith&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little (Redwood Lab Meeting - internal only)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=7245</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=7245"/>
		<updated>2014-01-19T00:46:51Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Tentative / Confirmed Speakers */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Instructions ==&lt;br /&gt;
&lt;br /&gt;
# Check the internal calendar (here) for a free seminar slot. Seminars are usually Wednesdays at noon, but it is flexible in case there is a day that works better for the speaker.  However, it is usually best to avoid booking multiple speakers in the same week - it leads to &amp;quot;seminar burnout&amp;quot; and reduced attendance.  But use your own judgement here - if its a good opportunity and that&#039;s the only time that works then go ahead with it.&lt;br /&gt;
# Once you have proposed a date to a speaker, fill in the speaker information under the appropriate date (or change if necessary).  Use the status field to indicate whether the date is tentative or confirmed. Please also include your name as &#039;&#039;host&#039;&#039;  in case somebody wants to contact you.&lt;br /&gt;
# Once the invitation is confirmed with the speaker, change the status field to &#039;confirmed&#039;. Notify me [mailto:baolshausen@berkeley.edu] that we have a confirmed speaker so that I can update the public web page. Please include a title and abstract.&lt;br /&gt;
# Natalie (HWNI) checks our web page regularly and will send out an announcement a week before and also include with the weekly neuro announcements, but if you don&#039;t get it confirmed until the last minute then make sure to email Natalie  [mailto:nrterranova@berkeley.edu] as well to give her a heads up so she knows to send out an announcement in time.&lt;br /&gt;
# If the speaker needs accommodations you should contact Natalie [mailto:nrterranova@berkeley.edu] to reserve a room at the faculty club. Tell her its for a Redwood speaker so she knows how to bill it.&lt;br /&gt;
# During the visit you will need to look after the visitor, schedule visits with other labs, make plans for lunch, dinner, etc., and introduce at the seminar (don&#039;t ask Bruno to do this at the last moment).  Save receipts for any meals you paid for.&lt;br /&gt;
# After the seminar and before the speaker leaves, make sure to get their address and info for reimbursing travel expenses (receipts) and hand this over to Natalie, or if they prefer they can send these to Natalie after they get home.  Natalie can also help you with getting reimbursed for any expenses you incurred for meals and entertainment.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Thomas Martinetz&lt;br /&gt;
* Affiliation: Univ Luebeck&lt;br /&gt;
* Host: Bruno/Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Klein&lt;br /&gt;
* Affiliation: Audience&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Feb 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Sutskever &lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Zayd&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Portera-Cailliau&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dean Buonomano&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Robert G. Smith&lt;br /&gt;
* Affiliation: University of Pennsylvania&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Role of Dendritic Computation in the Direction-Selective Circuit of Retina&lt;br /&gt;
* Abstract: The retina utilizes a variety of signal processing mechanisms to compute direction from image motion. The computation is accomplished by a circuit that includes starburst amacrine cells (SBACs), which are GABAergic neurons presynaptic to direction-selective ganglion cells (DSGCs). SBACs are symmetric neurons with several branched dendrites radiating out from the soma. When a stimulus moving back and forth along a SBAC dendrite sequentially activates synaptic inputs, larger post-synaptic potentials (PSPs) are produced in the dendritic tips when the stimulus moves outwards from the soma. The directional difference in EPSP amplitude is further amplified near the dendritic tips by voltage-gated channels to produce directional release of GABA. Reciprocal inhibition between adjacent SBACs may also amplify directional release. Directional signals in the independent SBAC branches are preserved because each dendrite makes selective contacts only with DSGCs of the appropriate preferred-direction. Directional signals are further enhanced within the dendritic arbor of the DSGC, which essentially comprises an array of distinct dendritic compartments. Each of these dendritic compartments locally sum excitatory and inhibitory inputs, amplifies them with voltage-gated channels, and generates spikes that propagate to the axon via the soma. Overall, the computation of direction in the retina is performed by several local dendritic mechanisms both presynaptic and postsynaptic, with the result that directional responses are robust over a broad range of stimuli.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jochen Braun&lt;br /&gt;
* Affiliation: Otto-von-Guericke University, Magdeburg&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Dynamics of visual perception and collective neural activity&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Guiseppe Vitiello&lt;br /&gt;
* Affiliation: University of Salerno&lt;br /&gt;
* Host: Fritz/Walter Freeman&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 May 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Allie Fletcher&lt;br /&gt;
* Affiliation: UC Santa Cruz&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: in progress&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kanaka Rajan&lt;br /&gt;
* Affiliation: Princeton University&lt;br /&gt;
* Host: Jeff Teeters/Sarah Marzen&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Generation of sequences through reconfiguration of ongoing activity in neural networks: A model of choice-specific cortical dynamics in virtual navigation&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
== Previous Seminars ==&lt;br /&gt;
&lt;br /&gt;
=== 2013/14 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ekaterina Brocke&lt;br /&gt;
* Affiliation: KTH University, Stockholm, Sweden&lt;br /&gt;
* Host: Tony&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Multiscale modeling in Neuroscience: first steps towards multiscale co-simulation tool development.&lt;br /&gt;
* Abstract: Multiscale modeling/simulations attracts an increasing number of neuroscientists to study how different levels of organization (networks of neurons, cellular/subcellular levels) interact with each other across multiple scales, space and time, to mediate different brain functions. Different scales are usually described by different physical and mathematical formalisms thus making it non trivial to perform the integration. In this talk, I will discuss key phenomena in Neuroscience that can be addressed using subcellular/cellular models, possible approaches to perform multiscale simulations in particular a co-simulation method. I will also introduce several multiscale &amp;quot;toy&amp;quot; models of cellular/subcellular levels that were developed with the aim to understand numerical and technical problems which might appear during the co-simulation. And finally, the first steps made towards multiscale co-simulation tool development will be presented during the talk.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Oct 2013 - note: 4:00&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mitya Chkolovskii&lt;br /&gt;
* Affiliation: HHMI/Janelia Farm&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Nemanman&lt;br /&gt;
* Affiliation: Emory University, Departments of Physics and Biology&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Large N in neural data -- expecting the unexpected.&lt;br /&gt;
* Abstract: Recently it has become possible to directly measure simultaneous collective states of many biological components, such as neural activities, genetic sequences, or gene expression profiles. These data are revealing striking results, suggesting, for example, that biological systems are tuned to criticality, and that effective models of these systems based on only pairwise interactions among constitutive components provide surprisingly good fits to the data. We will explore a handful of simplified theoretical models, largely focusing on statistical mechanics of Ising spins, that suggest plausible explanations for these observations. Specifically, I will argue that, at least in certain contexts, these intriguing observations should be expected in multivariate interacting data in the thermodynamic limit of many interacting components.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Oriol Vinyals&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno/Brian&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Beyond Deep Learning: Scalable Methods and Models for Learning&lt;br /&gt;
* Abstract: In this talk I will briefly describe several techniques I explored in my thesis that improve how to efficiently model signal representations and learn useful information from them. The building block of my dissertation is based on machine learning approaches to classification, where a (typically non-linear) function is learned from labeled examples to map from signals to some useful information (e.g. an object class present an image, or a word present in an acoustic signal). One of the motivating factors of my work has been advances in neural networks in deep architectures (which has led to the terminology &amp;quot;deep learning&amp;quot;), and that has shown state-of-the-art performance in acoustic modeling and object recognition -- the main focus of this thesis. In my work, I have contributed to both the learning (or training) of such architectures through faster and robust optimization techniques, and also to the simplification of the deep architecture model to an approach that is simple to optimize. Furthermore, I derived a theoretical bound showing a fundamental limitation of shallow architectures based on sparse coding (which can be seen as a one hidden layer neural network), thus justifying the need for deeper architectures, while also empirically verifying these architectural choices on speech recognition. Many of my contributions have been used in a wide variety of applications, products and datasets as a result of many collaborations within ICSI and Berkeley, but also at Microsoft Research and Google Research.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 Nov 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Garrett T. Kenyon&lt;br /&gt;
* Affiliation: Los Alamos National Laboratory, The New Mexico Consortium&lt;br /&gt;
* Host: Dylan Paiton&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Using Locally Competitive Algorithms to Model Top-Down and Lateral Interactions&lt;br /&gt;
* Abstract: Cortical connections consist of feedforward, feedback and lateral pathways.  Infragranular layers project down the cortical hierarchy to both supra- and infragranular layers at the previous processing level, while the neurons in supragranular layers are linked by extensive long-range lateral projections that cross multiple cortical columns. However, most functional models of visual cortex only account for feedforward connections. Additionally, most models of visual cortex fail to account both for the thalamic projections to non-striate areas and the reciprocal connections from extrastriate areas back to the thalamus. In this talk, I will describe how a modified Locally Competitive Algorithm (LCA; Rozell et al, Neural Comp, 2008) can be used as a unifying framework for exploring the role of top-down and lateral cortical pathways within the context of deep, sparse, generative models.  I will also describe an open source software tool called PetaVision that can be used to implement and execute hierarchical LCA-based models on multi-core, multi-node computer platforms without requiring specific knowledge of parallel-programming constructs.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Nov 2013 (note: Thursday), ***12:30pm*** &#039;&#039;&#039;&lt;br /&gt;
* Speaker: Geoffrey J Goodhill&lt;br /&gt;
* Affiliation: Queensland Brain Institute and School of Mathematics and Physics, The University of Queensland, Australia&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Computational principles of neural wiring development&lt;br /&gt;
* Abstract: Brain function depends on precise patterns of neural wiring. An axon navigating to its target must make guidance decisions based on noisy information from molecular cues in its environment. I will describe a combination of experimental and computational work showing that (1) axons may act as ideal observers when sensing chemotactic gradients, (2) the complex influence of calcium and cAMP levels on guidance decisions can be predicted mathematically, (3) the morphology of growth cones at the axonal tip can be understood in terms of just a few eigenshapes, and remarkably these shapes oscillate in time with periods ranging from minutes to hours. Together this work may shed light on how neural wiring goes wrong in some developmental brain disorders, and how best to promote appropriate regrowth of axons after injury.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Zhenwen Dai&lt;br /&gt;
* Affiliation: FIAS, Goethe University Frankfurt, Germany.&lt;br /&gt;
* Host: Georgios Exarchakis&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: What Are the Invariant Occlusive Components of Image Patches? A Probabilistic Generative Approach &lt;br /&gt;
* Abstract: We study optimal image encoding based on a generative approach with non-linear feature combinations and explicit position encoding. By far most approaches to unsupervised learning of visual features, such as sparse coding or ICA, account for translations by representing the same features at different positions. Some earlier models used a separate encoding of features and their positions to facilitate invariant data encoding and recognition. All probabilistic generative models with explicit position encoding have so far assumed a linear superposition of components to encode image patches. Here, we for the first time apply a model with non-linear feature superposition and explicit position encoding for patches. By avoiding linear superpositions, the studied model represents a closer match to component occlusions which are ubiquitous in natural images. In order to account for occlusions, the non-linear model encodes patches qualitatively very different from linear models by using component representations separated into mask and feature parameters. We first investigated encodings learned by the model using artificial data with mutually occluding components. We find that the model extracts the components, and that it can correctly identify the occlusive components with the hidden variables of the model. On natural image patches, the model learns component masks and features for typical image components. By using reverse correlation, we estimate the receptive fields associated with the model’s hidden units. We find many Gabor-like or globular receptive fields as well as fields sensitive to more complex structures. Our results show that probabilistic models that capture occlusions and invariances can be trained efficiently on image patches, and that the resulting encoding represents an alternative model for the neural encoding of images in the primary visual cortex. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kai Siedenburg&lt;br /&gt;
* Affiliation: UC Davis, Petr Janata&#039;s Lab.&lt;br /&gt;
* Host: Jesse Engel&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Characterizing Short-Term Memory for Musical Timbre&lt;br /&gt;
* Abstract: Short-term memory is a cognitive faculty central for the apprehension of music and speech. Only little is known, however, about memory for musical timbre despite its“sisterhood”with speech; after all, speech can be regarded as sequencing of vocal timbre. Past research has isolated many characteristic effects of verbal memory. Are these also in play for non-vocal timbre sequences? We studied this question by considering short-term memory for serial order. Using timbres and dissimilarity data from McAdams et al. (Psych. Research, 1995), we employed a same/different discrimination paradigm. Experiment 1 (N = 30 MU + 30 nonMU) revealed effects of sequence length and timbral dissimilarity of items, as well as an interaction of musical training and pitch variability: in contrast to musicians, non-musicians&#039; performance was impaired by simultaneous changes in pitch, compared to a constant pitch baseline. Experiment 2 (N = 22) studied whether musicians&#039; memory for timbre sequences was independent of pitch irrespective of the degree of complexity of pitch progressions. Comparing sequences with pitch changing within and across standard and comparison to a constant pitch baseline, performance was now clearly impaired for the variable pitch condition. Experiment 3 (N = 22) showed primacy and recency effects for musicians, and reproduced a positive effect of timbral heterogeneity of sequences. Our findings demonstrate the presence of hallmark effects of verbal memory such as similarity, word length, primacy/recency for the domain of non-vocal timbre, and suggest that memory for speech and non- vocal timbre sequences might to a large extent share underlying mechanisms.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Matthias Bethge&lt;br /&gt;
* Affiliation: University of Tubingen&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2012/13 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Sept 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jason Yeatman&lt;br /&gt;
* Affiliation: Department of Psychology, Stanford University&lt;br /&gt;
* Host: Bruno/Susana Chung&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: The Development of White Matter and Reading Skills&lt;br /&gt;
* Abstract: The development of cerebral white matter involves both myelination and pruning of axons, and the balance between these two processes may differ between individuals. Cross-sectional measures of white matter development mask the interplay between these active developmental processes and their connection to cognitive development.  We followed a cohort of 39 children longitudinally for three years, and measured white matter development and reading development using diffusion tensor imaging and behavioral tests. In the left arcuate and inferior longitudinal fasciculus, children with above-average reading skills initially had low fractional anisotropy (FA) with a steady increase over the 3-year period, while children with below-average reading skills had higher initial FA that declined over time. We describe a dual-process model of white matter development that balances biological processes that have opposing effects on FA, such as axonal myelination and pruning, to explain the pattern of results.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Sophie Deneve&lt;br /&gt;
* Affiliation: Laboratoire de Neurosciences cognitives, ENS-INSERM&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Balanced spiking networks can implement dynamical systems with predictive coding&lt;br /&gt;
* Abstract: Neural networks can integrate sensory information and generate continuously varying outputs, even though individual neurons communicate only with spikes---all-or-none events. Here we show how this can be done efficiently if spikes communicate &amp;quot;prediction errors&amp;quot; between neurons. We focus on the implementation of linear dynamical systems and derive a spiking network model from a single optimization principle. Our model naturally accounts for two puzzling aspects of cortex. First, it provides a rationale for the tight balance and correlations between excitation and inhibition. Second, it predicts asynchronous and irregular firing as a consequence of predictive population coding, even in the limit of vanishing noise. We show that our spiking networks have error-correcting properties that make them far more accurate and robust than comparable rate models. Our approach suggests spike times do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly under-estimated.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gert Van Dijck&lt;br /&gt;
* Affiliation: Cambridge&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: A solution to identifying neurones using extracellular activity in awake animals: a probabilistic machine-learning approach&lt;br /&gt;
* Abstract: Electrophysiological studies over the last fifty years have been hampered by the difficulty of reliably assigning signals to identified cortical neurones. Previous studies have employed a variety of measures based on spike timing or waveform characteristics to tentatively classify other neurone types (Vos et al., Eur. J. Neurosci., 1999; Prsa et al., J. Neurosci., 2009), in some cases supported by juxtacellular labelling (Simpson et al., Prog. Brain Res., 2005; Holtzman et al., J. Physiol., 2006; Barmack and Yakhnitsa, J. Neurosci., 2008; Ruigrok et al., J. Neurosci., 2011), or intracellular staining and / or assessment of membrane properties (Chadderton et al., Nature, 2004; Jorntell and Ekerot, J. Neurosci., 2006; Rancz et al., Nature, 2007). Anaesthetised animals have been widely used as they can provide a ground-truth through neuronal labelling which is much harder to achieve in awake animals where spike-derived measures tend to be relied upon (Lansink et al., Eur. J. Neurosci., 2010). Whilst spike-shapes carry potentially useful information for classifying neuronal classes, they vary with electrode type and the geometric relationship between the electrode and the spike generation zone (Van Dijck et al., Int. J. Neural Syst., 2012). Moreover, spike-shape measurement is achieved with a variety of techniques, making it difficult to compare and standardise between laboratories.In this study we build probabilistic models on the statistics derived from the spike trains of spontaneously active neurones in the cerebellum and the ventral midbrain. The mean spike frequency in combination with the log-interval-entropy (Bhumbra and Dyball, J. Physiol.-London, 2004) of the inter-spike-interval distribution yields the highest prediction accuracy. The cerebellum model consists of two sub-models: a molecular layer - Purkinje layer model and a granular layer - Purkinje layer model. The first model identifies with high accuracy (92.7 %) molecular layer interneurones and Purkinje cells, while the latter identifies with high accuracy (99.2 %) Golgi cells, granule cells, mossy fibers and Purkinje cells. Furthermore, it is shown that the model trained on anaesthetized rat and decerebrate cat data has broad applicability to other species and behavioural states: anaesthetized mice (80 %), awake rabbits (94.2 %) and awake rhesus monkeys (89 - 90 %).Recently, opto-genetics allow to obtain a ground-truth about cell classes. Using opto-genetically identified GABA-ergic and dopaminergic cells we build similar statistical models to identify these neuron types from the ventral midbrain.Hence, this illustrates that our approach will be of general use to a broad variety of laboratories.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 23 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jaimie Sleigh&lt;br /&gt;
* Affiliation: University of Auckland&lt;br /&gt;
* Host: Fritz/Andrew Szeri&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Is General Anesthesia a failure of cortical information integration&lt;br /&gt;
* Abstract: General anesthesia and natural sleep share some commonalities and some differences. Quite a lot is known about the chemical and neuronal effects of general anesthetic drugs.  There are two main groups of anesthetic drugs, which can be distinguished by their effects on the EEG. The most commonly used drugs exert a strong GABAergic action; whereas a second group is characterized by minimal GABAergic effects, but significant NMDA blockade.  It is less clear which and how these various effects result in failure of the patient to wake up when the surgeon cuts them. I will present some results from experimental brain slice work, and theoretical mean field modelling of anesthesia and sleep, that support the idea that the final common mechanism of both types of anaesthesia is fragmentation of long distance information flow in the cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2012&#039;&#039;&#039; (Halloween)&lt;br /&gt;
* Speaker: Jonathan Landy&lt;br /&gt;
* Affiliation: UCSB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Mean-field replica theory: review of basics and a new approach&lt;br /&gt;
* Abstract: Replica theory provides a general method for evaluating the mode of a distribution, and has varied applications to problems in statistical mechanics, signal processing, etc.  Evaluation of the formal expressions arising in replica theory represents a formidable technical challenge, but one that physicists have apparently intuited correct methods for handling.  In this talk, I will first provide a review of the historical development of replica theory, covering: 1) motivation,  2) the intuited ``Parisi-ansatz&amp;quot; solution,  3) continued controversies, and 4) a survey of applications (including to neural networks).  Following this, I will discuss an exploratory effort of mine, aimed at developing an ansatz-free solution method.  As an example, I will work out the phase diagram for a simple spin-glass model.  This talk is intended primarily as a tutorial.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Tom Griffiths&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host:Daniel Little&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Identifying human inductive biases&lt;br /&gt;
* Abstract: People are remarkably good at acquiring complex knowledge from limited data, as is required in learning causal relationships, categories, or aspects of language. Successfully solving inductive problems of this kind requires having good &amp;quot;inductive biases&amp;quot; - constraints that guide inductive inference. Viewed abstractly, understanding human learning requires identifying these inductive biases and exploring their origins. I will argue that probabilistic models of cognition provide a framework that can facilitate this project, giving a transparent characterization of the inductive biases of ideal learners. I will outline how probabilistic models are traditionally used to solve this problem, and then present a new approach that uses Markov chain Monte Carlo algorithms as the basis for an experimental method that magnifies the effects of inductive biases.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2012&#039;&#039;&#039; (Monday) (Thanksgiving week)&lt;br /&gt;
* Speaker: Bin Yu&lt;br /&gt;
* Affiliation: Dept. of Statistics and EECS, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Representation of Natural Images in V4&lt;br /&gt;
* Abstract: The functional organization of area V4 in the mammalian ventral visual pathway is far from being well understood. V4 is believed to play an important role in the recognition of shapes and objects and in visual attention, but the complexity of this cortical area makes it hard to analyze. In particular, no current model of V4 has shown good predictions for neuronal responses to natural images and there is no consensus on the primary role of V4.&lt;br /&gt;
In this talk, we present analysis of electrophysiological data on the response of V4 neurons to natural images. We propose a new computational model that achieves comparable prediction performance for V4 as for V1 neurons. Our model does not rely on any pre-defined image features but only on invariance and sparse coding principles. We interpret our model using sparse principal component analysis and discover two groups of neurons: those selective to texture versus those selective to contours. This supports the thesis that one primary role of V4 is to extract objects from background in the visual field.  Moreover, our study also confirms the diversity of V4 neurons. Among those selective to contours, some of them are selective to orientation, others to acute curvature features.&lt;br /&gt;
(This is joint work with J. Mairal, Y. Benjamini, B. Willmore, M. Oliver&lt;br /&gt;
and J. Gallant.)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:  Yan Karklin&lt;br /&gt;
* Affiliation:  NYU&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Dec 2012 (note this would be the Monday after NIPS)&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Marius Pachitariu&lt;br /&gt;
* Affiliation: Gatsby / UCL&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title:  NIPS paper &amp;quot;Learning visual motion in recurrent neural networks&amp;quot;&lt;br /&gt;
* Abstract: We present a dynamic nonlinear generative model for visual motion based on a&lt;br /&gt;
latent representation of binary-gated Gaussian variables connected in a network. &lt;br /&gt;
Trained on sequences of images by an STDP-like rule the model learns &lt;br /&gt;
to represent different movement directions in different variables. We use an online &lt;br /&gt;
approximate inference scheme that can be mapped to the dynamics of networks &lt;br /&gt;
of neurons. Probed with drifting grating stimuli and moving bars of light, neurons &lt;br /&gt;
in the model show patterns of responses analogous to those of direction-selective &lt;br /&gt;
simple cells in primary visual cortex. We show how the computations of the model &lt;br /&gt;
are enabled by a specific pattern of learnt asymmetric recurrent connections. &lt;br /&gt;
I will also briefly discuss our application of recurrent neural networks as statistical &lt;br /&gt;
models of simultaneously recorded spiking neurons. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Ian Goodfellow&lt;br /&gt;
* Affiliation: U Montreal&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Stuart Hammeroff&lt;br /&gt;
* Affiliation: University of Arizona &lt;br /&gt;
* Host: Gautam Agarwal&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Quantum cognition and brain microtubules &lt;br /&gt;
* Abstract: Cognitive decision processes are generally seen as classical Bayesian probabilities, but better suited to quantum mathematics. For example: 1) Psychological conflict, ambiguity and uncertainty can be viewed as (quantum) superposition of multiple possible judgments and beliefs. 2) Measurement (e.g. answering a question, reaching a decision) reduces possibilities to definite states (‘constructing reality’, ‘collapsing the wave function’). 3) Previous questions influence subsequent answers, so sequence affects outcomes (‘contextual non-commutativity’). 4) Judgments and choices may deviate from classical logic, suggesting random, or ‘non-computable’ quantum influences. Can quantum cognition operate in the brain? Do classical brain activities simulate quantum processes? Or have biomolecular quantum devices evolved? In this talk I will discuss how a finer scale, intra-neuronal level of quantum information processing in cytoskeletal microtubules can accumulate, operate upon and integrate quantum information and memory for self-collapse to classical states which regulate axonal firings, controlling behavior.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday 14 Jan 2013, 1:00pm&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dibyendu Mandal &lt;br /&gt;
* Affiliation: Physics Dept., University of Maryland (Jarzynski group)&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: An exactly solvable model of Maxwell’s demon&lt;br /&gt;
* Abstract: The paradox of Maxwell’s demon has stimulated numerous thought experiments, leading to discussions about the thermodynamic implications of information processing. However, the field has lacked a tangible example or model of an autonomous, mechanical system that reproduces the actions of the demon. To address this issue, we introduce an explicit model of a device that can deliver work to lift a mass against gravity by rectifying thermal fluctuations, while writing information to a memory register. We solve for the steady-state behavior of the model and construct its nonequilibrium phase diagram. In addition to the engine-like action described above, we identify a Landauer eraser region in the phase diagram where the model uses externally supplied work to remove information from the memory register. Our model offers a simple paradigm for investigating the thermodynamics of information processing by exposing a transparent mechanism of operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Brody&lt;br /&gt;
* Affiliation: Princeton&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Neural substrates of decision-making in the rat&lt;br /&gt;
* Abstract: Gradual accumulation of evidence is thought to be a fundamental component of decision-making. Over the last 16 years, research in non-human primates has revealed neural correlates of evidence accumulation in parietal and frontal cortices, and other brain areas . However, the circuit mechanisms underlying these neural correlates remains unknown. Reasoning that a rodent model of evidence accumulation would allow a greater number of experimental subjects, and therefore experiments, as well as facilitate the use of molecular tools, we developed a rat accumulation of evidence task, the &amp;quot;Poisson Clicks&amp;quot; task. In this task, sensory evidence is delivered in pulses whose precisely-controlled timing varies widely within and across trials. The resulting data are analyzed with models of evidence accumulation that use the richly detailed information of each trial’s pulse timing to distinguish between different decision mechanisms. The method provides great statistical power, allowing us to: (1) provide compelling evidence that rats are indeed capable of gradually accumulating evidence for decision-making; (2) accurately estimate multiple parameters of the decision-making process from behavioral data; and (3) measure, for the first time, the diffusion constant of the evidence accumulator, which we show to be optimal (i.e., equal to zero). In addition, the method provides a trial-by-trial, moment-by-moment estimate of the value of the accumulator, which can then be compared in awake behaving electrophysiology experiments to trial-by-trial, moment-by-moment neural firing rate measures. Based on such a comparison, we describe data and a novel analysis approach that reveals differences between parietal and frontal cortices in the neural encoding of accumulating evidence. Finally, using semi-automated training methods to produce tens of rats trained in the Poisson Clicks accumulation of evidence task, we have also used pharmacological inactivation to ask, for the first time, whether parietal and frontal cortices are required for accumulation of evidence, and we are using optogenetic methods to rapidly and transiently inactivate brain regions so as to establish precisely when, during each decision-making trial, it is that each brain region&#039;s activity is necessary for performance of the task.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eugene M. Izhikevich&lt;br /&gt;
* Affiliation: Brain Corporation&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Spikes&lt;br /&gt;
* Abstract: Most communication in the brain is via spikes. While we understand the spike-generation mechanism of individual neurons, we fail to appreciate the spike-timing code and its role in neural computations. The speaker starts with simple models of neuronal spiking and bursting, describes small neuronal circuits that learn spike-timing code via spike-timing dependent plasticity (STDP), and finishes with biologically detailed and anatomically accurate large-scale brain models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Goren Gordon&lt;br /&gt;
* Affiliation: Weizman Intitute&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Hierarchical Curiosity Loops – Model, Behavior and Robotics&lt;br /&gt;
* Abstract: Autonomously learning about one&#039;s own body and its interaction with the environment is a formidable challenge, yet it is ubiquitous in biology: every animal’s pup and every human infant accomplish this task in their first few months of life. Furthermore, biological agents’ curiosity actively drives them to explore and experiment in order to expedite their learning progress. To bridge the gap between biological and artificial agents, a formal mathematical theory of curiosity was developed that attempts to explain observed biological behaviors and enable curiosity emergence in robots. In the talk, I will present the hierarchical curiosity loops model, its application to rodent’s exploratory behavior and its implementation in a fully autonomously learning and behaving reaching robot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jenny Read&lt;br /&gt;
* Affiliation: Institute of Neuroscience, Newcastle University&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Stereoscopic vision&lt;br /&gt;
* Abstract: [To be written]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Valero Laparra&lt;br /&gt;
* Affiliation:  University of Valencia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Empirical statistical analysis of phases in Gabor filtered natural images&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dolores Bozovic&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Bifurcations and phase-locking dynamics in the auditory system&lt;br /&gt;
* Abstract: The inner ear constitutes a remarkable biological sensor that exhibits nanometer-scale sensitivity of mechanical detection. The first step in auditory processing is performed by hair cells, which convert movement into electrical signals via opening of mechanically gated ion channels. These cells are operant in a viscous medium, but can nevertheless sustain oscillations, amplify incoming signals, and even exhibit spontaneous motility, indicating the presence of an underlying active amplification system. Theoretical models have proposed that a hair cell constitutes a nonlinear system with an internal feedback mechanism that can drive it across a bifurcation and into an unstable regime. Our experiments explore the nonlinear response as well as feedback mechanisms  that enable self-tuning already at the peripheral level, as measured in vitro on sensory tissue. A simple dynamic systems framework will be discussed, that captures the main features of the experimentally observed behavior in the form of an Arnold Tongue.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 March 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dale Purves&lt;br /&gt;
* Affiliation: Duke&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: How Visual Evolution Determines What We See&lt;br /&gt;
* Abstract: Information about the physical world is excluded from visual stimuli by the nature of biological vision (the inverse optics problem). Nonetheless, humans and other visual animals routinely succeed in their environments. The talk will explain how the assignment of perceptual values to visual stimuli according to the frequency of occurrence of stimulus patterns resolves the inverse problem and determines the basic visual qualities we see. This interpretation of vision implies that the best (and perhaps the only) way to understand visual system circuitry is to evolve it, an idea supported by recent work.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mounya Elhilali&lt;br /&gt;
* Affiliation: Johns Hopkins&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Attention at the cocktail party: Neural bases and computational strategies for auditory scene analysis&lt;br /&gt;
* Abstract: The perceptual organization of sounds in the environment into coherent objects is a feat constantly facing the auditory system. It manifests itself in the everyday challenge faced by humans and animals alike to parse complex acoustic information arising from multiple sound sources into separate auditory streams. While seemingly effortless, uncovering the neural mechanisms and computational principles underlying this remarkable ability remain a challenge for both the experimental and theoretical neuroscience communities. In this talk, I discuss the potential role of neuronal tuning in mammalian primary auditory cortex in mediating this process. I also examine the role of mechanisms of attention in adapting this neural representation to reflect both the sensory content and the changing behavioral context of complex acoustic scenes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;17th of April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Wiktor Młynarski&lt;br /&gt;
* Affiliation: Max Planck Institute for Mathematics in the Sciences&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Statistical Models of Binaural Sounds&lt;br /&gt;
* Abstract: The auditory system exploits disparities in the sounds arriving at the left and right ear to extract information about the spatial configuration of sound sources. According to the widely acknowledged Duplex Theory, sounds of low frequency are localized based on Interaural Time Differences (ITDs) and localization of high frequency sources relies on Interaural Level Differences (ILDs). Natural sounds, however,  possess a rich structure and contain multiple frequency components.  This leads to the question: what are the contributions of different cues to sound position identification in the natural environment and how much information do they carry about its spatial structure? In this talk, I will present my attempts to answer the above questions using statistical, generative models of naturalistic (simulated) and fully natural binaural sounds.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Byron Yu&lt;br /&gt;
* Affiliation: CMU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bijan Pesaran&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2011/12 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Sep 2011 (Thursday, at noon)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kathrin Berkner&lt;br /&gt;
* Affiliation: Ricoh Innovations Inc.&lt;br /&gt;
* Host: Ivana Tosic&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;21 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike Kilgard&lt;br /&gt;
* Affiliation: UT Dallas&lt;br /&gt;
* Host: Michael Silver&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Moshe Gur&lt;br /&gt;
* Affiliation: Dept. of Biomedical Engineering, Technion, Israel Institute of Technology&lt;br /&gt;
* Host: Bruno/Stan&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: On the unity of perception: How does the brain integrate activity evoked at different cortical loci?&lt;br /&gt;
* Abstract: Any physical device we know, including computers, when comparing A to B must send the information to point C. I have done experiments in three modalities, somato-sensory, auditory, and visual, where 2 different loci at the primary cortex are stimulated and I argue that the &amp;quot;machine&amp;quot; converging hypothesis cannot explain the perceptual results. Thus we must assume a non-converging mechanism whereby the  brain, at times, can compare (integrate, process) events that take place at different loci without sending the information to a common target. Once we allow for such a mechanism, many phenomena can be viewed differently. Take for example the question of how and where does multi-sensory integration take place;  we perceive a synchronized talking face yet detailed  visual and auditory information are represented at very different brain loci.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: University of Hawaii at Manoa&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Predictive power, memory and dissipation in learning systems operating far from thermodynamic equilibrium&lt;br /&gt;
* Abstract: Understanding the physical processes that underly the functioning of biological computing machinery often requires describing processes that occur far from thermodynamic equilibrium. In recent years significant progress has been made in this area, most notably Jarzynski’s work relation and Crooks’ fluctuation theorem. In this talk I will explore how dissipation of energy is related to a system&#039;s information processing inefficiency. The focus is on driven systems that are embedded in a stochastic operating environment. If we describe the system as a state machine, then we can interpret the stochastic dynamics as performing a computation that results in an (implicit) model of the stochastic driving signal. I will show that instantaneous non-predictive information, which serves as a measure of model inefficiency, provides a lower bound on the average dissipated work. This implies that learning systems with larger predictive power can operate more energetically efficiently. We could speculate that perhaps biological systems may have evolved to reflect this kind of adaptation. One interesting insight here is that purely physical notions require what is perfectly in line with the general belief that a useful model must be predictive (at fixed model complexity). Our result thereby ties together ideas from learning theory with basic non-equilibrium thermodynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Graham Cummins&lt;br /&gt;
* Affiliation: WSU&lt;br /&gt;
* Host: Jeff Teeters&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Shinji Nishimoto&lt;br /&gt;
* Affiliation: Gallant lab, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Dec 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Austin Roorda&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: How the unstable eye sees a stable and moving world&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ken Nakayama&lt;br /&gt;
* Affiliation: Harvard University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Subjective Contours&lt;br /&gt;
* Abstract: The concept of the receptive field in visual science has been transformative. It fueled great discoveries of the second half of the 20th C,   providing the dominant understanding of how the visual system works at its early stages.   Its reign has been extended to the field of object recognition where in the form of a linear classifier, it provides a framework to understand visual object recognition (DiCarlo and Cox, 2007).&lt;br /&gt;
Untamed, however, are areas of visual perception, now more or less ignored, dubbed variously as the 2.5 D sketch, mid-level vision, surface representations. Here, neurons with their receptive fields seem unable to bridge the gap, to supply us with even a plausible speculative framework to understand amodal completion, subjective contours and other surface phenomena.  Correspondingly, these areas have become backwater, ignored, leapt over.&lt;br /&gt;
Subjective contours, however, remain as vivid as ever, even more so.&lt;br /&gt;
Everyday, our visual system makes countless visual inferences as to the layout of the world surfaces and objects.  What’s remarkable is that subjective contours  visibly reveal these inferences.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 24 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aniruddha Das&lt;br /&gt;
* Affiliation: Columbia University&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Elad Schneidman &lt;br /&gt;
* Affiliation: Department of Neurobiology, Weizmann Institute of Science&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Sparse high order interaction networks underlie learnable neural population codes&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Feb 2012 (at noon as usual)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Heather Read&lt;br /&gt;
* Affiliation: U. Connecticut&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &amp;quot;Transformation of sparse temporal coding from auditory colliculus and cortex&amp;quot;&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Mar 2012 (note: Thurs)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Daniel Zoran&lt;br /&gt;
* Affiliation: Hebrew University, Jerusalem&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sivak&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ivan Schwab&lt;br /&gt;
* Affiliation: UC Davis&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Evolution&#039;s Witness: How Eyes Evolved&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sussillo&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 April 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kristofer Bouchard&lt;br /&gt;
* Affiliation: UCSF&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Cortical Foundations of Human Speech Production&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 May 2012&#039;&#039;&#039; (rescheduled from April 11)&lt;br /&gt;
* Speaker: Logan Grosenick&lt;br /&gt;
* Affiliation: Stanford, Deisseroth &amp;amp; Suppes Labs&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Acquisition, creation, &amp;amp; analysis of 4D light fields with applications to calcium imaging &amp;amp; optogenetics&lt;br /&gt;
* Abstract: In Light Field Microscopy (LFM), images can be computationally refocused after they are captured [1]. This permits acquiring focal stacks and reconstructing volumes from a single camera frame. In Light Field Illumination (LFI), the same ideas can be used to create an illumination system that can deliver focused light to any position in a volume without moving optics, and these two devices (LFM/LFI) can be used together in the same system [2]. So far, these imaging and illumination systems have largely been used independently in proof-of-concept experiments [1,2]. In this talk I will discuss applications of a combined scanless volumetric imaging and volumetric illumination system applied to 4D calcium imaging and photostimulation of neurons in vivo and in vitro. The volumes resulting from these methods are large (&amp;gt;500,000 voxels per time point), collected at 10-100 frames per second, and highly correlated in space and time. Analyzing such data has required the development and application of machine learning methods appropriate to large, sparse, nonnegative data, as well as the estimation of neural graphical models from calcium transients. This talk will cover the reconstruction and creation of volumes in a microscope using Light Fields [1,2], and the current state-of-the-art for analyzing these large volumes in the context of calcium imaging and optogenetics. &lt;br /&gt;
&lt;br /&gt;
[1] M. Levoy, R. Ng, A. Adams, M. Footer, and M. Horowitz. Light Field Microscopy. ACM Transactions on Graphics 25(3), Proceedings of SIGGRAPH 2006.&lt;br /&gt;
[2] M. Levoy, Z. Zhang, and I. McDowall. Recording and controlling the 4D light field in a microscope. Journal of Microscopy, Volume 235, Part 2, 2009, pp. 144-162. Cover article.&lt;br /&gt;
&lt;br /&gt;
BIO: Logan received bachelors degrees with honors in Biology and Psychology from Stanford, and a Masters in Statistics from Stanford. He is a Ph.D. candidate in the Neurosciences Program working in the labs of Karl Deisseroth and Patrick Suppes, and a trainee at the Stanford Center for Mind, Brain, and Computation. He is interested in developing and applying novel computational imaging and machine learning techniques in order to observe, control, and understand neuronal circuit dynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 June 2012&#039;&#039;&#039; (Thursday)&lt;br /&gt;
* Speaker:  Mitya Chklovskii&lt;br /&gt;
* Affiliation: janelia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jerry Feldman&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Lucas Theis&lt;br /&gt;
* Affiliation: Matthias Bethge lab, Werner Reichardt Centre for Integrative Neuroscience, Tübingen&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Hierarchical models of natural images&lt;br /&gt;
* Abstract: Probabilistic models of natural images have been used to solve a variety of computer vision tasks as well as a means to better understand the computations performed by the visual system in the brain. A lot of theoretical considerations and biological observations point to the fact that natural image models should be hierarchically organized, yet to date, the best known models are still based on what is better described as shallow representations. In this talk, I will present two image models. One is based on the idea of Gaussianization for greedily constructing hierarchical generative models. I will show that when combined with independent subspace analysis, it is able to compete with the state of the art for modeling image patches. The other model combines mixtures of Gaussian scale mixtures with a directed graphical model and multiscale image representations and is able to generate highly structured images of arbitrary size. Evaluating the model&#039;s likelihood and comparing it to a large number of other image models shows that it might well be the best model for natural images yet.&lt;br /&gt;
&lt;br /&gt;
(joint work with Reshad Hosseini and Matthias Bethge)&lt;br /&gt;
&lt;br /&gt;
=== 2010/11 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;02 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Johannes Burge&lt;br /&gt;
* Affiliation: University of Texas at Austin&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tobi Szuts&lt;br /&gt;
* Affiliation: Meister Lab/ Harvard U.&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Wireless recording of neural activity in the visual cortex of a freely moving rat.&lt;br /&gt;
* Abstract: Conventional neural recording systems restrict behavioral experiments to a flat indoor environment compatible with the cable that tethers the subject to the recording instruments. To overcome these constraints, we developed a wireless multi-channel system for recording neural signals from a freely moving animal the size of a rat or larger. The device takes up to 64 voltage signals from implanted electrodes, samples each at 20 kHz, time-division multiplexes them onto a single output line, and transmits that output by radio frequency to a receiver and recording computer up to &amp;gt;60 m away. The system introduces less than 4 ?V RMS of electrode-referred noise, comparable to wired recording systems and considerably less than biological noise. The system has greater channel count or transmission distance than existing telemetry systems. The wireless system has been used to record from the visual cortex of a rat during unconstrained conditions. Outdoor recordings show V1 activity is modulated by nest-building activity. During unguided behavior indoors, neurons responded rapidly and consistently to changes in light level, suppressive effects were prominent in response to an illuminant transition, and firing rate was strongly modulated by locomotion. Neural firing in the visual cortex is relatively sparse and moderate correlations are observed over large distances, suggesting that synchrony is driven by global processes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vikash Gilja&lt;br /&gt;
* Affiliation: Stanford University&lt;br /&gt;
* Host: Charles&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Towards Clinically Viable Neural Prosthetic Systems.&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Oct 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alexandre Francois&lt;br /&gt;
* Affiliation: USC&lt;br /&gt;
* Host: &lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eric Jonas and Vikash Mansinghka&lt;br /&gt;
* Affiliation:  Navia Systems&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Natively Probabilistic Computation: Principles, Artifacts, Architectures and Applications&lt;br /&gt;
* Abstract: Complex probabilistic models and Bayesian inference are becoming&lt;br /&gt;
increasingly critical across science and industry, especially in&lt;br /&gt;
large-scale data analysis. They are also central to our best&lt;br /&gt;
computational accounts of human cognition, perception and action.&lt;br /&gt;
However, all these efforts struggle with the infamous curse of&lt;br /&gt;
dimensionality. Rich probabilistic models can seem hard to write and&lt;br /&gt;
even harder to solve, as specifying and calculating probabilities&lt;br /&gt;
often appears to require the manipulation of exponentially (and&lt;br /&gt;
sometimes infinitely) large tables of numbers.&lt;br /&gt;
&lt;br /&gt;
We argue that these difficulties reflect a basic mismatch between the&lt;br /&gt;
needs of probabilistic reasoning and the deterministic, functional&lt;br /&gt;
orientation of our current hardware, programming languages and CS&lt;br /&gt;
theory. To mitigate these issues, we have been developing a stack of&lt;br /&gt;
abstractions for natively probabilistic computation, based around&lt;br /&gt;
stochastic simulators (or samplers) for distributions, rather than&lt;br /&gt;
evaluators for deterministic functions. Ultimately, our aim is to&lt;br /&gt;
produce a model of computation and the associated hardware and&lt;br /&gt;
programming tools that are as suited for uncertain inference and&lt;br /&gt;
decision-making as our current computers are for precise arithmetic.&lt;br /&gt;
&lt;br /&gt;
In this talk, we will give an overview of the entire stack of&lt;br /&gt;
abstractions supporting natively probabilistic computation, with&lt;br /&gt;
technical detail on several hardware and software artifacts we have&lt;br /&gt;
implemented so far. we will also touch on some new theoretical results&lt;br /&gt;
regarding the computational complexity of probabilistic programs.&lt;br /&gt;
Throughout, we will motivate and connect this work to some current&lt;br /&gt;
applications in biomedical data analysis and computer vision, as well&lt;br /&gt;
as potential hypotheses regarding the implementation of probabilistic&lt;br /&gt;
computation in the brain.&lt;br /&gt;
&lt;br /&gt;
This talk includes joint work with Keith Bonawitz, Beau Cronin,&lt;br /&gt;
Cameron Freer, Daniel Roy and Joshua Tenenbaum.&lt;br /&gt;
&lt;br /&gt;
BRIEF BIOGRAPHY&lt;br /&gt;
&lt;br /&gt;
Vikash Mansinghka is a co-founder and the CTO of Navia Systems, a&lt;br /&gt;
venture-funded startup company building natively probabilistic&lt;br /&gt;
computing machines. He spent 10 years at MIT, eventually earning an&lt;br /&gt;
SB. in Mathematics, an SB. in Computer Science, an MEng in Computer&lt;br /&gt;
Science, and a PhD in Computation. He held graduate fellowships from&lt;br /&gt;
the NSF and MIT&#039;s Lincoln Laboratories, and his PhD dissertation won&lt;br /&gt;
the 2009 MIT George M. Sprowls award for best dissertation in computer&lt;br /&gt;
science. He currently serves on DARPA&#039;s Information Science and&lt;br /&gt;
Technology (ISAT) Study Group.&lt;br /&gt;
&lt;br /&gt;
Eric Jonas is a co-founder of Navia Systems, responsible for in-house&lt;br /&gt;
accelerated inference research and development. He spent ten years at&lt;br /&gt;
MIT, where he earned SB degrees in electrical engineering and computer&lt;br /&gt;
science and neurobiology, an MEng in EECS, with a neurobiology PhD&lt;br /&gt;
expected really soon.  He’s passionate about biological applications&lt;br /&gt;
of probabilistic reasoning and hopes to use Navia’s capabilities to&lt;br /&gt;
combine data from biological science, clinical histories, and patient&lt;br /&gt;
outcomes into seamless models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Patrick Ruther&lt;br /&gt;
* Affiliation:  Imtek, University of Freiburg&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aurel Lazar&lt;br /&gt;
* Affiliation: Department of Electrical Engineering, Columbia University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Encoding Visual Stimuli with a Population of Hodgkin-Huxley Neurons&lt;br /&gt;
* Abstract: We first present a general framework for the reconstruction of natural video&lt;br /&gt;
scenes encoded with a population of spiking neural circuits with random thresholds.&lt;br /&gt;
The visual encoding system consists of a bank of filters, modeling the visual&lt;br /&gt;
receptive fields, in cascade with a population of neural circuits, modeling encoding&lt;br /&gt;
with spikes in the early visual system.&lt;br /&gt;
The neuron models considered include integrate-and-fire neurons and ON-OFF&lt;br /&gt;
neuron pairs with threshold-and-fire spiking mechanisms. All thresholds are assumed&lt;br /&gt;
to be random. We show that for both time-varying and space-time-varying stimuli neural&lt;br /&gt;
spike encoding is akin to taking noisy measurements on the stimulus.&lt;br /&gt;
Second, we formulate the reconstruction problem as the minimization of a&lt;br /&gt;
suitable cost functional in a finite-dimensional vector space and provide an explicit&lt;br /&gt;
algorithm for stimulus recovery. We also present a general solution using the theory of&lt;br /&gt;
smoothing splines in Reproducing Kernel Hilbert Spaces. We provide examples of both&lt;br /&gt;
synthetic video as well as for natural scenes and show that the quality of the&lt;br /&gt;
reconstruction degrades gracefully as the threshold variability of the neurons increases.&lt;br /&gt;
Third, we demonstrate a number of simple operations on the original visual stimulus&lt;br /&gt;
including translations, rotations and zooming. All these operations are natively executed&lt;br /&gt;
in the spike domain. The processed spike trains are decoded for the faithful recovery&lt;br /&gt;
of the stimulus and its transformations.&lt;br /&gt;
Finally, we extend the above results to neural encoding circuits built with Hodking-Huxley&lt;br /&gt;
neurons.&lt;br /&gt;
References:&lt;br /&gt;
Aurel A. Lazar, Eftychios A. Pnevmatikakis and Yiyin Zhou,&lt;br /&gt;
Encoding Natural Scenes with Neural Circuits with Random Thresholds, Vision Research, 2010,&lt;br /&gt;
Special Issue on Mathematical Models of Visual Coding,&lt;br /&gt;
http://dx.doi.org/10.1016/j.visres.2010.03.015&lt;br /&gt;
Aurel A. Lazar,&lt;br /&gt;
Population Encoding with Hodgkin-Huxley Neurons,&lt;br /&gt;
IEEE Transactions on Information Theory, Volume 56, Number 2, pp. 821-837, February, 2010,&lt;br /&gt;
Special Issue on Molecular Biology and Neuroscience,&lt;br /&gt;
http://dx.doi.org/10.1109/TIT.2009.2037040&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Nov 2010&#039;&#039;&#039; (UCB holiday)&lt;br /&gt;
* Speaker: Martha Nari Havenith&lt;br /&gt;
* Affiliation: UCL&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Finding spike timing in the visual cortex - Oscillations as the internal clock of vision?&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2010&#039;&#039;&#039;  (note: on Friday because of SFN)&lt;br /&gt;
* Speaker: Dan Butts&lt;br /&gt;
* Affiliation: UMD&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Common roles of inhibition in visual and auditory processing.&lt;br /&gt;
* Abstract: The role of inhibition in sensory processing is often obscured in extracellular recordings, because the absence of a neuronal response associated with inhibition might also be explained by a simple lack of excitation. However, increasingly, evidence from intracellular recordings demonstrates important roles of inhibition in shaping the stimulus selectivity of sensory neurons in both the visual and auditory systems. We have developed a nonlinear modeling approach that can identify putative excitatory and inhibitory inputs to a neuron using standard extracellular recordings, and have applied these techniques to understand the role of inhibition in shaping sensory processing in visual and auditory areas.  In pre-cortical visual areas (retina and LGN), we find that inhibition likely plays a role in generating temporally precise responses, and mediates adaptation to changing contrast. In an auditory pre-cortical area (inferior colliculus) identified inhibition has nearly identical appearance and functions in temporal processing and adaptation. Thus, we predict common roles of inhibition in these sensory areas, and more generally demonstrate general methods for characterizing the nonlinear computations that comprise sensory processing.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;24 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eizaburo Doi&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Nov 2010 - informal talk&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eero Lehtonen&lt;br /&gt;
* Affiliation: UTU Finland&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Memristors&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gadi Geiger&lt;br /&gt;
* Affiliation: MIT&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Visual and Auditory Perceptual Modes that Characterize Dyslexics&lt;br /&gt;
* Abstract: I will describe how dyslexics’ visual and auditory perception is wider and more diffuse than that of typical readers. This suggests wider neural tuning in dyslexics. In addition I will describe how this processing relates to difficulties in reading. Strengthening the argument and more so helping dyslexics I will describe a regimen of practice that results in improved reading in dyslexics while narrowing perception.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;13 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jorg Lueke&lt;br /&gt;
* Affiliation: FIAS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Linear and Non-linear Approaches to Component Extraction and Their Applications to Visual Data&lt;br /&gt;
* Abstract:  In the nervous system of humans and animals, sensory data are represented as combinations of elementary data components. While for data such as sound waveforms the elementary components combine linearly, other data can better be modeled by non-linear forms of component superpositions. I motivate and discuss two models with binary latent variables: one using standard linear superpositions of basis functions and one using non-linear superpositions.  Crucial for the applicability of both models are efficient learning procedures. I briefly introduce a novel training scheme (ET) and show how it can be applied to probabilistic generative models. For linear and non-linear models the scheme efficiently infers the basis functions as well as the level of sparseness and data noise.  In large-scale applications to image patches, we show results on the statistics of inferred model parameters. Differences between the linear and non-linear models are discussed, and both models are compared to results of standard approaches in the literature and to experimental findings.  Finally, I briefly discuss learning in a recent model that takes explicit component occlusions into account.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Claudia Clopath&lt;br /&gt;
* Affiliation: Universite Paris Decartes&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Siwei Lyu&lt;br /&gt;
* Affiliation: Computer Science Department, University at Albany, SUNY&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: Divisive Normalization as an Efficient Coding Transform: Justification and Evaluation&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  David Field (informal talk)&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;25 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ruth Rosenholtz&lt;br /&gt;
* Affiliation: Dept. of Brain &amp;amp; Cognitive Sciences, Computer Science and AI Lab, MIT&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: What your visual system sees where you are not looking&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ernst Niebur&lt;br /&gt;
* Affiliation: Johns Hopkins U&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vladimir Itskov&lt;br /&gt;
* Affiliation: University of Nebraska-Lincoln&lt;br /&gt;
* Host: Chris&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruce Cumming&lt;br /&gt;
* Affiliation: National Institutes of Health&lt;br /&gt;
* Host: Ivana&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 April 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Lubomir Bourdev&lt;br /&gt;
* Affiliation: Computer Science, UC Berkeley&lt;br /&gt;
* Host:Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &amp;quot;Poselets and Their Applications in High-Level Computer Vision Problems&amp;quot;&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2011 (note: Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Jack Culpepper&lt;br /&gt;
* Affiliation: Redwood Center/EECS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title:  TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 May 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Ian Stevenson&lt;br /&gt;
* Affiliation:  Northwestern University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Explaining tuning curves by estimating interactions between neurons&lt;br /&gt;
* Abstract: One of the central tenets of systems neuroscience is that tuning curves are a byproduct of the interactions between neurons. Using multi-electrode recordings and recently developed inference techniques we can begin to examine this idea in detail and study how well we can explain the functional properties of neurons using the activity of other simultaneously recorded neurons. Here we examine datasets from 6 different brain areas recorded during typical sensorimotor tasks each with ~100 simultaneously recorded neurons. Using these datasets we measured the extent to which interactions between neurons can explain the tuning properties of individual neurons. We found that, in almost all areas, modeling interactions between 30-50 neurons allows more accurate spike prediction than tuning curves. This suggests that tuning can, in some sense, be explained by interactions between neurons in a variety of brain areas, even when recordings consist of relatively small numbers of neurons.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Michael Oliver&lt;br /&gt;
* Affiliation: Gallant lab&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alyson Fletcher&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: Generalized Approximate Message Passing for Neural Receptive Field Estimation and Connectivity&lt;br /&gt;
* Abstract:  Fundamental to understanding sensory encoding and connectivity of neurons are effective tools for developing and validating complex mathematical models from experimental data.  In this talk, I present a graphical models approach to the problems of neural connectivity reconstruction under multi-neuron excitation and to receptive field estimation of sensory neurons in response to stimuli.  I describe a new class of Generalized Approximate Message Passing (GAMP) algorithms for a general class of inference problems on graphical models based Gaussian approximations of loopy belief propagation.  The GAMP framework is extremely general, provides a systematic procedure for incorporating a rich class of nonlinearities, and is computationally tractable with large amounts of data.  In addition, for both the connectivity reconstruction and parameter estimation problems, I show that GAMP-based estimation can naturally incorporate sparsity constraints in the model that arise from the fact that only a small fraction of the potential inputs have any influence on the output of a particular neuron.  A simulation of reconstruction of cortical neural mapping under multi-neuron excitation shows that GAMP offers  improvement over previous compressed sensing methods.  The GAMP method is also validated on estimation of linear nonlinear Poisson (LNP) cascade models for neural responses of salamander retinal ganglion cells.&lt;br /&gt;
&lt;br /&gt;
=== 2009/10 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2 September 2009&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Keith Godfrey&lt;br /&gt;
* Affiliation: University of Cambridge&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anita Schmid&lt;br /&gt;
* Affiliation: Cornell University&lt;br /&gt;
* Host: Kilian&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Subpopulations of neurons in visual area V2 perform differentiation and integration operations in space and time&lt;br /&gt;
* Abstract: The interconnected areas of the visual system work together to find object boundaries in visual scenes. Primary visual cortex (V1) mainly extracts oriented luminance boundaries, while secondary visual cortex (V2) also detects boundaries defined by differences in texture. How the outputs of V1 neurons are combined to allow for the extraction of these more complex boundaries in V2 is as of yet unclear. To address this question, we probed the processing of orientation signals in single neurons in V1 and V2, focusing on response dynamics of neurons to patches of oriented gratings and to combinations of gratings in neighboring patches and sequential time frames. We found two kinds of response dynamics in V2, both of which are different from those of V1 neurons. While V1 neurons in general prefer one orientation, one subpopulation of V2 neurons (“transient”) shows a temporally dynamic preference, resulting in a preference for changes in orientation. The second subpopulation of V2 neurons (“sustained”) responds similarly to V1 neurons, but with a delay. The dynamics of nonlinear responses to combinations of gratings reinforce these distinctions: the dynamics enhance the preference of V1 neurons for continuous orientations, and enhance the preference of V2 transient neurons for discontinuous ones. We propose that transient neurons in V2 perform a differentiation operation on the V1 input, both spatially and temporally, while the sustained neurons perform an integration operation. We show that a simple feedforward network with delayed inhibition can account for the temporal but not for the spatial differentiation operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Andrea Benucci&lt;br /&gt;
* Affiliation: Institute of Ophthalmology, University College London&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Stimulus dependence of the functional connectivity between neurons in primary visual cortex&lt;br /&gt;
* Abstract:  It is known that visual stimuli are encoded by the concerted activity of large populations of neurons in visual cortical areas. However, it is only recently that recording techniques have been made available to study such activations from large ensembles of neurons simultaneously, with millisecond temporal precision and tens of microns spatial resolution. I will present data from voltage-sensitive dye (VSD) imaging and multi-electrode recordings (“Utah” probes) from the primary visual cortex of the cat (V1).  I will discuss the relationship between two fundamental cortical maps of the visual system: the map of retinotopy and the map of orientation. Using spatially localized and full-field oriented stimuli, we studied the functional interdependency of these maps. I will describe traveling and standing waves of cortical activity and their key role as a dynamical substrate for the spatio-temporal coding of visual information.  I will further discuss the properties of the spatio-temporal code in the context of continuous visual stimulation.  While recording population responses to a sequence of oriented stimuli, we asked how responses to individual stimuli summate over time. We found that such rules are mostly linear, supporting the idea that spatial and temporal codes in area V1 operate largely independently. However, these linear rules of summation fail when the visual drive is removed, suggesting that the visual cortex can readily switch between a dynamical regime where either feed-forward or intra-cortical inputs determine the response properties of the network.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 November 2009 (Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Song-Chun Zhu&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 November 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dan Graham&lt;br /&gt;
* Affiliation: Dept. of Mathematics, Dartmouth College&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: The Packet-Switching Brain: A Hypothesis&lt;br /&gt;
* Abstract: Despite great advances in our understanding of neural responses to natural stimuli, the basic structure of the neural code remains elusive. In this talk, I will describe a novel hypothesis regarding the fundamental structure of neural coding in mammals. In particular, I propose that an internet-like routing architecture (specifically packet-switching) underlies neocortical processing, and I propose means of testing this hypothesis via neural response sparseness measurements. I will synthesize a host of suggestive evidence that supports this notion and will, more generally, argue in favor of a large scale shift from the now dominant “computer metaphor,” to the “internet metaphor.” This shift is intended to spur new thinking with regard to neural coding, and its main contribution is to privilege communication over computation as the prime goal of neural systems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 December 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pietro Berkes&lt;br /&gt;
* Affiliation: Volen Center for Complex Systems, Brandeis University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Generative models of vision: from sparse coding toward structured models&lt;br /&gt;
* Abstract: From a computational perspective, one can think of visual perception as the problem of analyzing the light patterns detected by the retina to recover their external causes.  This process requires combining the incoming sensory evidence with internal prior knowledge about general properties of visual elements and the way they interact, and can be formalized in a class of models known as causal generative models.  In the first part of the talk, I will discuss the first and most established generative model, namely the sparse coding model. Sparse coding has been largely successful in showing how the main characteristics of simple cells receptive fields can be accounted for based uniquely on the statistics of natural images. I will briefly review the evidence supporting this model, and contrast it with recent data from the primary visual cortex of ferrets and rats showing that the sparseness of neural activity over development and anesthesia seems to follow trends opposite to those predicted by sparse coding.  In the second part, I will argue that the generative point of view calls for models of natural images that take into account more of the structure of the visual environment. I will present a model that takes a first step in this direction by incorporating the fundamental distinction between identity and attributes of visual elements. After learning, the model mirrors several aspects of the organization of V1, and results in a novel interpretation of complex and simple cells as parallel population of cells, coding for different aspects of the visual input. Further steps toward more structured generative models might thus lead to the development of a more comprehensive account of visual processing in the visual cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: U of Hawaii&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tom Dean&lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Accelerating Computer Vision and Machine Learning Algorithms with Graphics Processors&lt;br /&gt;
* Abstract: Graphics processors (GPUs) and massively-multi-core architectures are becoming more powerful, less costly and more energy efficient, and the related programming language issues are beginning to sort themselves out. That said most researchers don’t want to be writing code that depends on any particular architecture or parallel programming model. Linear algebra, Fourier analysis and image processing have standard libraries that are being ported to exploit SIMD parallelism in GPUs. We can depend on the massively-multiple-core machines du jour to support these libraries and on the high-performance-computing (HPC) community to do the porting for us or with us. These libraries can significantly accelerate important applications in image processing, data analysis and information retrieval. We can develop APIs and the necessary run-time support so that code relying on these libraries will run on any machine in a cluster of computers but exploit GPUs whenever available. This strategy allows us to move toward hybrid computing models that enable a wider range of opportunities for parallelism without requiring the special training of programmers or the disadvantages of developing code that depends on specialized hardware or programming models. This talk summarizes the state of the art in massively-multi-core architectures, presents experimental results that demonstrate the potential for significant performance gains in the two general areas of image processing and machine learning, provides examples of the proposed programming interface, and some more detailed experimental results on one particular problem involving video-content analysis.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Philiponna&lt;br /&gt;
* Affiliation: Paris&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;24 Feburary 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gordon Pipa&lt;br /&gt;
* Affiliation: U Osnabrueck/MPI Frankfurt&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gaute Einevoll&lt;br /&gt;
* Affiliation: UMB, Norway&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Harvey Swadlow&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alan Yuille &lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed (for 1pm)&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dharmendra Modha - cancelled&lt;br /&gt;
* Affiliation: IBM&lt;br /&gt;
* Host:Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Zipser&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: Brytes 2:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
Brytes are little brains that can be assembled into larger, smarter brains. In my first talk I presented a biologically plausible, computationally tractable model of brytes and described how they can be used as subunits to build brains with interesting behaviors.&lt;br /&gt;
&lt;br /&gt;
In this talk I will first show how large numbers of brytes can cooperate to perform complicated actions such as arm and hand manipulations in the presence of obstacles. Then I describe a strategy for a higher level of control that informs each bryte what role it should play in accomplishing the current task. These results could have considerable significance for understanding the brain and possibly be applicable to robotics and BMI.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Frank Werblin  (Redwood group meeting - internal only)&lt;br /&gt;
* Affiliation:  Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anna Judith&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little (Redwood Lab Meeting - internal only)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=7174</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=7174"/>
		<updated>2013-11-25T21:37:45Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Tentative / Confirmed Speakers */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Instructions ==&lt;br /&gt;
&lt;br /&gt;
# Check the internal calendar (here) for a free seminar slot. Seminars are usually Wednesdays at noon, but it is flexible in case there is a day that works better for the speaker.  However, it is usually best to avoid booking multiple speakers in the same week - it leads to &amp;quot;seminar burnout&amp;quot; and reduced attendance.  But use your own judgement here - if its a good opportunity and that&#039;s the only time that works then go ahead with it.&lt;br /&gt;
# Once you have proposed a date to a speaker, fill in the speaker information under the appropriate date (or change if necessary).  Use the status field to indicate whether the date is tentative or confirmed. Please also include your name as &#039;&#039;host&#039;&#039;  in case somebody wants to contact you.&lt;br /&gt;
# Once the invitation is confirmed with the speaker, change the status field to &#039;confirmed&#039;. Notify me [mailto:baolshausen@berkeley.edu] that we have a confirmed speaker so that I can update the public web page. Please include a title and abstract.&lt;br /&gt;
# Natalie (HWNI) checks our web page regularly and will send out an announcement a week before and also include with the weekly neuro announcements, but if you don&#039;t get it confirmed until the last minute then make sure to email Natalie  [mailto:nrterranova@berkeley.edu] as well to give her a heads up so she knows to send out an announcement in time.&lt;br /&gt;
# If the speaker needs accommodations you should contact Natalie [mailto:nrterranova@berkeley.edu] to reserve a room at the faculty club. Tell her its for a Redwood speaker so she knows how to bill it.&lt;br /&gt;
# During the visit you will need to look after the visitor, schedule visits with other labs, make plans for lunch, dinner, etc., and introduce at the seminar (don&#039;t ask Bruno to do this at the last moment).  Save receipts for any meals you paid for.&lt;br /&gt;
# After the seminar and before the speaker leaves, make sure to get their address and info for reimbursing travel expenses (receipts) and hand this over to Natalie, or if they prefer they can send these to Natalie after they get home.  Natalie can also help you with getting reimbursed for any expenses you incurred for meals and entertainment.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Zhenwen Dai&lt;br /&gt;
* Affiliation: FIAS, Goethe University Frankfurt, Germany.&lt;br /&gt;
* Host: Georgios&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kai Siedenburg&lt;br /&gt;
* Affiliation: UC Davis, Petr Janata&#039;s Lab.&lt;br /&gt;
* Host: Jesse Engel&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Matthias Bethge&lt;br /&gt;
* Affiliation: University of Tubingen&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Jan 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Klein&lt;br /&gt;
* Affiliation: Audience&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Feb 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Sutskever &lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Zayd&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Portera-Cailliau&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dean Buonomano&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 March 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Robert G. Smith&lt;br /&gt;
* Affiliation: University of Pennsylvania&lt;br /&gt;
* Host: Mike S&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 April 2014&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Guiseppe Vitiello&lt;br /&gt;
* Affiliation: University of Salerno&lt;br /&gt;
* Host: Fritz/Walter Freeman&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
== Previous Seminars ==&lt;br /&gt;
&lt;br /&gt;
=== 2013/14 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ekaterina Brocke&lt;br /&gt;
* Affiliation: KTH University, Stockholm, Sweden&lt;br /&gt;
* Host: Tony&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Multiscale modeling in Neuroscience: first steps towards multiscale co-simulation tool development.&lt;br /&gt;
* Abstract: Multiscale modeling/simulations attracts an increasing number of neuroscientists to study how different levels of organization (networks of neurons, cellular/subcellular levels) interact with each other across multiple scales, space and time, to mediate different brain functions. Different scales are usually described by different physical and mathematical formalisms thus making it non trivial to perform the integration. In this talk, I will discuss key phenomena in Neuroscience that can be addressed using subcellular/cellular models, possible approaches to perform multiscale simulations in particular a co-simulation method. I will also introduce several multiscale &amp;quot;toy&amp;quot; models of cellular/subcellular levels that were developed with the aim to understand numerical and technical problems which might appear during the co-simulation. And finally, the first steps made towards multiscale co-simulation tool development will be presented during the talk.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Oct 2013 - note: 4:00&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mitya Chkolovskii&lt;br /&gt;
* Affiliation: HHMI/Janelia Farm&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ilya Nemanman&lt;br /&gt;
* Affiliation: Emory University, Departments of Physics and Biology&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Large N in neural data -- expecting the unexpected.&lt;br /&gt;
* Abstract: Recently it has become possible to directly measure simultaneous collective states of many biological components, such as neural activities, genetic sequences, or gene expression profiles. These data are revealing striking results, suggesting, for example, that biological systems are tuned to criticality, and that effective models of these systems based on only pairwise interactions among constitutive components provide surprisingly good fits to the data. We will explore a handful of simplified theoretical models, largely focusing on statistical mechanics of Ising spins, that suggest plausible explanations for these observations. Specifically, I will argue that, at least in certain contexts, these intriguing observations should be expected in multivariate interacting data in the thermodynamic limit of many interacting components.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Oriol Vinyals&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno/Brian&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Beyond Deep Learning: Scalable Methods and Models for Learning&lt;br /&gt;
* Abstract: In this talk I will briefly describe several techniques I explored in my thesis that improve how to efficiently model signal representations and learn useful information from them. The building block of my dissertation is based on machine learning approaches to classification, where a (typically non-linear) function is learned from labeled examples to map from signals to some useful information (e.g. an object class present an image, or a word present in an acoustic signal). One of the motivating factors of my work has been advances in neural networks in deep architectures (which has led to the terminology &amp;quot;deep learning&amp;quot;), and that has shown state-of-the-art performance in acoustic modeling and object recognition -- the main focus of this thesis. In my work, I have contributed to both the learning (or training) of such architectures through faster and robust optimization techniques, and also to the simplification of the deep architecture model to an approach that is simple to optimize. Furthermore, I derived a theoretical bound showing a fundamental limitation of shallow architectures based on sparse coding (which can be seen as a one hidden layer neural network), thus justifying the need for deeper architectures, while also empirically verifying these architectural choices on speech recognition. Many of my contributions have been used in a wide variety of applications, products and datasets as a result of many collaborations within ICSI and Berkeley, but also at Microsoft Research and Google Research.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 Nov 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Garrett T. Kenyon&lt;br /&gt;
* Affiliation: Los Alamos National Laboratory, The New Mexico Consortium&lt;br /&gt;
* Host: Dylan Paiton&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Using Locally Competitive Algorithms to Model Top-Down and Lateral Interactions&lt;br /&gt;
* Abstract: Cortical connections consist of feedforward, feedback and lateral pathways.  Infragranular layers project down the cortical hierarchy to both supra- and infragranular layers at the previous processing level, while the neurons in supragranular layers are linked by extensive long-range lateral projections that cross multiple cortical columns. However, most functional models of visual cortex only account for feedforward connections. Additionally, most models of visual cortex fail to account both for the thalamic projections to non-striate areas and the reciprocal connections from extrastriate areas back to the thalamus. In this talk, I will describe how a modified Locally Competitive Algorithm (LCA; Rozell et al, Neural Comp, 2008) can be used as a unifying framework for exploring the role of top-down and lateral cortical pathways within the context of deep, sparse, generative models.  I will also describe an open source software tool called PetaVision that can be used to implement and execute hierarchical LCA-based models on multi-core, multi-node computer platforms without requiring specific knowledge of parallel-programming constructs.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Nov 2013 (note: Thursday), ***12:30pm*** &#039;&#039;&#039;&lt;br /&gt;
* Speaker: Geoffrey J Goodhill&lt;br /&gt;
* Affiliation: Queensland Brain Institute and School of Mathematics and Physics, The University of Queensland, Australia&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Computational principles of neural wiring development&lt;br /&gt;
* Abstract: Brain function depends on precise patterns of neural wiring. An axon navigating to its target must make guidance decisions based on noisy information from molecular cues in its environment. I will describe a combination of experimental and computational work showing that (1) axons may act as ideal observers when sensing chemotactic gradients, (2) the complex influence of calcium and cAMP levels on guidance decisions can be predicted mathematically, (3) the morphology of growth cones at the axonal tip can be understood in terms of just a few eigenshapes, and remarkably these shapes oscillate in time with periods ranging from minutes to hours. Together this work may shed light on how neural wiring goes wrong in some developmental brain disorders, and how best to promote appropriate regrowth of axons after injury.&lt;br /&gt;
&lt;br /&gt;
=== 2012/13 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Sept 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jason Yeatman&lt;br /&gt;
* Affiliation: Department of Psychology, Stanford University&lt;br /&gt;
* Host: Bruno/Susana Chung&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: The Development of White Matter and Reading Skills&lt;br /&gt;
* Abstract: The development of cerebral white matter involves both myelination and pruning of axons, and the balance between these two processes may differ between individuals. Cross-sectional measures of white matter development mask the interplay between these active developmental processes and their connection to cognitive development.  We followed a cohort of 39 children longitudinally for three years, and measured white matter development and reading development using diffusion tensor imaging and behavioral tests. In the left arcuate and inferior longitudinal fasciculus, children with above-average reading skills initially had low fractional anisotropy (FA) with a steady increase over the 3-year period, while children with below-average reading skills had higher initial FA that declined over time. We describe a dual-process model of white matter development that balances biological processes that have opposing effects on FA, such as axonal myelination and pruning, to explain the pattern of results.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Sophie Deneve&lt;br /&gt;
* Affiliation: Laboratoire de Neurosciences cognitives, ENS-INSERM&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Balanced spiking networks can implement dynamical systems with predictive coding&lt;br /&gt;
* Abstract: Neural networks can integrate sensory information and generate continuously varying outputs, even though individual neurons communicate only with spikes---all-or-none events. Here we show how this can be done efficiently if spikes communicate &amp;quot;prediction errors&amp;quot; between neurons. We focus on the implementation of linear dynamical systems and derive a spiking network model from a single optimization principle. Our model naturally accounts for two puzzling aspects of cortex. First, it provides a rationale for the tight balance and correlations between excitation and inhibition. Second, it predicts asynchronous and irregular firing as a consequence of predictive population coding, even in the limit of vanishing noise. We show that our spiking networks have error-correcting properties that make them far more accurate and robust than comparable rate models. Our approach suggests spike times do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly under-estimated.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gert Van Dijck&lt;br /&gt;
* Affiliation: Cambridge&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: A solution to identifying neurones using extracellular activity in awake animals: a probabilistic machine-learning approach&lt;br /&gt;
* Abstract: Electrophysiological studies over the last fifty years have been hampered by the difficulty of reliably assigning signals to identified cortical neurones. Previous studies have employed a variety of measures based on spike timing or waveform characteristics to tentatively classify other neurone types (Vos et al., Eur. J. Neurosci., 1999; Prsa et al., J. Neurosci., 2009), in some cases supported by juxtacellular labelling (Simpson et al., Prog. Brain Res., 2005; Holtzman et al., J. Physiol., 2006; Barmack and Yakhnitsa, J. Neurosci., 2008; Ruigrok et al., J. Neurosci., 2011), or intracellular staining and / or assessment of membrane properties (Chadderton et al., Nature, 2004; Jorntell and Ekerot, J. Neurosci., 2006; Rancz et al., Nature, 2007). Anaesthetised animals have been widely used as they can provide a ground-truth through neuronal labelling which is much harder to achieve in awake animals where spike-derived measures tend to be relied upon (Lansink et al., Eur. J. Neurosci., 2010). Whilst spike-shapes carry potentially useful information for classifying neuronal classes, they vary with electrode type and the geometric relationship between the electrode and the spike generation zone (Van Dijck et al., Int. J. Neural Syst., 2012). Moreover, spike-shape measurement is achieved with a variety of techniques, making it difficult to compare and standardise between laboratories.In this study we build probabilistic models on the statistics derived from the spike trains of spontaneously active neurones in the cerebellum and the ventral midbrain. The mean spike frequency in combination with the log-interval-entropy (Bhumbra and Dyball, J. Physiol.-London, 2004) of the inter-spike-interval distribution yields the highest prediction accuracy. The cerebellum model consists of two sub-models: a molecular layer - Purkinje layer model and a granular layer - Purkinje layer model. The first model identifies with high accuracy (92.7 %) molecular layer interneurones and Purkinje cells, while the latter identifies with high accuracy (99.2 %) Golgi cells, granule cells, mossy fibers and Purkinje cells. Furthermore, it is shown that the model trained on anaesthetized rat and decerebrate cat data has broad applicability to other species and behavioural states: anaesthetized mice (80 %), awake rabbits (94.2 %) and awake rhesus monkeys (89 - 90 %).Recently, opto-genetics allow to obtain a ground-truth about cell classes. Using opto-genetically identified GABA-ergic and dopaminergic cells we build similar statistical models to identify these neuron types from the ventral midbrain.Hence, this illustrates that our approach will be of general use to a broad variety of laboratories.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 23 Oct 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jaimie Sleigh&lt;br /&gt;
* Affiliation: University of Auckland&lt;br /&gt;
* Host: Fritz/Andrew Szeri&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Is General Anesthesia a failure of cortical information integration&lt;br /&gt;
* Abstract: General anesthesia and natural sleep share some commonalities and some differences. Quite a lot is known about the chemical and neuronal effects of general anesthetic drugs.  There are two main groups of anesthetic drugs, which can be distinguished by their effects on the EEG. The most commonly used drugs exert a strong GABAergic action; whereas a second group is characterized by minimal GABAergic effects, but significant NMDA blockade.  It is less clear which and how these various effects result in failure of the patient to wake up when the surgeon cuts them. I will present some results from experimental brain slice work, and theoretical mean field modelling of anesthesia and sleep, that support the idea that the final common mechanism of both types of anaesthesia is fragmentation of long distance information flow in the cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;31 Oct 2012&#039;&#039;&#039; (Halloween)&lt;br /&gt;
* Speaker: Jonathan Landy&lt;br /&gt;
* Affiliation: UCSB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Mean-field replica theory: review of basics and a new approach&lt;br /&gt;
* Abstract: Replica theory provides a general method for evaluating the mode of a distribution, and has varied applications to problems in statistical mechanics, signal processing, etc.  Evaluation of the formal expressions arising in replica theory represents a formidable technical challenge, but one that physicists have apparently intuited correct methods for handling.  In this talk, I will first provide a review of the historical development of replica theory, covering: 1) motivation,  2) the intuited ``Parisi-ansatz&amp;quot; solution,  3) continued controversies, and 4) a survey of applications (including to neural networks).  Following this, I will discuss an exploratory effort of mine, aimed at developing an ansatz-free solution method.  As an example, I will work out the phase diagram for a simple spin-glass model.  This talk is intended primarily as a tutorial.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Tom Griffiths&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host:Daniel Little&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Identifying human inductive biases&lt;br /&gt;
* Abstract: People are remarkably good at acquiring complex knowledge from limited data, as is required in learning causal relationships, categories, or aspects of language. Successfully solving inductive problems of this kind requires having good &amp;quot;inductive biases&amp;quot; - constraints that guide inductive inference. Viewed abstractly, understanding human learning requires identifying these inductive biases and exploring their origins. I will argue that probabilistic models of cognition provide a framework that can facilitate this project, giving a transparent characterization of the inductive biases of ideal learners. I will outline how probabilistic models are traditionally used to solve this problem, and then present a new approach that uses Markov chain Monte Carlo algorithms as the basis for an experimental method that magnifies the effects of inductive biases.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2012&#039;&#039;&#039; (Monday) (Thanksgiving week)&lt;br /&gt;
* Speaker: Bin Yu&lt;br /&gt;
* Affiliation: Dept. of Statistics and EECS, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Representation of Natural Images in V4&lt;br /&gt;
* Abstract: The functional organization of area V4 in the mammalian ventral visual pathway is far from being well understood. V4 is believed to play an important role in the recognition of shapes and objects and in visual attention, but the complexity of this cortical area makes it hard to analyze. In particular, no current model of V4 has shown good predictions for neuronal responses to natural images and there is no consensus on the primary role of V4.&lt;br /&gt;
In this talk, we present analysis of electrophysiological data on the response of V4 neurons to natural images. We propose a new computational model that achieves comparable prediction performance for V4 as for V1 neurons. Our model does not rely on any pre-defined image features but only on invariance and sparse coding principles. We interpret our model using sparse principal component analysis and discover two groups of neurons: those selective to texture versus those selective to contours. This supports the thesis that one primary role of V4 is to extract objects from background in the visual field.  Moreover, our study also confirms the diversity of V4 neurons. Among those selective to contours, some of them are selective to orientation, others to acute curvature features.&lt;br /&gt;
(This is joint work with J. Mairal, Y. Benjamini, B. Willmore, M. Oliver&lt;br /&gt;
and J. Gallant.)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 Nov 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:  Yan Karklin&lt;br /&gt;
* Affiliation:  NYU&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract: &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Dec 2012 (note this would be the Monday after NIPS)&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Marius Pachitariu&lt;br /&gt;
* Affiliation: Gatsby / UCL&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title:  NIPS paper &amp;quot;Learning visual motion in recurrent neural networks&amp;quot;&lt;br /&gt;
* Abstract: We present a dynamic nonlinear generative model for visual motion based on a&lt;br /&gt;
latent representation of binary-gated Gaussian variables connected in a network. &lt;br /&gt;
Trained on sequences of images by an STDP-like rule the model learns &lt;br /&gt;
to represent different movement directions in different variables. We use an online &lt;br /&gt;
approximate inference scheme that can be mapped to the dynamics of networks &lt;br /&gt;
of neurons. Probed with drifting grating stimuli and moving bars of light, neurons &lt;br /&gt;
in the model show patterns of responses analogous to those of direction-selective &lt;br /&gt;
simple cells in primary visual cortex. We show how the computations of the model &lt;br /&gt;
are enabled by a specific pattern of learnt asymmetric recurrent connections. &lt;br /&gt;
I will also briefly discuss our application of recurrent neural networks as statistical &lt;br /&gt;
models of simultaneously recorded spiking neurons. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 Dec 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Ian Goodfellow&lt;br /&gt;
* Affiliation: U Montreal&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Stuart Hammeroff&lt;br /&gt;
* Affiliation: University of Arizona &lt;br /&gt;
* Host: Gautam Agarwal&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Quantum cognition and brain microtubules &lt;br /&gt;
* Abstract: Cognitive decision processes are generally seen as classical Bayesian probabilities, but better suited to quantum mathematics. For example: 1) Psychological conflict, ambiguity and uncertainty can be viewed as (quantum) superposition of multiple possible judgments and beliefs. 2) Measurement (e.g. answering a question, reaching a decision) reduces possibilities to definite states (‘constructing reality’, ‘collapsing the wave function’). 3) Previous questions influence subsequent answers, so sequence affects outcomes (‘contextual non-commutativity’). 4) Judgments and choices may deviate from classical logic, suggesting random, or ‘non-computable’ quantum influences. Can quantum cognition operate in the brain? Do classical brain activities simulate quantum processes? Or have biomolecular quantum devices evolved? In this talk I will discuss how a finer scale, intra-neuronal level of quantum information processing in cytoskeletal microtubules can accumulate, operate upon and integrate quantum information and memory for self-collapse to classical states which regulate axonal firings, controlling behavior.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday 14 Jan 2013, 1:00pm&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dibyendu Mandal &lt;br /&gt;
* Affiliation: Physics Dept., University of Maryland (Jarzynski group)&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: An exactly solvable model of Maxwell’s demon&lt;br /&gt;
* Abstract: The paradox of Maxwell’s demon has stimulated numerous thought experiments, leading to discussions about the thermodynamic implications of information processing. However, the field has lacked a tangible example or model of an autonomous, mechanical system that reproduces the actions of the demon. To address this issue, we introduce an explicit model of a device that can deliver work to lift a mass against gravity by rectifying thermal fluctuations, while writing information to a memory register. We solve for the steady-state behavior of the model and construct its nonequilibrium phase diagram. In addition to the engine-like action described above, we identify a Landauer eraser region in the phase diagram where the model uses externally supplied work to remove information from the memory register. Our model offers a simple paradigm for investigating the thermodynamics of information processing by exposing a transparent mechanism of operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carlos Brody&lt;br /&gt;
* Affiliation: Princeton&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Neural substrates of decision-making in the rat&lt;br /&gt;
* Abstract: Gradual accumulation of evidence is thought to be a fundamental component of decision-making. Over the last 16 years, research in non-human primates has revealed neural correlates of evidence accumulation in parietal and frontal cortices, and other brain areas . However, the circuit mechanisms underlying these neural correlates remains unknown. Reasoning that a rodent model of evidence accumulation would allow a greater number of experimental subjects, and therefore experiments, as well as facilitate the use of molecular tools, we developed a rat accumulation of evidence task, the &amp;quot;Poisson Clicks&amp;quot; task. In this task, sensory evidence is delivered in pulses whose precisely-controlled timing varies widely within and across trials. The resulting data are analyzed with models of evidence accumulation that use the richly detailed information of each trial’s pulse timing to distinguish between different decision mechanisms. The method provides great statistical power, allowing us to: (1) provide compelling evidence that rats are indeed capable of gradually accumulating evidence for decision-making; (2) accurately estimate multiple parameters of the decision-making process from behavioral data; and (3) measure, for the first time, the diffusion constant of the evidence accumulator, which we show to be optimal (i.e., equal to zero). In addition, the method provides a trial-by-trial, moment-by-moment estimate of the value of the accumulator, which can then be compared in awake behaving electrophysiology experiments to trial-by-trial, moment-by-moment neural firing rate measures. Based on such a comparison, we describe data and a novel analysis approach that reveals differences between parietal and frontal cortices in the neural encoding of accumulating evidence. Finally, using semi-automated training methods to produce tens of rats trained in the Poisson Clicks accumulation of evidence task, we have also used pharmacological inactivation to ask, for the first time, whether parietal and frontal cortices are required for accumulation of evidence, and we are using optogenetic methods to rapidly and transiently inactivate brain regions so as to establish precisely when, during each decision-making trial, it is that each brain region&#039;s activity is necessary for performance of the task.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eugene M. Izhikevich&lt;br /&gt;
* Affiliation: Brain Corporation&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Spikes&lt;br /&gt;
* Abstract: Most communication in the brain is via spikes. While we understand the spike-generation mechanism of individual neurons, we fail to appreciate the spike-timing code and its role in neural computations. The speaker starts with simple models of neuronal spiking and bursting, describes small neuronal circuits that learn spike-timing code via spike-timing dependent plasticity (STDP), and finishes with biologically detailed and anatomically accurate large-scale brain models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Goren Gordon&lt;br /&gt;
* Affiliation: Weizman Intitute&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Hierarchical Curiosity Loops – Model, Behavior and Robotics&lt;br /&gt;
* Abstract: Autonomously learning about one&#039;s own body and its interaction with the environment is a formidable challenge, yet it is ubiquitous in biology: every animal’s pup and every human infant accomplish this task in their first few months of life. Furthermore, biological agents’ curiosity actively drives them to explore and experiment in order to expedite their learning progress. To bridge the gap between biological and artificial agents, a formal mathematical theory of curiosity was developed that attempts to explain observed biological behaviors and enable curiosity emergence in robots. In the talk, I will present the hierarchical curiosity loops model, its application to rodent’s exploratory behavior and its implementation in a fully autonomously learning and behaving reaching robot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Jan 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jenny Read&lt;br /&gt;
* Affiliation: Institute of Neuroscience, Newcastle University&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Stereoscopic vision&lt;br /&gt;
* Abstract: [To be written]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Valero Laparra&lt;br /&gt;
* Affiliation:  University of Valencia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Empirical statistical analysis of phases in Gabor filtered natural images&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Feb 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dolores Bozovic&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Bifurcations and phase-locking dynamics in the auditory system&lt;br /&gt;
* Abstract: The inner ear constitutes a remarkable biological sensor that exhibits nanometer-scale sensitivity of mechanical detection. The first step in auditory processing is performed by hair cells, which convert movement into electrical signals via opening of mechanically gated ion channels. These cells are operant in a viscous medium, but can nevertheless sustain oscillations, amplify incoming signals, and even exhibit spontaneous motility, indicating the presence of an underlying active amplification system. Theoretical models have proposed that a hair cell constitutes a nonlinear system with an internal feedback mechanism that can drive it across a bifurcation and into an unstable regime. Our experiments explore the nonlinear response as well as feedback mechanisms  that enable self-tuning already at the peripheral level, as measured in vitro on sensory tissue. A simple dynamic systems framework will be discussed, that captures the main features of the experimentally observed behavior in the form of an Arnold Tongue.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 March 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dale Purves&lt;br /&gt;
* Affiliation: Duke&lt;br /&gt;
* Host: Sarah&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: How Visual Evolution Determines What We See&lt;br /&gt;
* Abstract: Information about the physical world is excluded from visual stimuli by the nature of biological vision (the inverse optics problem). Nonetheless, humans and other visual animals routinely succeed in their environments. The talk will explain how the assignment of perceptual values to visual stimuli according to the frequency of occurrence of stimulus patterns resolves the inverse problem and determines the basic visual qualities we see. This interpretation of vision implies that the best (and perhaps the only) way to understand visual system circuitry is to evolve it, an idea supported by recent work.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mounya Elhilali&lt;br /&gt;
* Affiliation: Johns Hopkins&lt;br /&gt;
* Host: Tyler&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Attention at the cocktail party: Neural bases and computational strategies for auditory scene analysis&lt;br /&gt;
* Abstract: The perceptual organization of sounds in the environment into coherent objects is a feat constantly facing the auditory system. It manifests itself in the everyday challenge faced by humans and animals alike to parse complex acoustic information arising from multiple sound sources into separate auditory streams. While seemingly effortless, uncovering the neural mechanisms and computational principles underlying this remarkable ability remain a challenge for both the experimental and theoretical neuroscience communities. In this talk, I discuss the potential role of neuronal tuning in mammalian primary auditory cortex in mediating this process. I also examine the role of mechanisms of attention in adapting this neural representation to reflect both the sensory content and the changing behavioral context of complex acoustic scenes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;17th of April 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Wiktor Młynarski&lt;br /&gt;
* Affiliation: Max Planck Institute for Mathematics in the Sciences&lt;br /&gt;
* Host: Urs&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Statistical Models of Binaural Sounds&lt;br /&gt;
* Abstract: The auditory system exploits disparities in the sounds arriving at the left and right ear to extract information about the spatial configuration of sound sources. According to the widely acknowledged Duplex Theory, sounds of low frequency are localized based on Interaural Time Differences (ITDs) and localization of high frequency sources relies on Interaural Level Differences (ILDs). Natural sounds, however,  possess a rich structure and contain multiple frequency components.  This leads to the question: what are the contributions of different cues to sound position identification in the natural environment and how much information do they carry about its spatial structure? In this talk, I will present my attempts to answer the above questions using statistical, generative models of naturalistic (simulated) and fully natural binaural sounds.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Byron Yu&lt;br /&gt;
* Affiliation: CMU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 May 2013&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bijan Pesaran&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Bruno/Jose (jointly sponsored with CNEP)&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
=== 2011/12 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Sep 2011 (Thursday, at noon)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kathrin Berkner&lt;br /&gt;
* Affiliation: Ricoh Innovations Inc.&lt;br /&gt;
* Host: Ivana Tosic&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;21 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Mike Kilgard&lt;br /&gt;
* Affiliation: UT Dallas&lt;br /&gt;
* Host: Michael Silver&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 Sep 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Moshe Gur&lt;br /&gt;
* Affiliation: Dept. of Biomedical Engineering, Technion, Israel Institute of Technology&lt;br /&gt;
* Host: Bruno/Stan&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: On the unity of perception: How does the brain integrate activity evoked at different cortical loci?&lt;br /&gt;
* Abstract: Any physical device we know, including computers, when comparing A to B must send the information to point C. I have done experiments in three modalities, somato-sensory, auditory, and visual, where 2 different loci at the primary cortex are stimulated and I argue that the &amp;quot;machine&amp;quot; converging hypothesis cannot explain the perceptual results. Thus we must assume a non-converging mechanism whereby the  brain, at times, can compare (integrate, process) events that take place at different loci without sending the information to a common target. Once we allow for such a mechanism, many phenomena can be viewed differently. Take for example the question of how and where does multi-sensory integration take place;  we perceive a synchronized talking face yet detailed  visual and auditory information are represented at very different brain loci.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: University of Hawaii at Manoa&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Predictive power, memory and dissipation in learning systems operating far from thermodynamic equilibrium&lt;br /&gt;
* Abstract: Understanding the physical processes that underly the functioning of biological computing machinery often requires describing processes that occur far from thermodynamic equilibrium. In recent years significant progress has been made in this area, most notably Jarzynski’s work relation and Crooks’ fluctuation theorem. In this talk I will explore how dissipation of energy is related to a system&#039;s information processing inefficiency. The focus is on driven systems that are embedded in a stochastic operating environment. If we describe the system as a state machine, then we can interpret the stochastic dynamics as performing a computation that results in an (implicit) model of the stochastic driving signal. I will show that instantaneous non-predictive information, which serves as a measure of model inefficiency, provides a lower bound on the average dissipated work. This implies that learning systems with larger predictive power can operate more energetically efficiently. We could speculate that perhaps biological systems may have evolved to reflect this kind of adaptation. One interesting insight here is that purely physical notions require what is perfectly in line with the general belief that a useful model must be predictive (at fixed model complexity). Our result thereby ties together ideas from learning theory with basic non-equilibrium thermodynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Graham Cummins&lt;br /&gt;
* Affiliation: WSU&lt;br /&gt;
* Host: Jeff Teeters&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Oct 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Shinji Nishimoto&lt;br /&gt;
* Affiliation: Gallant lab, UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Dec 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Austin Roorda&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: How the unstable eye sees a stable and moving world&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ken Nakayama&lt;br /&gt;
* Affiliation: Harvard University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Subjective Contours&lt;br /&gt;
* Abstract: The concept of the receptive field in visual science has been transformative. It fueled great discoveries of the second half of the 20th C,   providing the dominant understanding of how the visual system works at its early stages.   Its reign has been extended to the field of object recognition where in the form of a linear classifier, it provides a framework to understand visual object recognition (DiCarlo and Cox, 2007).&lt;br /&gt;
Untamed, however, are areas of visual perception, now more or less ignored, dubbed variously as the 2.5 D sketch, mid-level vision, surface representations. Here, neurons with their receptive fields seem unable to bridge the gap, to supply us with even a plausible speculative framework to understand amodal completion, subjective contours and other surface phenomena.  Correspondingly, these areas have become backwater, ignored, leapt over.&lt;br /&gt;
Subjective contours, however, remain as vivid as ever, even more so.&lt;br /&gt;
Everyday, our visual system makes countless visual inferences as to the layout of the world surfaces and objects.  What’s remarkable is that subjective contours  visibly reveal these inferences.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday, 24 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aniruddha Das&lt;br /&gt;
* Affiliation: Columbia University&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;22 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Elad Schneidman &lt;br /&gt;
* Affiliation: Department of Neurobiology, Weizmann Institute of Science&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Sparse high order interaction networks underlie learnable neural population codes&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Feb 2012 (at noon as usual)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Heather Read&lt;br /&gt;
* Affiliation: U. Connecticut&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &amp;quot;Transformation of sparse temporal coding from auditory colliculus and cortex&amp;quot;&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Mar 2012 (note: Thurs)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Daniel Zoran&lt;br /&gt;
* Affiliation: Hebrew University, Jerusalem&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sivak&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ivan Schwab&lt;br /&gt;
* Affiliation: UC Davis&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Evolution&#039;s Witness: How Eyes Evolved&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;14 Mar 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Sussillo&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 April 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Kristofer Bouchard&lt;br /&gt;
* Affiliation: UCSF&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Cortical Foundations of Human Speech Production&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 May 2012&#039;&#039;&#039; (rescheduled from April 11)&lt;br /&gt;
* Speaker: Logan Grosenick&lt;br /&gt;
* Affiliation: Stanford, Deisseroth &amp;amp; Suppes Labs&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: Acquisition, creation, &amp;amp; analysis of 4D light fields with applications to calcium imaging &amp;amp; optogenetics&lt;br /&gt;
* Abstract: In Light Field Microscopy (LFM), images can be computationally refocused after they are captured [1]. This permits acquiring focal stacks and reconstructing volumes from a single camera frame. In Light Field Illumination (LFI), the same ideas can be used to create an illumination system that can deliver focused light to any position in a volume without moving optics, and these two devices (LFM/LFI) can be used together in the same system [2]. So far, these imaging and illumination systems have largely been used independently in proof-of-concept experiments [1,2]. In this talk I will discuss applications of a combined scanless volumetric imaging and volumetric illumination system applied to 4D calcium imaging and photostimulation of neurons in vivo and in vitro. The volumes resulting from these methods are large (&amp;gt;500,000 voxels per time point), collected at 10-100 frames per second, and highly correlated in space and time. Analyzing such data has required the development and application of machine learning methods appropriate to large, sparse, nonnegative data, as well as the estimation of neural graphical models from calcium transients. This talk will cover the reconstruction and creation of volumes in a microscope using Light Fields [1,2], and the current state-of-the-art for analyzing these large volumes in the context of calcium imaging and optogenetics. &lt;br /&gt;
&lt;br /&gt;
[1] M. Levoy, R. Ng, A. Adams, M. Footer, and M. Horowitz. Light Field Microscopy. ACM Transactions on Graphics 25(3), Proceedings of SIGGRAPH 2006.&lt;br /&gt;
[2] M. Levoy, Z. Zhang, and I. McDowall. Recording and controlling the 4D light field in a microscope. Journal of Microscopy, Volume 235, Part 2, 2009, pp. 144-162. Cover article.&lt;br /&gt;
&lt;br /&gt;
BIO: Logan received bachelors degrees with honors in Biology and Psychology from Stanford, and a Masters in Statistics from Stanford. He is a Ph.D. candidate in the Neurosciences Program working in the labs of Karl Deisseroth and Patrick Suppes, and a trainee at the Stanford Center for Mind, Brain, and Computation. He is interested in developing and applying novel computational imaging and machine learning techniques in order to observe, control, and understand neuronal circuit dynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 June 2012&#039;&#039;&#039; (Thursday)&lt;br /&gt;
* Speaker:  Mitya Chklovskii&lt;br /&gt;
* Affiliation: janelia&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Jerry Feldman&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Lucas Theis&lt;br /&gt;
* Affiliation: Matthias Bethge lab, Werner Reichardt Centre for Integrative Neuroscience, Tübingen&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Hierarchical models of natural images&lt;br /&gt;
* Abstract: Probabilistic models of natural images have been used to solve a variety of computer vision tasks as well as a means to better understand the computations performed by the visual system in the brain. A lot of theoretical considerations and biological observations point to the fact that natural image models should be hierarchically organized, yet to date, the best known models are still based on what is better described as shallow representations. In this talk, I will present two image models. One is based on the idea of Gaussianization for greedily constructing hierarchical generative models. I will show that when combined with independent subspace analysis, it is able to compete with the state of the art for modeling image patches. The other model combines mixtures of Gaussian scale mixtures with a directed graphical model and multiscale image representations and is able to generate highly structured images of arbitrary size. Evaluating the model&#039;s likelihood and comparing it to a large number of other image models shows that it might well be the best model for natural images yet.&lt;br /&gt;
&lt;br /&gt;
(joint work with Reshad Hosseini and Matthias Bethge)&lt;br /&gt;
&lt;br /&gt;
=== 2010/11 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;02 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Johannes Burge&lt;br /&gt;
* Affiliation: University of Texas at Austin&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tobi Szuts&lt;br /&gt;
* Affiliation: Meister Lab/ Harvard U.&lt;br /&gt;
* Host: Mike DeWeese&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Wireless recording of neural activity in the visual cortex of a freely moving rat.&lt;br /&gt;
* Abstract: Conventional neural recording systems restrict behavioral experiments to a flat indoor environment compatible with the cable that tethers the subject to the recording instruments. To overcome these constraints, we developed a wireless multi-channel system for recording neural signals from a freely moving animal the size of a rat or larger. The device takes up to 64 voltage signals from implanted electrodes, samples each at 20 kHz, time-division multiplexes them onto a single output line, and transmits that output by radio frequency to a receiver and recording computer up to &amp;gt;60 m away. The system introduces less than 4 ?V RMS of electrode-referred noise, comparable to wired recording systems and considerably less than biological noise. The system has greater channel count or transmission distance than existing telemetry systems. The wireless system has been used to record from the visual cortex of a rat during unconstrained conditions. Outdoor recordings show V1 activity is modulated by nest-building activity. During unguided behavior indoors, neurons responded rapidly and consistently to changes in light level, suppressive effects were prominent in response to an illuminant transition, and firing rate was strongly modulated by locomotion. Neural firing in the visual cortex is relatively sparse and moderate correlations are observed over large distances, suggesting that synchrony is driven by global processes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Sep 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vikash Gilja&lt;br /&gt;
* Affiliation: Stanford University&lt;br /&gt;
* Host: Charles&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Towards Clinically Viable Neural Prosthetic Systems.&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 Oct 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alexandre Francois&lt;br /&gt;
* Affiliation: USC&lt;br /&gt;
* Host: &lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Eric Jonas and Vikash Mansinghka&lt;br /&gt;
* Affiliation:  Navia Systems&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Natively Probabilistic Computation: Principles, Artifacts, Architectures and Applications&lt;br /&gt;
* Abstract: Complex probabilistic models and Bayesian inference are becoming&lt;br /&gt;
increasingly critical across science and industry, especially in&lt;br /&gt;
large-scale data analysis. They are also central to our best&lt;br /&gt;
computational accounts of human cognition, perception and action.&lt;br /&gt;
However, all these efforts struggle with the infamous curse of&lt;br /&gt;
dimensionality. Rich probabilistic models can seem hard to write and&lt;br /&gt;
even harder to solve, as specifying and calculating probabilities&lt;br /&gt;
often appears to require the manipulation of exponentially (and&lt;br /&gt;
sometimes infinitely) large tables of numbers.&lt;br /&gt;
&lt;br /&gt;
We argue that these difficulties reflect a basic mismatch between the&lt;br /&gt;
needs of probabilistic reasoning and the deterministic, functional&lt;br /&gt;
orientation of our current hardware, programming languages and CS&lt;br /&gt;
theory. To mitigate these issues, we have been developing a stack of&lt;br /&gt;
abstractions for natively probabilistic computation, based around&lt;br /&gt;
stochastic simulators (or samplers) for distributions, rather than&lt;br /&gt;
evaluators for deterministic functions. Ultimately, our aim is to&lt;br /&gt;
produce a model of computation and the associated hardware and&lt;br /&gt;
programming tools that are as suited for uncertain inference and&lt;br /&gt;
decision-making as our current computers are for precise arithmetic.&lt;br /&gt;
&lt;br /&gt;
In this talk, we will give an overview of the entire stack of&lt;br /&gt;
abstractions supporting natively probabilistic computation, with&lt;br /&gt;
technical detail on several hardware and software artifacts we have&lt;br /&gt;
implemented so far. we will also touch on some new theoretical results&lt;br /&gt;
regarding the computational complexity of probabilistic programs.&lt;br /&gt;
Throughout, we will motivate and connect this work to some current&lt;br /&gt;
applications in biomedical data analysis and computer vision, as well&lt;br /&gt;
as potential hypotheses regarding the implementation of probabilistic&lt;br /&gt;
computation in the brain.&lt;br /&gt;
&lt;br /&gt;
This talk includes joint work with Keith Bonawitz, Beau Cronin,&lt;br /&gt;
Cameron Freer, Daniel Roy and Joshua Tenenbaum.&lt;br /&gt;
&lt;br /&gt;
BRIEF BIOGRAPHY&lt;br /&gt;
&lt;br /&gt;
Vikash Mansinghka is a co-founder and the CTO of Navia Systems, a&lt;br /&gt;
venture-funded startup company building natively probabilistic&lt;br /&gt;
computing machines. He spent 10 years at MIT, eventually earning an&lt;br /&gt;
SB. in Mathematics, an SB. in Computer Science, an MEng in Computer&lt;br /&gt;
Science, and a PhD in Computation. He held graduate fellowships from&lt;br /&gt;
the NSF and MIT&#039;s Lincoln Laboratories, and his PhD dissertation won&lt;br /&gt;
the 2009 MIT George M. Sprowls award for best dissertation in computer&lt;br /&gt;
science. He currently serves on DARPA&#039;s Information Science and&lt;br /&gt;
Technology (ISAT) Study Group.&lt;br /&gt;
&lt;br /&gt;
Eric Jonas is a co-founder of Navia Systems, responsible for in-house&lt;br /&gt;
accelerated inference research and development. He spent ten years at&lt;br /&gt;
MIT, where he earned SB degrees in electrical engineering and computer&lt;br /&gt;
science and neurobiology, an MEng in EECS, with a neurobiology PhD&lt;br /&gt;
expected really soon.  He’s passionate about biological applications&lt;br /&gt;
of probabilistic reasoning and hopes to use Navia’s capabilities to&lt;br /&gt;
combine data from biological science, clinical histories, and patient&lt;br /&gt;
outcomes into seamless models.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Patrick Ruther&lt;br /&gt;
* Affiliation:  Imtek, University of Freiburg&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract: TBD&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;10 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Aurel Lazar&lt;br /&gt;
* Affiliation: Department of Electrical Engineering, Columbia University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Encoding Visual Stimuli with a Population of Hodgkin-Huxley Neurons&lt;br /&gt;
* Abstract: We first present a general framework for the reconstruction of natural video&lt;br /&gt;
scenes encoded with a population of spiking neural circuits with random thresholds.&lt;br /&gt;
The visual encoding system consists of a bank of filters, modeling the visual&lt;br /&gt;
receptive fields, in cascade with a population of neural circuits, modeling encoding&lt;br /&gt;
with spikes in the early visual system.&lt;br /&gt;
The neuron models considered include integrate-and-fire neurons and ON-OFF&lt;br /&gt;
neuron pairs with threshold-and-fire spiking mechanisms. All thresholds are assumed&lt;br /&gt;
to be random. We show that for both time-varying and space-time-varying stimuli neural&lt;br /&gt;
spike encoding is akin to taking noisy measurements on the stimulus.&lt;br /&gt;
Second, we formulate the reconstruction problem as the minimization of a&lt;br /&gt;
suitable cost functional in a finite-dimensional vector space and provide an explicit&lt;br /&gt;
algorithm for stimulus recovery. We also present a general solution using the theory of&lt;br /&gt;
smoothing splines in Reproducing Kernel Hilbert Spaces. We provide examples of both&lt;br /&gt;
synthetic video as well as for natural scenes and show that the quality of the&lt;br /&gt;
reconstruction degrades gracefully as the threshold variability of the neurons increases.&lt;br /&gt;
Third, we demonstrate a number of simple operations on the original visual stimulus&lt;br /&gt;
including translations, rotations and zooming. All these operations are natively executed&lt;br /&gt;
in the spike domain. The processed spike trains are decoded for the faithful recovery&lt;br /&gt;
of the stimulus and its transformations.&lt;br /&gt;
Finally, we extend the above results to neural encoding circuits built with Hodking-Huxley&lt;br /&gt;
neurons.&lt;br /&gt;
References:&lt;br /&gt;
Aurel A. Lazar, Eftychios A. Pnevmatikakis and Yiyin Zhou,&lt;br /&gt;
Encoding Natural Scenes with Neural Circuits with Random Thresholds, Vision Research, 2010,&lt;br /&gt;
Special Issue on Mathematical Models of Visual Coding,&lt;br /&gt;
http://dx.doi.org/10.1016/j.visres.2010.03.015&lt;br /&gt;
Aurel A. Lazar,&lt;br /&gt;
Population Encoding with Hodgkin-Huxley Neurons,&lt;br /&gt;
IEEE Transactions on Information Theory, Volume 56, Number 2, pp. 821-837, February, 2010,&lt;br /&gt;
Special Issue on Molecular Biology and Neuroscience,&lt;br /&gt;
http://dx.doi.org/10.1109/TIT.2009.2037040&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;11 Nov 2010&#039;&#039;&#039; (UCB holiday)&lt;br /&gt;
* Speaker: Martha Nari Havenith&lt;br /&gt;
* Affiliation: UCL&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Finding spike timing in the visual cortex - Oscillations as the internal clock of vision?&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Nov 2010&#039;&#039;&#039;  (note: on Friday because of SFN)&lt;br /&gt;
* Speaker: Dan Butts&lt;br /&gt;
* Affiliation: UMD&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Common roles of inhibition in visual and auditory processing.&lt;br /&gt;
* Abstract: The role of inhibition in sensory processing is often obscured in extracellular recordings, because the absence of a neuronal response associated with inhibition might also be explained by a simple lack of excitation. However, increasingly, evidence from intracellular recordings demonstrates important roles of inhibition in shaping the stimulus selectivity of sensory neurons in both the visual and auditory systems. We have developed a nonlinear modeling approach that can identify putative excitatory and inhibitory inputs to a neuron using standard extracellular recordings, and have applied these techniques to understand the role of inhibition in shaping sensory processing in visual and auditory areas.  In pre-cortical visual areas (retina and LGN), we find that inhibition likely plays a role in generating temporally precise responses, and mediates adaptation to changing contrast. In an auditory pre-cortical area (inferior colliculus) identified inhibition has nearly identical appearance and functions in temporal processing and adaptation. Thus, we predict common roles of inhibition in these sensory areas, and more generally demonstrate general methods for characterizing the nonlinear computations that comprise sensory processing.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;24 Nov 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eizaburo Doi&lt;br /&gt;
* Affiliation: NYU&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;29 Nov 2010 - informal talk&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Eero Lehtonen&lt;br /&gt;
* Affiliation: UTU Finland&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Memristors&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gadi Geiger&lt;br /&gt;
* Affiliation: MIT&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Visual and Auditory Perceptual Modes that Characterize Dyslexics&lt;br /&gt;
* Abstract: I will describe how dyslexics’ visual and auditory perception is wider and more diffuse than that of typical readers. This suggests wider neural tuning in dyslexics. In addition I will describe how this processing relates to difficulties in reading. Strengthening the argument and more so helping dyslexics I will describe a regimen of practice that results in improved reading in dyslexics while narrowing perception.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;13 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Jorg Lueke&lt;br /&gt;
* Affiliation: FIAS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Linear and Non-linear Approaches to Component Extraction and Their Applications to Visual Data&lt;br /&gt;
* Abstract:  In the nervous system of humans and animals, sensory data are represented as combinations of elementary data components. While for data such as sound waveforms the elementary components combine linearly, other data can better be modeled by non-linear forms of component superpositions. I motivate and discuss two models with binary latent variables: one using standard linear superpositions of basis functions and one using non-linear superpositions.  Crucial for the applicability of both models are efficient learning procedures. I briefly introduce a novel training scheme (ET) and show how it can be applied to probabilistic generative models. For linear and non-linear models the scheme efficiently infers the basis functions as well as the level of sparseness and data noise.  In large-scale applications to image patches, we show results on the statistics of inferred model parameters. Differences between the linear and non-linear models are discussed, and both models are compared to results of standard approaches in the literature and to experimental findings.  Finally, I briefly discuss learning in a recent model that takes explicit component occlusions into account.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Dec 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Claudia Clopath&lt;br /&gt;
* Affiliation: Universite Paris Decartes&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Siwei Lyu&lt;br /&gt;
* Affiliation: Computer Science Department, University at Albany, SUNY&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: confirmed &lt;br /&gt;
* Title: Divisive Normalization as an Efficient Coding Transform: Justification and Evaluation&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  David Field (informal talk)&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;25 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ruth Rosenholtz&lt;br /&gt;
* Affiliation: Dept. of Brain &amp;amp; Cognitive Sciences, Computer Science and AI Lab, MIT&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: What your visual system sees where you are not looking&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 Jan 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Ernst Niebur&lt;br /&gt;
* Affiliation: Johns Hopkins U&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Vladimir Itskov&lt;br /&gt;
* Affiliation: University of Nebraska-Lincoln&lt;br /&gt;
* Host: Chris&lt;br /&gt;
* Status: Confirmed &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;23 March 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Bruce Cumming&lt;br /&gt;
* Affiliation: National Institutes of Health&lt;br /&gt;
* Host: Ivana&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBD&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 April 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Lubomir Bourdev&lt;br /&gt;
* Affiliation: Computer Science, UC Berkeley&lt;br /&gt;
* Host:Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &amp;quot;Poselets and Their Applications in High-Level Computer Vision Problems&amp;quot;&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2011 (note: Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Jack Culpepper&lt;br /&gt;
* Affiliation: Redwood Center/EECS&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title:  TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;26 May 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Ian Stevenson&lt;br /&gt;
* Affiliation:  Northwestern University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Explaining tuning curves by estimating interactions between neurons&lt;br /&gt;
* Abstract: One of the central tenets of systems neuroscience is that tuning curves are a byproduct of the interactions between neurons. Using multi-electrode recordings and recently developed inference techniques we can begin to examine this idea in detail and study how well we can explain the functional properties of neurons using the activity of other simultaneously recorded neurons. Here we examine datasets from 6 different brain areas recorded during typical sensorimotor tasks each with ~100 simultaneously recorded neurons. Using these datasets we measured the extent to which interactions between neurons can explain the tuning properties of individual neurons. We found that, in almost all areas, modeling interactions between 30-50 neurons allows more accurate spike prediction than tuning curves. This suggests that tuning can, in some sense, be explained by interactions between neurons in a variety of brain areas, even when recordings consist of relatively small numbers of neurons.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker:  Michael Oliver&lt;br /&gt;
* Affiliation: Gallant lab&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative &lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 June 2011&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alyson Fletcher&lt;br /&gt;
* Affiliation: UC Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: tentative&lt;br /&gt;
* Title: Generalized Approximate Message Passing for Neural Receptive Field Estimation and Connectivity&lt;br /&gt;
* Abstract:  Fundamental to understanding sensory encoding and connectivity of neurons are effective tools for developing and validating complex mathematical models from experimental data.  In this talk, I present a graphical models approach to the problems of neural connectivity reconstruction under multi-neuron excitation and to receptive field estimation of sensory neurons in response to stimuli.  I describe a new class of Generalized Approximate Message Passing (GAMP) algorithms for a general class of inference problems on graphical models based Gaussian approximations of loopy belief propagation.  The GAMP framework is extremely general, provides a systematic procedure for incorporating a rich class of nonlinearities, and is computationally tractable with large amounts of data.  In addition, for both the connectivity reconstruction and parameter estimation problems, I show that GAMP-based estimation can naturally incorporate sparsity constraints in the model that arise from the fact that only a small fraction of the potential inputs have any influence on the output of a particular neuron.  A simulation of reconstruction of cortical neural mapping under multi-neuron excitation shows that GAMP offers  improvement over previous compressed sensing methods.  The GAMP method is also validated on estimation of linear nonlinear Poisson (LNP) cascade models for neural responses of salamander retinal ganglion cells.&lt;br /&gt;
&lt;br /&gt;
=== 2009/10 academic year ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2 September 2009&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Keith Godfrey&lt;br /&gt;
* Affiliation: University of Cambridge&lt;br /&gt;
* Host: Tim&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;7 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anita Schmid&lt;br /&gt;
* Affiliation: Cornell University&lt;br /&gt;
* Host: Kilian&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Subpopulations of neurons in visual area V2 perform differentiation and integration operations in space and time&lt;br /&gt;
* Abstract: The interconnected areas of the visual system work together to find object boundaries in visual scenes. Primary visual cortex (V1) mainly extracts oriented luminance boundaries, while secondary visual cortex (V2) also detects boundaries defined by differences in texture. How the outputs of V1 neurons are combined to allow for the extraction of these more complex boundaries in V2 is as of yet unclear. To address this question, we probed the processing of orientation signals in single neurons in V1 and V2, focusing on response dynamics of neurons to patches of oriented gratings and to combinations of gratings in neighboring patches and sequential time frames. We found two kinds of response dynamics in V2, both of which are different from those of V1 neurons. While V1 neurons in general prefer one orientation, one subpopulation of V2 neurons (“transient”) shows a temporally dynamic preference, resulting in a preference for changes in orientation. The second subpopulation of V2 neurons (“sustained”) responds similarly to V1 neurons, but with a delay. The dynamics of nonlinear responses to combinations of gratings reinforce these distinctions: the dynamics enhance the preference of V1 neurons for continuous orientations, and enhance the preference of V2 transient neurons for discontinuous ones. We propose that transient neurons in V2 perform a differentiation operation on the V1 input, both spatially and temporally, while the sustained neurons perform an integration operation. We show that a simple feedforward network with delayed inhibition can account for the temporal but not for the spatial differentiation operation.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 October 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Andrea Benucci&lt;br /&gt;
* Affiliation: Institute of Ophthalmology, University College London&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Stimulus dependence of the functional connectivity between neurons in primary visual cortex&lt;br /&gt;
* Abstract:  It is known that visual stimuli are encoded by the concerted activity of large populations of neurons in visual cortical areas. However, it is only recently that recording techniques have been made available to study such activations from large ensembles of neurons simultaneously, with millisecond temporal precision and tens of microns spatial resolution. I will present data from voltage-sensitive dye (VSD) imaging and multi-electrode recordings (“Utah” probes) from the primary visual cortex of the cat (V1).  I will discuss the relationship between two fundamental cortical maps of the visual system: the map of retinotopy and the map of orientation. Using spatially localized and full-field oriented stimuli, we studied the functional interdependency of these maps. I will describe traveling and standing waves of cortical activity and their key role as a dynamical substrate for the spatio-temporal coding of visual information.  I will further discuss the properties of the spatio-temporal code in the context of continuous visual stimulation.  While recording population responses to a sequence of oriented stimuli, we asked how responses to individual stimuli summate over time. We found that such rules are mostly linear, supporting the idea that spatial and temporal codes in area V1 operate largely independently. However, these linear rules of summation fail when the visual drive is removed, suggesting that the visual cortex can readily switch between a dynamical regime where either feed-forward or intra-cortical inputs determine the response properties of the network.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 November 2009 (Thursday)&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Song-Chun Zhu&lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Jimmy&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;18 November 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dan Graham&lt;br /&gt;
* Affiliation: Dept. of Mathematics, Dartmouth College&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: The Packet-Switching Brain: A Hypothesis&lt;br /&gt;
* Abstract: Despite great advances in our understanding of neural responses to natural stimuli, the basic structure of the neural code remains elusive. In this talk, I will describe a novel hypothesis regarding the fundamental structure of neural coding in mammals. In particular, I propose that an internet-like routing architecture (specifically packet-switching) underlies neocortical processing, and I propose means of testing this hypothesis via neural response sparseness measurements. I will synthesize a host of suggestive evidence that supports this notion and will, more generally, argue in favor of a large scale shift from the now dominant “computer metaphor,” to the “internet metaphor.” This shift is intended to spur new thinking with regard to neural coding, and its main contribution is to privilege communication over computation as the prime goal of neural systems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 December 2009&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Pietro Berkes&lt;br /&gt;
* Affiliation: Volen Center for Complex Systems, Brandeis University&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Generative models of vision: from sparse coding toward structured models&lt;br /&gt;
* Abstract: From a computational perspective, one can think of visual perception as the problem of analyzing the light patterns detected by the retina to recover their external causes.  This process requires combining the incoming sensory evidence with internal prior knowledge about general properties of visual elements and the way they interact, and can be formalized in a class of models known as causal generative models.  In the first part of the talk, I will discuss the first and most established generative model, namely the sparse coding model. Sparse coding has been largely successful in showing how the main characteristics of simple cells receptive fields can be accounted for based uniquely on the statistics of natural images. I will briefly review the evidence supporting this model, and contrast it with recent data from the primary visual cortex of ferrets and rats showing that the sparseness of neural activity over development and anesthesia seems to follow trends opposite to those predicted by sparse coding.  In the second part, I will argue that the generative point of view calls for models of natural images that take into account more of the structure of the visual environment. I will present a model that takes a first step in this direction by incorporating the fundamental distinction between identity and attributes of visual elements. After learning, the model mirrors several aspects of the organization of V1, and results in a novel interpretation of complex and simple cells as parallel population of cells, coding for different aspects of the visual input. Further steps toward more structured generative models might thus lead to the development of a more comprehensive account of visual processing in the visual cortex.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;6 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Susanne Still&lt;br /&gt;
* Affiliation: U of Hawaii&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Tom Dean&lt;br /&gt;
* Affiliation: Google&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: Accelerating Computer Vision and Machine Learning Algorithms with Graphics Processors&lt;br /&gt;
* Abstract: Graphics processors (GPUs) and massively-multi-core architectures are becoming more powerful, less costly and more energy efficient, and the related programming language issues are beginning to sort themselves out. That said most researchers don’t want to be writing code that depends on any particular architecture or parallel programming model. Linear algebra, Fourier analysis and image processing have standard libraries that are being ported to exploit SIMD parallelism in GPUs. We can depend on the massively-multiple-core machines du jour to support these libraries and on the high-performance-computing (HPC) community to do the porting for us or with us. These libraries can significantly accelerate important applications in image processing, data analysis and information retrieval. We can develop APIs and the necessary run-time support so that code relying on these libraries will run on any machine in a cluster of computers but exploit GPUs whenever available. This strategy allows us to move toward hybrid computing models that enable a wider range of opportunities for parallelism without requiring the special training of programmers or the disadvantages of developing code that depends on specialized hardware or programming models. This talk summarizes the state of the art in massively-multi-core architectures, presents experimental results that demonstrate the potential for significant performance gains in the two general areas of image processing and machine learning, provides examples of the proposed programming interface, and some more detailed experimental results on one particular problem involving video-content analysis.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;27 January 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Philiponna&lt;br /&gt;
* Affiliation: Paris&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;24 Feburary 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gordon Pipa&lt;br /&gt;
* Affiliation: U Osnabrueck/MPI Frankfurt&lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Gaute Einevoll&lt;br /&gt;
* Affiliation: UMB, Norway&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: TBA&lt;br /&gt;
* Abstract: TBA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4 March 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Harvey Swadlow&lt;br /&gt;
* Affiliation: &lt;br /&gt;
* Host: Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Alan Yuille &lt;br /&gt;
* Affiliation: UCLA&lt;br /&gt;
* Host: Amir&lt;br /&gt;
* Status: Confirmed (for 1pm)&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;28 April 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Dharmendra Modha - cancelled&lt;br /&gt;
* Affiliation: IBM&lt;br /&gt;
* Host:Fritz&lt;br /&gt;
* Status: Confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;5 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: David Zipser&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: Brytes 2:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
Brytes are little brains that can be assembled into larger, smarter brains. In my first talk I presented a biologically plausible, computationally tractable model of brytes and described how they can be used as subunits to build brains with interesting behaviors.&lt;br /&gt;
&lt;br /&gt;
In this talk I will first show how large numbers of brytes can cooperate to perform complicated actions such as arm and hand manipulations in the presence of obstacles. Then I describe a strategy for a higher level of control that informs each bryte what role it should play in accomplishing the current task. These results could have considerable significance for understanding the brain and possibly be applicable to robotics and BMI.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;12 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Frank Werblin  (Redwood group meeting - internal only)&lt;br /&gt;
* Affiliation:  Berkeley&lt;br /&gt;
* Host: Bruno&lt;br /&gt;
* Status: Tentative&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;19 May 2010&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Anna Judith&lt;br /&gt;
* Affiliation: UCB&lt;br /&gt;
* Host: Daniel Little (Redwood Lab Meeting - internal only)&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Cluster&amp;diff=7058</id>
		<title>Cluster</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Cluster&amp;diff=7058"/>
		<updated>2013-07-08T21:40:34Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* ssh to the gateway computer (hadley) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Video Tutorial=&lt;br /&gt;
&lt;br /&gt;
Taught by our cluster aficionado and computer master, Mayur Mudigonda.  Please watch and or read below information it before asking him questions: [https://archive.org/details/MayurClusterTutorial_201304]&lt;br /&gt;
&lt;br /&gt;
= General Information =&lt;br /&gt;
&lt;br /&gt;
Contrary to popularly held belief, our cluster is not a magical computational powerhorse that will take your code and make it run hundreds of times faster. Read on to find out what it is, and how you might utilize it. &lt;br /&gt;
&lt;br /&gt;
We have about a dozen somewhat heterogeneous machines, many of which can be matched or exceeded in performance today by purchasing a $300-$400 desktop, or a laptop costing twice as much. There are exceptions to this. For example, there are a couple of machines which have graphics cards (GPUs) which cost about the same, but to take advantage of them, your code needs to be written specifically for the GPU using CUDA / OpenCL or it needs to call into libraries and packages which do that dirty work for you, such as PyCUDA / PyOpenCL or Jacket for Matlab. A few machines have a bit of extra memory (12-16G). The network connectivity is comparable to what we have in the lab (i.e. it is &#039;&#039;&#039;not&#039;&#039;&#039; some exotic ultra fast network interface utilizing a fancy topology).&lt;br /&gt;
&lt;br /&gt;
Given the above, the typical use cases for the cluster are that you have jobs that run in parallel which are independent, so having several machines will complete the task faster, even though any one machine might not be faster than your own laptop. Or you have a long running job which may take a day, and you don&#039;t want to worry about having to leave your laptop on at all times and not be able to use it. Another reason is that your code leverages a communication scheme (such as MPI) to have multiple machines cooperatively work on a problem. In order for the cluster to be useful and well-utilized, it works best for everyone to submit jobs (see &#039;&#039;&#039;qsub&#039;&#039;&#039; further down on this page for the details) to the queue which may not start right away, but which will get run once their turn comes. Please do not run extended interactive sessions or ssh directly to worker nodes for performing computation.&lt;br /&gt;
&lt;br /&gt;
== Hardware Overview == &lt;br /&gt;
&lt;br /&gt;
We are in the process of upgrading the older machines in the cluster. We currently have:&lt;br /&gt;
  #   Node names   CPU type           Speed   CPU count		Memory	Vintage	GPU &lt;br /&gt;
  2x  n0000-n0001  Intel Xeon E5410 @ 2.33GHz dual 4-core	16GB	2007 	Tesla GPUs&lt;br /&gt;
  10x n0002-n0011 Intel Xeon E3-1220 @ 3.1GHz 4-core 		16GB	2012	no GPU&lt;br /&gt;
  2x  n0012-n0013  Intel Xeon X5650 @ 2.66GHz dual 6-core	24GB	2010 	Fermi GPUs&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
In addition to the compute nodes we own a file server&lt;br /&gt;
  NetOp 4TB&lt;br /&gt;
which is mounted as scratch space.&lt;br /&gt;
&lt;br /&gt;
== Getting an account and crypto card == &lt;br /&gt;
If reading the above does not deter you, in order to get an account on the cluster, please send an email to Mayur Mudigonda (lastname AT berk...edu) with the following information:&lt;br /&gt;
&lt;br /&gt;
    Full Name &amp;lt;emailaddress&amp;gt; desiredusername&lt;br /&gt;
&lt;br /&gt;
You can also include a note about which PI you are working with. Note: the &#039;&#039;&#039;desireusername&#039;&#039;&#039; must be 3-8 characters long, so it would have been truncated to &#039;&#039;&#039;desireus&#039;&#039;&#039; in this case.&lt;br /&gt;
&lt;br /&gt;
It takes the SCS folks about one to two weeks to make the accounts and ship a new crypto card token to you. You&#039;ll need to sign and fax back to them a form that arrives with the crypto card, and then leave the hardcopy of it in my box. -pi&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;OTP (One Time Password) Service&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Once you have a username you can follow the instructions found here https://commons.lbl.gov/display/itfaq/OTP+%28One+Time+Password%29+Service to get access to the cluster (see &#039;&#039;&#039;Installing and Configuring the OTP Token&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
== Directory setup ==&lt;br /&gt;
&lt;br /&gt;
=== home directory quota ===&lt;br /&gt;
&lt;br /&gt;
There is a 10GB quota limit enforced on $HOME directory&lt;br /&gt;
(/global/home/users/username) usage. Please keep your usage below&lt;br /&gt;
this limit. There will NETAPP snapshots in place in this file&lt;br /&gt;
system so we suggest you store only your source code and scripts&lt;br /&gt;
in this area and store all your data under /clusterfs/cortex&lt;br /&gt;
(see below).&lt;br /&gt;
&lt;br /&gt;
In order to see your current quota and usage, use the following command:&lt;br /&gt;
&lt;br /&gt;
  quota -s&lt;br /&gt;
&lt;br /&gt;
=== data ===&lt;br /&gt;
&lt;br /&gt;
For large amounts of data, please create a directory&lt;br /&gt;
&lt;br /&gt;
  /clusterfs/cortex/scratch/username&lt;br /&gt;
&lt;br /&gt;
and store the data inside that directory. Note that unlike the home directory, scratch space is not backed up and permanence of your data is not guaranteed. There is a total limit of 4 TB for this drive that is shared by everyone at the Redwood center.&lt;br /&gt;
&lt;br /&gt;
== Connect ==&lt;br /&gt;
&lt;br /&gt;
=== get a password ===&lt;br /&gt;
&lt;br /&gt;
==== cryptocard ====&lt;br /&gt;
&lt;br /&gt;
* Press the &amp;quot;PASSWORD&amp;quot; button to power on the CryptoCard. You will see &amp;quot;PIN?&amp;quot; request prompt&lt;br /&gt;
* Enter your PIN, and press the &amp;quot;ENT&amp;quot; key.&lt;br /&gt;
* You should see 7 digits presented like a phone number; this is your one-time password&lt;br /&gt;
&lt;br /&gt;
==== pledge app ====&lt;br /&gt;
&lt;br /&gt;
* Run the pledge app and click &amp;quot;Generate one-time password&amp;quot;&lt;br /&gt;
* Enter your PIN and press &amp;quot;Enter&amp;quot;&lt;br /&gt;
* The application will present your 7 digit one time password&lt;br /&gt;
&lt;br /&gt;
=== ssh to the gateway computer ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; note: please don&#039;t use the gateway for computations (e.g. matlab)! &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
  ssh -Y neuro-calhpc.berkeley.edu (or hadley.berkeley.edu) &lt;br /&gt;
&lt;br /&gt;
and use your crypto password&lt;br /&gt;
&lt;br /&gt;
If you intend on working with a remote GUI session you can add a -C flag to the command above to enable compression data to be sent through the ssh tunnel.&lt;br /&gt;
&lt;br /&gt;
=== Setup environment ===&lt;br /&gt;
&lt;br /&gt;
* put all your customizations into your .bashrc &lt;br /&gt;
* for login shells, .bash_profile is used, which in turn loads .bashrc&lt;br /&gt;
&lt;br /&gt;
=== Using a Windows machine ===&lt;br /&gt;
Windows is not a Unix-based operating system and as a result does not natively interface with a Unix environment. Download the 2 following pieces of software to create a workaround:&lt;br /&gt;
* Install a Unix environment emulator to interface directly with the cluster. Cygwin [http://www.cygwin.com] seems to work well. During installation make sure to install Net -&amp;gt; &amp;quot;openssh&amp;quot;. Editors -&amp;gt; &amp;quot;vim&amp;quot; is also recommended. Then you can use the instructions detailed in ssh to gateway above&lt;br /&gt;
* Install an SFTP/SCP/FTP client to allow for file sharing between the cluster and your local machine. WinSCP [http://www.winscp.net] is recommended. ExpanDrive can also be used to create a cluster-based network drive on your local machine.&lt;br /&gt;
&lt;br /&gt;
== Useful commands ==&lt;br /&gt;
&lt;br /&gt;
See https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/scheduler/ucb-supercluster-slurm-migration for a detailed FAQ on the SLURM job manager. &lt;br /&gt;
&lt;br /&gt;
=== SLURM usage ===&lt;br /&gt;
&lt;br /&gt;
* Submitting a Job&lt;br /&gt;
&lt;br /&gt;
From the login node, you can submit jobs to the compute nodes using the syntax&lt;br /&gt;
&lt;br /&gt;
  sbatch myscript.sh&lt;br /&gt;
&lt;br /&gt;
where the myscript.sh is an shell script containing the call to the executable to be submitted to the cluster. Typically, for a matlab job, it would look like&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash -l&lt;br /&gt;
  #SBATCH -p cortex&lt;br /&gt;
  #SBATCH --time=03:30:00&lt;br /&gt;
  #SBATCH --mem-per-cpu=2G&lt;br /&gt;
&lt;br /&gt;
  cd /clusterfs/cortex/scratch/working/dir/for/your/code&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;mymatlabfunction( parameters); exit&amp;quot;&lt;br /&gt;
  exit&lt;br /&gt;
&lt;br /&gt;
the --time defines the walltime of the job, which is an upper bound on the estimated runtime. The job will be killed after this time is elapsed. --mem specifies how much memory the job requires, the default is 1GB per job. &lt;br /&gt;
&lt;br /&gt;
* Monitoring Jobs &lt;br /&gt;
&lt;br /&gt;
Additional options can be passed to sbatch to monitor outputs from the running jobs&lt;br /&gt;
&lt;br /&gt;
    sbatch -o outputfile.txt -e errofile.txt -J jobdescriptor myscript.sh&lt;br /&gt;
&lt;br /&gt;
the output of the job will be piped to outputfile.txt and any errors if the job crashes to errofile.txt&lt;br /&gt;
&lt;br /&gt;
* Cluster usage&lt;br /&gt;
&lt;br /&gt;
Use&lt;br /&gt;
  squeue&lt;br /&gt;
to get a list of pending and running jobs on the cluster. It will show user names jobdescriptor passed to sbatch, runtime and nodes.&lt;br /&gt;
&lt;br /&gt;
=== Perceus commands ===&lt;br /&gt;
&lt;br /&gt;
The perceus manual is [http://www.warewulf-cluster.org/portal/book/export/html/7 here]&lt;br /&gt;
&lt;br /&gt;
* listing available cluster nodes:&lt;br /&gt;
&lt;br /&gt;
  wwstats&lt;br /&gt;
&lt;br /&gt;
* list cluster usage&lt;br /&gt;
&lt;br /&gt;
  wwtop&lt;br /&gt;
&lt;br /&gt;
* to restrict the scope of these commands to cortex cluster, add the following line to your .bashrc&lt;br /&gt;
&lt;br /&gt;
  export NODES=&#039;*cortex&#039;&lt;br /&gt;
&lt;br /&gt;
* module list&lt;br /&gt;
* module avail&lt;br /&gt;
* module help&lt;br /&gt;
&lt;br /&gt;
* help pages are [http://lrc.lbl.gov/html/guide.html here]&lt;br /&gt;
&lt;br /&gt;
=== Finding out the list of occupants on each cluster node ===&lt;br /&gt;
&lt;br /&gt;
* One can find out the list of users using a particular node by ssh into the node, e.g.&lt;br /&gt;
&lt;br /&gt;
  ssh n0000.cortex&lt;br /&gt;
&lt;br /&gt;
* After logging into the node, type&lt;br /&gt;
&lt;br /&gt;
  top&lt;br /&gt;
&lt;br /&gt;
* This is useful if you believe someone is abusing the machine and would like to send him/her a friendly reminder.&lt;br /&gt;
&lt;br /&gt;
= Software =&lt;br /&gt;
&lt;br /&gt;
== Matlab ==&lt;br /&gt;
&lt;br /&gt;
Start an interactive session on the cluster (requires specifying the cluster and walltime as is shown here):&lt;br /&gt;
&lt;br /&gt;
  srun -u -p cortex -t 2:0:0 bash -i&lt;br /&gt;
&lt;br /&gt;
In order to use matlab, you have to load the matlab environment:&lt;br /&gt;
&lt;br /&gt;
  module load matlab&lt;br /&gt;
&lt;br /&gt;
Once the matlab environment is loaded, you can start a matlab session by running&lt;br /&gt;
&lt;br /&gt;
  matlab -nodesktop&lt;br /&gt;
&lt;br /&gt;
An example PBS script for running matlab code is&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  # request 1 nodes with 2 CPUs &lt;br /&gt;
  #PBS -l nodes=1:ppn=2&lt;br /&gt;
  # reserve time on the selected cores&lt;br /&gt;
  #PBS -l walltime=01:00:00&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm &amp;lt;&amp;lt; EOF&lt;br /&gt;
  test # here you should have whatever you would normally type in the Matlab prompt&lt;br /&gt;
  exit&lt;br /&gt;
  EOF&lt;br /&gt;
&lt;br /&gt;
If you would like to see who is using matlab licenses, enter&lt;br /&gt;
&lt;br /&gt;
  lmstat&lt;br /&gt;
&lt;br /&gt;
== Python ==&lt;br /&gt;
&lt;br /&gt;
We have several Python Distributions installed: The Enthought Python Distribution (EPD), the Source Python Distribution (SPD) and Sage. The easiest way to get started is probably to use EPD (see below).&lt;br /&gt;
&lt;br /&gt;
=== Enthought Python Distribution (EPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Enthought Python Distribution 7.2.0 installed [[http://www.enthought.com/products/epd.php EPD]]. In order to use it, you have to follow the following steps:&lt;br /&gt;
&lt;br /&gt;
* login to the gateway server using &amp;quot;ssh -Y&amp;quot; (see above)&lt;br /&gt;
* start an interactive session using &amp;quot;srun -u -p cortex -t 2:0:0 bash -i&amp;quot; (see above)&lt;br /&gt;
* load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/epd&lt;br /&gt;
&lt;br /&gt;
* start ipython:&lt;br /&gt;
&lt;br /&gt;
  ipython -pylab&lt;br /&gt;
&lt;br /&gt;
* run the following commands inside ipython to test the setup:&lt;br /&gt;
&lt;br /&gt;
  from enthought.mayavi import mlab&lt;br /&gt;
  mlab.test_contour3d()&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== Source Python Distribution (SPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Source Python Distribution installed [[http://code.google.com/p/spdproject/ SPD]]. In order to use it, you have to first load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
&lt;br /&gt;
Afterwards, you can run ipython&lt;br /&gt;
&lt;br /&gt;
  % ipython -pylab&lt;br /&gt;
&lt;br /&gt;
At the moment, we have numpy, scipy, and matplotlib installed. If you would like to have additional modules installed, let me know [[mailto:kilian@berkeley.edu kilian]]&lt;br /&gt;
&lt;br /&gt;
=== Sage ===&lt;br /&gt;
&lt;br /&gt;
Sage is [http://sagemath.org http://sagemath.org]. In order to use sage, you have to first load the sage environment module&lt;br /&gt;
&lt;br /&gt;
  module load python/sage&lt;br /&gt;
&lt;br /&gt;
After loading the sage module, if you want to have a scipy environment (run ipython, etc) in your interactive session, first do:&lt;br /&gt;
&lt;br /&gt;
  % sage -sh&lt;br /&gt;
&lt;br /&gt;
then you can run:&lt;br /&gt;
&lt;br /&gt;
  % ipython&lt;br /&gt;
&lt;br /&gt;
or you can just do:&lt;br /&gt;
&lt;br /&gt;
  % sage -ipython&lt;br /&gt;
&lt;br /&gt;
This is a temporary solution for people wanting use scipy with mpi on the cluster. It was built against the default openmpi (1.2.8) (icc) and mpi4py 1.1.0. For those using hdf5, I also built hdf5 1.8.3 (gcc)  and h5py 1.2.&lt;br /&gt;
&lt;br /&gt;
Sample pbs and mpi script is here:&lt;br /&gt;
&lt;br /&gt;
  ~amirk/test&lt;br /&gt;
&lt;br /&gt;
You can run it as:&lt;br /&gt;
&lt;br /&gt;
  % mkdir -p ~/jobs&lt;br /&gt;
  % cd ~amirk/test&lt;br /&gt;
  % qsub pbs&lt;br /&gt;
&lt;br /&gt;
--Amir&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== CUDA ==&lt;br /&gt;
&lt;br /&gt;
CUDA is a library to use the graphics processing units (GPU) on the graphics card for general-purpose computing. We have a separate wiki page to collect information on how to do general-purpose computing on the GPU: [[GPGPU]].&lt;br /&gt;
We have installed the CUDA 3.0 driver and toolkit.&lt;br /&gt;
&lt;br /&gt;
In order to use CUDA, you have to load the CUDA environment:&lt;br /&gt;
&lt;br /&gt;
  module load cuda&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock in python ===&lt;br /&gt;
&lt;br /&gt;
If you would like to use one of the GPU cards on node n0000 or n0001, please optain a GPU lock to make sure the card is not in use and that no one else will be using the card. &lt;br /&gt;
&lt;br /&gt;
If you are using Python, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  import gpu_lock&lt;br /&gt;
  gpu_lock.obtain_lock_id()&lt;br /&gt;
&lt;br /&gt;
The function either returns the number of the card you can use (0 or 1) or -1 if both cards are in use.&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock for Jacket in Matlab ===&lt;br /&gt;
&lt;br /&gt;
If you are using Matlab, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/gpu_lock&#039;);&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/jacket/engine&#039;);&lt;br /&gt;
  gpu_id = obtain_gpu_lock_id();&lt;br /&gt;
  gselect(gpu_id);&lt;br /&gt;
&lt;br /&gt;
By default, obtain_gpu_lock() throws an error when all gpu cards are taken.&lt;br /&gt;
There is another option: obtain_gpu_lock_id(true) will return -1 in case there&lt;br /&gt;
is no card available and you can then write your own code to deal with that&lt;br /&gt;
fact.&lt;br /&gt;
&lt;br /&gt;
ginfo tells you which gpu card you are using.&lt;br /&gt;
&lt;br /&gt;
The following lines should also be in your .bashrc&lt;br /&gt;
&lt;br /&gt;
  ## jacket stuff!&lt;br /&gt;
  module load cuda&lt;br /&gt;
  export LD_LIBRARY_PATH=/clusterfs/cortex/software/jacket/engine/lib64:$LD_LIBRARY_PATH&lt;br /&gt;
&lt;br /&gt;
=== CUDA SDK (Outdated since version change to 3.0) ===&lt;br /&gt;
&lt;br /&gt;
You can install the CUDA SDK by running&lt;br /&gt;
&lt;br /&gt;
  bash /clusterfs/cortex/software/cuda-2.3/src/cudasdk_2.3_linux.run&lt;br /&gt;
&lt;br /&gt;
You can compile all the code examples by running&lt;br /&gt;
&lt;br /&gt;
  module load X11&lt;br /&gt;
  module load Mesa/7.4.4&lt;br /&gt;
  cd ~/NVIDIA_GPU_Computing_SDK/C&lt;br /&gt;
  make&lt;br /&gt;
&lt;br /&gt;
The compiled examples can be found in the directory&lt;br /&gt;
&lt;br /&gt;
  ~/NVIDIA_GPU_Computing_SDK/C/bin/linux/release&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;note:&#039;&#039;&#039; The examples using graphics with OpenGL don&#039;t seem to run on a remote X server. In order to make them work, we probably need to install something like [http://www.virtualgl.org/ virtualgl].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== PyCuda ===&lt;br /&gt;
&lt;br /&gt;
PyCuda 0.93 is installed as part of the Source Python Distribution (SPD). This is how you run all unit tests:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
  cd /clusterfs/cortex/software/src/pycuda-0.93/test/&lt;br /&gt;
  nosetests&lt;br /&gt;
&lt;br /&gt;
If you are having trouble installing PyCuda, please note the following:&lt;br /&gt;
&lt;br /&gt;
* gcc 4.1.2 related issues with boost [http://tinyurl.com/28zrjnv]&lt;br /&gt;
* also, gcc 4.1.2 related [http://tinyurl.com/25obx6g]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Usage Tips =&lt;br /&gt;
Here are some tips on how to effectively use the cluster.&lt;br /&gt;
&lt;br /&gt;
== Embarrassingly Parallel Submissions ==&lt;br /&gt;
&lt;br /&gt;
Here is an alternate script to do embarrassingly parallel submissions on the cluster.&lt;br /&gt;
 &lt;br /&gt;
iterate.sh&lt;br /&gt;
  #!/bin/sh&lt;br /&gt;
  #Leap Size&lt;br /&gt;
  param1=11&lt;br /&gt;
  param2=1.2&lt;br /&gt;
  param3=.75&lt;br /&gt;
  #LeapSize&lt;br /&gt;
  for i in 14 15 16&lt;br /&gt;
  do&lt;br /&gt;
  #Epsilon&lt;br /&gt;
   for j in $(seq .8 .1 $param2);&lt;br /&gt;
       do&lt;br /&gt;
       #Beta&lt;br /&gt;
       for k in $(seq .65 .01 $param3);&lt;br /&gt;
             do&lt;br /&gt;
                 echo $i,$j,$k&lt;br /&gt;
                 qsub param_test.sh  -v &amp;quot;LeapSize=$i,Epsilon=$j,Beta=$k&amp;quot;&lt;br /&gt;
             done&lt;br /&gt;
       done&lt;br /&gt;
   done&lt;br /&gt;
&lt;br /&gt;
param_test.sh&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  #PBS -l nodes=1:ppn=2:gpu&lt;br /&gt;
  #PBS -l walltime=10:35:00&lt;br /&gt;
  #PBS -o /global/home/users/mayur/Logs&lt;br /&gt;
  #PBS -e /global/home/users/mayur/Errors&lt;br /&gt;
  cd /global/home/users/mayur/HMC_reducedflip/&lt;br /&gt;
  module load matlab&lt;br /&gt;
  echo &amp;quot;Epsilon = &amp;quot;,$Epsilon&lt;br /&gt;
  echo &amp;quot;Leap Size = &amp;quot;,$LeapSize&lt;br /&gt;
  echo &amp;quot;Beta = &amp;quot;,$Beta&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;make_figures_fneval_cluster $LeapSize $Epsilon $Beta&amp;quot;&lt;br /&gt;
&lt;br /&gt;
   Now run ./iterate.sh&lt;br /&gt;
&lt;br /&gt;
== Mounting Cluster File System ==&lt;br /&gt;
Mounting the cluster file system remotely allows you to easily access files on the cluster, and allows you to use local programs to edit code or examine simulation outputs locally (very useful). I often edit the remote code using a text editor running on my local machine. This allows you to take advantage of the niceties of a native editor without having to copy code back and forth before you run a simulation on the cluster.&lt;br /&gt;
&lt;br /&gt;
On linux distributions you can mount your cluster home directory locally using sshfs [http://fuse.sourceforge.net/sshfs.html]&lt;br /&gt;
&lt;br /&gt;
  sshfs hadley.berkeley.edu: &amp;lt;mount-dir&amp;gt;&lt;br /&gt;
&lt;br /&gt;
On Mac and Windows machines the program ExpanDrive works well (uses Fuse under the hood): [http://www.expandrive.com]&lt;br /&gt;
&lt;br /&gt;
= Support Requests =&lt;br /&gt;
&lt;br /&gt;
* If you have a problem that is not covered on this page, you can send an email to our user list:&lt;br /&gt;
&lt;br /&gt;
  [mailto:redwood_cluster@lists.berkeley.edu redwood_cluster@lists.berkeley.edu]&lt;br /&gt;
&lt;br /&gt;
* If you need additional help from the LBL group, send an email to their email list. Please always cc our email list as well. Or visit their website[https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/].&lt;br /&gt;
&lt;br /&gt;
  [mailto:hpcshelp@lbl.gov hpcshelp@lbl.gov]&lt;br /&gt;
&lt;br /&gt;
* In urgent cases, you can also email [mailto:kmuriki@lbl.gov Krishna Muriki] (LBL User Services) directly.&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Cluster&amp;diff=7057</id>
		<title>Cluster</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Cluster&amp;diff=7057"/>
		<updated>2013-07-08T21:39:25Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* get a password */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Video Tutorial=&lt;br /&gt;
&lt;br /&gt;
Taught by our cluster aficionado and computer master, Mayur Mudigonda.  Please watch and or read below information it before asking him questions: [https://archive.org/details/MayurClusterTutorial_201304]&lt;br /&gt;
&lt;br /&gt;
= General Information =&lt;br /&gt;
&lt;br /&gt;
Contrary to popularly held belief, our cluster is not a magical computational powerhorse that will take your code and make it run hundreds of times faster. Read on to find out what it is, and how you might utilize it. &lt;br /&gt;
&lt;br /&gt;
We have about a dozen somewhat heterogeneous machines, many of which can be matched or exceeded in performance today by purchasing a $300-$400 desktop, or a laptop costing twice as much. There are exceptions to this. For example, there are a couple of machines which have graphics cards (GPUs) which cost about the same, but to take advantage of them, your code needs to be written specifically for the GPU using CUDA / OpenCL or it needs to call into libraries and packages which do that dirty work for you, such as PyCUDA / PyOpenCL or Jacket for Matlab. A few machines have a bit of extra memory (12-16G). The network connectivity is comparable to what we have in the lab (i.e. it is &#039;&#039;&#039;not&#039;&#039;&#039; some exotic ultra fast network interface utilizing a fancy topology).&lt;br /&gt;
&lt;br /&gt;
Given the above, the typical use cases for the cluster are that you have jobs that run in parallel which are independent, so having several machines will complete the task faster, even though any one machine might not be faster than your own laptop. Or you have a long running job which may take a day, and you don&#039;t want to worry about having to leave your laptop on at all times and not be able to use it. Another reason is that your code leverages a communication scheme (such as MPI) to have multiple machines cooperatively work on a problem. In order for the cluster to be useful and well-utilized, it works best for everyone to submit jobs (see &#039;&#039;&#039;qsub&#039;&#039;&#039; further down on this page for the details) to the queue which may not start right away, but which will get run once their turn comes. Please do not run extended interactive sessions or ssh directly to worker nodes for performing computation.&lt;br /&gt;
&lt;br /&gt;
== Hardware Overview == &lt;br /&gt;
&lt;br /&gt;
We are in the process of upgrading the older machines in the cluster. We currently have:&lt;br /&gt;
  #   Node names   CPU type           Speed   CPU count		Memory	Vintage	GPU &lt;br /&gt;
  2x  n0000-n0001  Intel Xeon E5410 @ 2.33GHz dual 4-core	16GB	2007 	Tesla GPUs&lt;br /&gt;
  10x n0002-n0011 Intel Xeon E3-1220 @ 3.1GHz 4-core 		16GB	2012	no GPU&lt;br /&gt;
  2x  n0012-n0013  Intel Xeon X5650 @ 2.66GHz dual 6-core	24GB	2010 	Fermi GPUs&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
In addition to the compute nodes we own a file server&lt;br /&gt;
  NetOp 4TB&lt;br /&gt;
which is mounted as scratch space.&lt;br /&gt;
&lt;br /&gt;
== Getting an account and crypto card == &lt;br /&gt;
If reading the above does not deter you, in order to get an account on the cluster, please send an email to Mayur Mudigonda (lastname AT berk...edu) with the following information:&lt;br /&gt;
&lt;br /&gt;
    Full Name &amp;lt;emailaddress&amp;gt; desiredusername&lt;br /&gt;
&lt;br /&gt;
You can also include a note about which PI you are working with. Note: the &#039;&#039;&#039;desireusername&#039;&#039;&#039; must be 3-8 characters long, so it would have been truncated to &#039;&#039;&#039;desireus&#039;&#039;&#039; in this case.&lt;br /&gt;
&lt;br /&gt;
It takes the SCS folks about one to two weeks to make the accounts and ship a new crypto card token to you. You&#039;ll need to sign and fax back to them a form that arrives with the crypto card, and then leave the hardcopy of it in my box. -pi&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;OTP (One Time Password) Service&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Once you have a username you can follow the instructions found here https://commons.lbl.gov/display/itfaq/OTP+%28One+Time+Password%29+Service to get access to the cluster (see &#039;&#039;&#039;Installing and Configuring the OTP Token&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
== Directory setup ==&lt;br /&gt;
&lt;br /&gt;
=== home directory quota ===&lt;br /&gt;
&lt;br /&gt;
There is a 10GB quota limit enforced on $HOME directory&lt;br /&gt;
(/global/home/users/username) usage. Please keep your usage below&lt;br /&gt;
this limit. There will NETAPP snapshots in place in this file&lt;br /&gt;
system so we suggest you store only your source code and scripts&lt;br /&gt;
in this area and store all your data under /clusterfs/cortex&lt;br /&gt;
(see below).&lt;br /&gt;
&lt;br /&gt;
In order to see your current quota and usage, use the following command:&lt;br /&gt;
&lt;br /&gt;
  quota -s&lt;br /&gt;
&lt;br /&gt;
=== data ===&lt;br /&gt;
&lt;br /&gt;
For large amounts of data, please create a directory&lt;br /&gt;
&lt;br /&gt;
  /clusterfs/cortex/scratch/username&lt;br /&gt;
&lt;br /&gt;
and store the data inside that directory. Note that unlike the home directory, scratch space is not backed up and permanence of your data is not guaranteed. There is a total limit of 4 TB for this drive that is shared by everyone at the Redwood center.&lt;br /&gt;
&lt;br /&gt;
== Connect ==&lt;br /&gt;
&lt;br /&gt;
=== get a password ===&lt;br /&gt;
&lt;br /&gt;
==== cryptocard ====&lt;br /&gt;
&lt;br /&gt;
* Press the &amp;quot;PASSWORD&amp;quot; button to power on the CryptoCard. You will see &amp;quot;PIN?&amp;quot; request prompt&lt;br /&gt;
* Enter your PIN, and press the &amp;quot;ENT&amp;quot; key.&lt;br /&gt;
* You should see 7 digits presented like a phone number; this is your one-time password&lt;br /&gt;
&lt;br /&gt;
==== pledge app ====&lt;br /&gt;
&lt;br /&gt;
* Run the pledge app and click &amp;quot;Generate one-time password&amp;quot;&lt;br /&gt;
* Enter your PIN and press &amp;quot;Enter&amp;quot;&lt;br /&gt;
* The application will present your 7 digit one time password&lt;br /&gt;
&lt;br /&gt;
=== ssh to the gateway computer (hadley) ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; note: please don&#039;t use the gateway for computations (e.g. matlab)! &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
  ssh -Y neuro-calhpc.berkeley.edu (or hadley.berkeley.edu) &lt;br /&gt;
&lt;br /&gt;
and use your crypto password&lt;br /&gt;
&lt;br /&gt;
If you intend on working in a GUI session you can add a -C flag to command above to enable compression for data sent through the ssh tunnel.&lt;br /&gt;
&lt;br /&gt;
=== Setup environment ===&lt;br /&gt;
&lt;br /&gt;
* put all your customizations into your .bashrc &lt;br /&gt;
* for login shells, .bash_profile is used, which in turn loads .bashrc&lt;br /&gt;
&lt;br /&gt;
=== Using a Windows machine ===&lt;br /&gt;
Windows is not a Unix-based operating system and as a result does not natively interface with a Unix environment. Download the 2 following pieces of software to create a workaround:&lt;br /&gt;
* Install a Unix environment emulator to interface directly with the cluster. Cygwin [http://www.cygwin.com] seems to work well. During installation make sure to install Net -&amp;gt; &amp;quot;openssh&amp;quot;. Editors -&amp;gt; &amp;quot;vim&amp;quot; is also recommended. Then you can use the instructions detailed in ssh to gateway above&lt;br /&gt;
* Install an SFTP/SCP/FTP client to allow for file sharing between the cluster and your local machine. WinSCP [http://www.winscp.net] is recommended. ExpanDrive can also be used to create a cluster-based network drive on your local machine.&lt;br /&gt;
&lt;br /&gt;
== Useful commands ==&lt;br /&gt;
&lt;br /&gt;
See https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/scheduler/ucb-supercluster-slurm-migration for a detailed FAQ on the SLURM job manager. &lt;br /&gt;
&lt;br /&gt;
=== SLURM usage ===&lt;br /&gt;
&lt;br /&gt;
* Submitting a Job&lt;br /&gt;
&lt;br /&gt;
From the login node, you can submit jobs to the compute nodes using the syntax&lt;br /&gt;
&lt;br /&gt;
  sbatch myscript.sh&lt;br /&gt;
&lt;br /&gt;
where the myscript.sh is an shell script containing the call to the executable to be submitted to the cluster. Typically, for a matlab job, it would look like&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash -l&lt;br /&gt;
  #SBATCH -p cortex&lt;br /&gt;
  #SBATCH --time=03:30:00&lt;br /&gt;
  #SBATCH --mem-per-cpu=2G&lt;br /&gt;
&lt;br /&gt;
  cd /clusterfs/cortex/scratch/working/dir/for/your/code&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;mymatlabfunction( parameters); exit&amp;quot;&lt;br /&gt;
  exit&lt;br /&gt;
&lt;br /&gt;
the --time defines the walltime of the job, which is an upper bound on the estimated runtime. The job will be killed after this time is elapsed. --mem specifies how much memory the job requires, the default is 1GB per job. &lt;br /&gt;
&lt;br /&gt;
* Monitoring Jobs &lt;br /&gt;
&lt;br /&gt;
Additional options can be passed to sbatch to monitor outputs from the running jobs&lt;br /&gt;
&lt;br /&gt;
    sbatch -o outputfile.txt -e errofile.txt -J jobdescriptor myscript.sh&lt;br /&gt;
&lt;br /&gt;
the output of the job will be piped to outputfile.txt and any errors if the job crashes to errofile.txt&lt;br /&gt;
&lt;br /&gt;
* Cluster usage&lt;br /&gt;
&lt;br /&gt;
Use&lt;br /&gt;
  squeue&lt;br /&gt;
to get a list of pending and running jobs on the cluster. It will show user names jobdescriptor passed to sbatch, runtime and nodes.&lt;br /&gt;
&lt;br /&gt;
=== Perceus commands ===&lt;br /&gt;
&lt;br /&gt;
The perceus manual is [http://www.warewulf-cluster.org/portal/book/export/html/7 here]&lt;br /&gt;
&lt;br /&gt;
* listing available cluster nodes:&lt;br /&gt;
&lt;br /&gt;
  wwstats&lt;br /&gt;
&lt;br /&gt;
* list cluster usage&lt;br /&gt;
&lt;br /&gt;
  wwtop&lt;br /&gt;
&lt;br /&gt;
* to restrict the scope of these commands to cortex cluster, add the following line to your .bashrc&lt;br /&gt;
&lt;br /&gt;
  export NODES=&#039;*cortex&#039;&lt;br /&gt;
&lt;br /&gt;
* module list&lt;br /&gt;
* module avail&lt;br /&gt;
* module help&lt;br /&gt;
&lt;br /&gt;
* help pages are [http://lrc.lbl.gov/html/guide.html here]&lt;br /&gt;
&lt;br /&gt;
=== Finding out the list of occupants on each cluster node ===&lt;br /&gt;
&lt;br /&gt;
* One can find out the list of users using a particular node by ssh into the node, e.g.&lt;br /&gt;
&lt;br /&gt;
  ssh n0000.cortex&lt;br /&gt;
&lt;br /&gt;
* After logging into the node, type&lt;br /&gt;
&lt;br /&gt;
  top&lt;br /&gt;
&lt;br /&gt;
* This is useful if you believe someone is abusing the machine and would like to send him/her a friendly reminder.&lt;br /&gt;
&lt;br /&gt;
= Software =&lt;br /&gt;
&lt;br /&gt;
== Matlab ==&lt;br /&gt;
&lt;br /&gt;
Start an interactive session on the cluster (requires specifying the cluster and walltime as is shown here):&lt;br /&gt;
&lt;br /&gt;
  srun -u -p cortex -t 2:0:0 bash -i&lt;br /&gt;
&lt;br /&gt;
In order to use matlab, you have to load the matlab environment:&lt;br /&gt;
&lt;br /&gt;
  module load matlab&lt;br /&gt;
&lt;br /&gt;
Once the matlab environment is loaded, you can start a matlab session by running&lt;br /&gt;
&lt;br /&gt;
  matlab -nodesktop&lt;br /&gt;
&lt;br /&gt;
An example PBS script for running matlab code is&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  # request 1 nodes with 2 CPUs &lt;br /&gt;
  #PBS -l nodes=1:ppn=2&lt;br /&gt;
  # reserve time on the selected cores&lt;br /&gt;
  #PBS -l walltime=01:00:00&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm &amp;lt;&amp;lt; EOF&lt;br /&gt;
  test # here you should have whatever you would normally type in the Matlab prompt&lt;br /&gt;
  exit&lt;br /&gt;
  EOF&lt;br /&gt;
&lt;br /&gt;
If you would like to see who is using matlab licenses, enter&lt;br /&gt;
&lt;br /&gt;
  lmstat&lt;br /&gt;
&lt;br /&gt;
== Python ==&lt;br /&gt;
&lt;br /&gt;
We have several Python Distributions installed: The Enthought Python Distribution (EPD), the Source Python Distribution (SPD) and Sage. The easiest way to get started is probably to use EPD (see below).&lt;br /&gt;
&lt;br /&gt;
=== Enthought Python Distribution (EPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Enthought Python Distribution 7.2.0 installed [[http://www.enthought.com/products/epd.php EPD]]. In order to use it, you have to follow the following steps:&lt;br /&gt;
&lt;br /&gt;
* login to the gateway server using &amp;quot;ssh -Y&amp;quot; (see above)&lt;br /&gt;
* start an interactive session using &amp;quot;srun -u -p cortex -t 2:0:0 bash -i&amp;quot; (see above)&lt;br /&gt;
* load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/epd&lt;br /&gt;
&lt;br /&gt;
* start ipython:&lt;br /&gt;
&lt;br /&gt;
  ipython -pylab&lt;br /&gt;
&lt;br /&gt;
* run the following commands inside ipython to test the setup:&lt;br /&gt;
&lt;br /&gt;
  from enthought.mayavi import mlab&lt;br /&gt;
  mlab.test_contour3d()&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== Source Python Distribution (SPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Source Python Distribution installed [[http://code.google.com/p/spdproject/ SPD]]. In order to use it, you have to first load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
&lt;br /&gt;
Afterwards, you can run ipython&lt;br /&gt;
&lt;br /&gt;
  % ipython -pylab&lt;br /&gt;
&lt;br /&gt;
At the moment, we have numpy, scipy, and matplotlib installed. If you would like to have additional modules installed, let me know [[mailto:kilian@berkeley.edu kilian]]&lt;br /&gt;
&lt;br /&gt;
=== Sage ===&lt;br /&gt;
&lt;br /&gt;
Sage is [http://sagemath.org http://sagemath.org]. In order to use sage, you have to first load the sage environment module&lt;br /&gt;
&lt;br /&gt;
  module load python/sage&lt;br /&gt;
&lt;br /&gt;
After loading the sage module, if you want to have a scipy environment (run ipython, etc) in your interactive session, first do:&lt;br /&gt;
&lt;br /&gt;
  % sage -sh&lt;br /&gt;
&lt;br /&gt;
then you can run:&lt;br /&gt;
&lt;br /&gt;
  % ipython&lt;br /&gt;
&lt;br /&gt;
or you can just do:&lt;br /&gt;
&lt;br /&gt;
  % sage -ipython&lt;br /&gt;
&lt;br /&gt;
This is a temporary solution for people wanting use scipy with mpi on the cluster. It was built against the default openmpi (1.2.8) (icc) and mpi4py 1.1.0. For those using hdf5, I also built hdf5 1.8.3 (gcc)  and h5py 1.2.&lt;br /&gt;
&lt;br /&gt;
Sample pbs and mpi script is here:&lt;br /&gt;
&lt;br /&gt;
  ~amirk/test&lt;br /&gt;
&lt;br /&gt;
You can run it as:&lt;br /&gt;
&lt;br /&gt;
  % mkdir -p ~/jobs&lt;br /&gt;
  % cd ~amirk/test&lt;br /&gt;
  % qsub pbs&lt;br /&gt;
&lt;br /&gt;
--Amir&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== CUDA ==&lt;br /&gt;
&lt;br /&gt;
CUDA is a library to use the graphics processing units (GPU) on the graphics card for general-purpose computing. We have a separate wiki page to collect information on how to do general-purpose computing on the GPU: [[GPGPU]].&lt;br /&gt;
We have installed the CUDA 3.0 driver and toolkit.&lt;br /&gt;
&lt;br /&gt;
In order to use CUDA, you have to load the CUDA environment:&lt;br /&gt;
&lt;br /&gt;
  module load cuda&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock in python ===&lt;br /&gt;
&lt;br /&gt;
If you would like to use one of the GPU cards on node n0000 or n0001, please optain a GPU lock to make sure the card is not in use and that no one else will be using the card. &lt;br /&gt;
&lt;br /&gt;
If you are using Python, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  import gpu_lock&lt;br /&gt;
  gpu_lock.obtain_lock_id()&lt;br /&gt;
&lt;br /&gt;
The function either returns the number of the card you can use (0 or 1) or -1 if both cards are in use.&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock for Jacket in Matlab ===&lt;br /&gt;
&lt;br /&gt;
If you are using Matlab, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/gpu_lock&#039;);&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/jacket/engine&#039;);&lt;br /&gt;
  gpu_id = obtain_gpu_lock_id();&lt;br /&gt;
  gselect(gpu_id);&lt;br /&gt;
&lt;br /&gt;
By default, obtain_gpu_lock() throws an error when all gpu cards are taken.&lt;br /&gt;
There is another option: obtain_gpu_lock_id(true) will return -1 in case there&lt;br /&gt;
is no card available and you can then write your own code to deal with that&lt;br /&gt;
fact.&lt;br /&gt;
&lt;br /&gt;
ginfo tells you which gpu card you are using.&lt;br /&gt;
&lt;br /&gt;
The following lines should also be in your .bashrc&lt;br /&gt;
&lt;br /&gt;
  ## jacket stuff!&lt;br /&gt;
  module load cuda&lt;br /&gt;
  export LD_LIBRARY_PATH=/clusterfs/cortex/software/jacket/engine/lib64:$LD_LIBRARY_PATH&lt;br /&gt;
&lt;br /&gt;
=== CUDA SDK (Outdated since version change to 3.0) ===&lt;br /&gt;
&lt;br /&gt;
You can install the CUDA SDK by running&lt;br /&gt;
&lt;br /&gt;
  bash /clusterfs/cortex/software/cuda-2.3/src/cudasdk_2.3_linux.run&lt;br /&gt;
&lt;br /&gt;
You can compile all the code examples by running&lt;br /&gt;
&lt;br /&gt;
  module load X11&lt;br /&gt;
  module load Mesa/7.4.4&lt;br /&gt;
  cd ~/NVIDIA_GPU_Computing_SDK/C&lt;br /&gt;
  make&lt;br /&gt;
&lt;br /&gt;
The compiled examples can be found in the directory&lt;br /&gt;
&lt;br /&gt;
  ~/NVIDIA_GPU_Computing_SDK/C/bin/linux/release&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;note:&#039;&#039;&#039; The examples using graphics with OpenGL don&#039;t seem to run on a remote X server. In order to make them work, we probably need to install something like [http://www.virtualgl.org/ virtualgl].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== PyCuda ===&lt;br /&gt;
&lt;br /&gt;
PyCuda 0.93 is installed as part of the Source Python Distribution (SPD). This is how you run all unit tests:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
  cd /clusterfs/cortex/software/src/pycuda-0.93/test/&lt;br /&gt;
  nosetests&lt;br /&gt;
&lt;br /&gt;
If you are having trouble installing PyCuda, please note the following:&lt;br /&gt;
&lt;br /&gt;
* gcc 4.1.2 related issues with boost [http://tinyurl.com/28zrjnv]&lt;br /&gt;
* also, gcc 4.1.2 related [http://tinyurl.com/25obx6g]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Usage Tips =&lt;br /&gt;
Here are some tips on how to effectively use the cluster.&lt;br /&gt;
&lt;br /&gt;
== Embarrassingly Parallel Submissions ==&lt;br /&gt;
&lt;br /&gt;
Here is an alternate script to do embarrassingly parallel submissions on the cluster.&lt;br /&gt;
 &lt;br /&gt;
iterate.sh&lt;br /&gt;
  #!/bin/sh&lt;br /&gt;
  #Leap Size&lt;br /&gt;
  param1=11&lt;br /&gt;
  param2=1.2&lt;br /&gt;
  param3=.75&lt;br /&gt;
  #LeapSize&lt;br /&gt;
  for i in 14 15 16&lt;br /&gt;
  do&lt;br /&gt;
  #Epsilon&lt;br /&gt;
   for j in $(seq .8 .1 $param2);&lt;br /&gt;
       do&lt;br /&gt;
       #Beta&lt;br /&gt;
       for k in $(seq .65 .01 $param3);&lt;br /&gt;
             do&lt;br /&gt;
                 echo $i,$j,$k&lt;br /&gt;
                 qsub param_test.sh  -v &amp;quot;LeapSize=$i,Epsilon=$j,Beta=$k&amp;quot;&lt;br /&gt;
             done&lt;br /&gt;
       done&lt;br /&gt;
   done&lt;br /&gt;
&lt;br /&gt;
param_test.sh&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  #PBS -l nodes=1:ppn=2:gpu&lt;br /&gt;
  #PBS -l walltime=10:35:00&lt;br /&gt;
  #PBS -o /global/home/users/mayur/Logs&lt;br /&gt;
  #PBS -e /global/home/users/mayur/Errors&lt;br /&gt;
  cd /global/home/users/mayur/HMC_reducedflip/&lt;br /&gt;
  module load matlab&lt;br /&gt;
  echo &amp;quot;Epsilon = &amp;quot;,$Epsilon&lt;br /&gt;
  echo &amp;quot;Leap Size = &amp;quot;,$LeapSize&lt;br /&gt;
  echo &amp;quot;Beta = &amp;quot;,$Beta&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;make_figures_fneval_cluster $LeapSize $Epsilon $Beta&amp;quot;&lt;br /&gt;
&lt;br /&gt;
   Now run ./iterate.sh&lt;br /&gt;
&lt;br /&gt;
== Mounting Cluster File System ==&lt;br /&gt;
Mounting the cluster file system remotely allows you to easily access files on the cluster, and allows you to use local programs to edit code or examine simulation outputs locally (very useful). I often edit the remote code using a text editor running on my local machine. This allows you to take advantage of the niceties of a native editor without having to copy code back and forth before you run a simulation on the cluster.&lt;br /&gt;
&lt;br /&gt;
On linux distributions you can mount your cluster home directory locally using sshfs [http://fuse.sourceforge.net/sshfs.html]&lt;br /&gt;
&lt;br /&gt;
  sshfs hadley.berkeley.edu: &amp;lt;mount-dir&amp;gt;&lt;br /&gt;
&lt;br /&gt;
On Mac and Windows machines the program ExpanDrive works well (uses Fuse under the hood): [http://www.expandrive.com]&lt;br /&gt;
&lt;br /&gt;
= Support Requests =&lt;br /&gt;
&lt;br /&gt;
* If you have a problem that is not covered on this page, you can send an email to our user list:&lt;br /&gt;
&lt;br /&gt;
  [mailto:redwood_cluster@lists.berkeley.edu redwood_cluster@lists.berkeley.edu]&lt;br /&gt;
&lt;br /&gt;
* If you need additional help from the LBL group, send an email to their email list. Please always cc our email list as well. Or visit their website[https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/].&lt;br /&gt;
&lt;br /&gt;
  [mailto:hpcshelp@lbl.gov hpcshelp@lbl.gov]&lt;br /&gt;
&lt;br /&gt;
* In urgent cases, you can also email [mailto:kmuriki@lbl.gov Krishna Muriki] (LBL User Services) directly.&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Cluster&amp;diff=7056</id>
		<title>Cluster</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Cluster&amp;diff=7056"/>
		<updated>2013-07-08T20:30:58Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Perceus commands */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Video Tutorial=&lt;br /&gt;
&lt;br /&gt;
Taught by our cluster aficionado and computer master, Mayur Mudigonda.  Please watch and or read below information it before asking him questions: [https://archive.org/details/MayurClusterTutorial_201304]&lt;br /&gt;
&lt;br /&gt;
= General Information =&lt;br /&gt;
&lt;br /&gt;
Contrary to popularly held belief, our cluster is not a magical computational powerhorse that will take your code and make it run hundreds of times faster. Read on to find out what it is, and how you might utilize it. &lt;br /&gt;
&lt;br /&gt;
We have about a dozen somewhat heterogeneous machines, many of which can be matched or exceeded in performance today by purchasing a $300-$400 desktop, or a laptop costing twice as much. There are exceptions to this. For example, there are a couple of machines which have graphics cards (GPUs) which cost about the same, but to take advantage of them, your code needs to be written specifically for the GPU using CUDA / OpenCL or it needs to call into libraries and packages which do that dirty work for you, such as PyCUDA / PyOpenCL or Jacket for Matlab. A few machines have a bit of extra memory (12-16G). The network connectivity is comparable to what we have in the lab (i.e. it is &#039;&#039;&#039;not&#039;&#039;&#039; some exotic ultra fast network interface utilizing a fancy topology).&lt;br /&gt;
&lt;br /&gt;
Given the above, the typical use cases for the cluster are that you have jobs that run in parallel which are independent, so having several machines will complete the task faster, even though any one machine might not be faster than your own laptop. Or you have a long running job which may take a day, and you don&#039;t want to worry about having to leave your laptop on at all times and not be able to use it. Another reason is that your code leverages a communication scheme (such as MPI) to have multiple machines cooperatively work on a problem. In order for the cluster to be useful and well-utilized, it works best for everyone to submit jobs (see &#039;&#039;&#039;qsub&#039;&#039;&#039; further down on this page for the details) to the queue which may not start right away, but which will get run once their turn comes. Please do not run extended interactive sessions or ssh directly to worker nodes for performing computation.&lt;br /&gt;
&lt;br /&gt;
== Hardware Overview == &lt;br /&gt;
&lt;br /&gt;
We are in the process of upgrading the older machines in the cluster. We currently have:&lt;br /&gt;
  #   Node names   CPU type           Speed   CPU count		Memory	Vintage	GPU &lt;br /&gt;
  2x  n0000-n0001  Intel Xeon E5410 @ 2.33GHz dual 4-core	16GB	2007 	Tesla GPUs&lt;br /&gt;
  10x n0002-n0011 Intel Xeon E3-1220 @ 3.1GHz 4-core 		16GB	2012	no GPU&lt;br /&gt;
  2x  n0012-n0013  Intel Xeon X5650 @ 2.66GHz dual 6-core	24GB	2010 	Fermi GPUs&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
In addition to the compute nodes we own a file server&lt;br /&gt;
  NetOp 4TB&lt;br /&gt;
which is mounted as scratch space.&lt;br /&gt;
&lt;br /&gt;
== Getting an account and crypto card == &lt;br /&gt;
If reading the above does not deter you, in order to get an account on the cluster, please send an email to Mayur Mudigonda (lastname AT berk...edu) with the following information:&lt;br /&gt;
&lt;br /&gt;
    Full Name &amp;lt;emailaddress&amp;gt; desiredusername&lt;br /&gt;
&lt;br /&gt;
You can also include a note about which PI you are working with. Note: the &#039;&#039;&#039;desireusername&#039;&#039;&#039; must be 3-8 characters long, so it would have been truncated to &#039;&#039;&#039;desireus&#039;&#039;&#039; in this case.&lt;br /&gt;
&lt;br /&gt;
It takes the SCS folks about one to two weeks to make the accounts and ship a new crypto card token to you. You&#039;ll need to sign and fax back to them a form that arrives with the crypto card, and then leave the hardcopy of it in my box. -pi&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;OTP (One Time Password) Service&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Once you have a username you can follow the instructions found here https://commons.lbl.gov/display/itfaq/OTP+%28One+Time+Password%29+Service to get access to the cluster (see &#039;&#039;&#039;Installing and Configuring the OTP Token&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
== Directory setup ==&lt;br /&gt;
&lt;br /&gt;
=== home directory quota ===&lt;br /&gt;
&lt;br /&gt;
There is a 10GB quota limit enforced on $HOME directory&lt;br /&gt;
(/global/home/users/username) usage. Please keep your usage below&lt;br /&gt;
this limit. There will NETAPP snapshots in place in this file&lt;br /&gt;
system so we suggest you store only your source code and scripts&lt;br /&gt;
in this area and store all your data under /clusterfs/cortex&lt;br /&gt;
(see below).&lt;br /&gt;
&lt;br /&gt;
In order to see your current quota and usage, use the following command:&lt;br /&gt;
&lt;br /&gt;
  quota -s&lt;br /&gt;
&lt;br /&gt;
=== data ===&lt;br /&gt;
&lt;br /&gt;
For large amounts of data, please create a directory&lt;br /&gt;
&lt;br /&gt;
  /clusterfs/cortex/scratch/username&lt;br /&gt;
&lt;br /&gt;
and store the data inside that directory. Note that unlike the home directory, scratch space is not backed up and permanence of your data is not guaranteed. There is a total limit of 4 TB for this drive that is shared by everyone at the Redwood center.&lt;br /&gt;
&lt;br /&gt;
== Connect ==&lt;br /&gt;
&lt;br /&gt;
=== get a password ===&lt;br /&gt;
&lt;br /&gt;
* Press the &amp;quot;PASSWORD&amp;quot; button to power on the CryptoCard. You will see &amp;quot;PIN?&amp;quot; request prompt&lt;br /&gt;
* Enter your PIN, and press the &amp;quot;ENT&amp;quot; key.&lt;br /&gt;
* You should see 7 digits presented like a phone number; this is your one-time password&lt;br /&gt;
&lt;br /&gt;
=== ssh to the gateway computer (hadley) ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; note: please don&#039;t use the gateway for computations (e.g. matlab)! &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
  ssh -Y neuro-calhpc.berkeley.edu (or hadley.berkeley.edu) &lt;br /&gt;
&lt;br /&gt;
and use your crypto password&lt;br /&gt;
&lt;br /&gt;
If you intend on working in a GUI session you can add a -C flag to command above to enable compression for data sent through the ssh tunnel.&lt;br /&gt;
&lt;br /&gt;
=== Setup environment ===&lt;br /&gt;
&lt;br /&gt;
* put all your customizations into your .bashrc &lt;br /&gt;
* for login shells, .bash_profile is used, which in turn loads .bashrc&lt;br /&gt;
&lt;br /&gt;
=== Using a Windows machine ===&lt;br /&gt;
Windows is not a Unix-based operating system and as a result does not natively interface with a Unix environment. Download the 2 following pieces of software to create a workaround:&lt;br /&gt;
* Install a Unix environment emulator to interface directly with the cluster. Cygwin [http://www.cygwin.com] seems to work well. During installation make sure to install Net -&amp;gt; &amp;quot;openssh&amp;quot;. Editors -&amp;gt; &amp;quot;vim&amp;quot; is also recommended. Then you can use the instructions detailed in ssh to gateway above&lt;br /&gt;
* Install an SFTP/SCP/FTP client to allow for file sharing between the cluster and your local machine. WinSCP [http://www.winscp.net] is recommended. ExpanDrive can also be used to create a cluster-based network drive on your local machine.&lt;br /&gt;
&lt;br /&gt;
== Useful commands ==&lt;br /&gt;
&lt;br /&gt;
See https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/scheduler/ucb-supercluster-slurm-migration for a detailed FAQ on the SLURM job manager. &lt;br /&gt;
&lt;br /&gt;
=== SLURM usage ===&lt;br /&gt;
&lt;br /&gt;
* Submitting a Job&lt;br /&gt;
&lt;br /&gt;
From the login node, you can submit jobs to the compute nodes using the syntax&lt;br /&gt;
&lt;br /&gt;
  sbatch myscript.sh&lt;br /&gt;
&lt;br /&gt;
where the myscript.sh is an shell script containing the call to the executable to be submitted to the cluster. Typically, for a matlab job, it would look like&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash -l&lt;br /&gt;
  #SBATCH -p cortex&lt;br /&gt;
  #SBATCH --time=03:30:00&lt;br /&gt;
  #SBATCH --mem-per-cpu=2G&lt;br /&gt;
&lt;br /&gt;
  cd /clusterfs/cortex/scratch/working/dir/for/your/code&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;mymatlabfunction( parameters); exit&amp;quot;&lt;br /&gt;
  exit&lt;br /&gt;
&lt;br /&gt;
the --time defines the walltime of the job, which is an upper bound on the estimated runtime. The job will be killed after this time is elapsed. --mem specifies how much memory the job requires, the default is 1GB per job. &lt;br /&gt;
&lt;br /&gt;
* Monitoring Jobs &lt;br /&gt;
&lt;br /&gt;
Additional options can be passed to sbatch to monitor outputs from the running jobs&lt;br /&gt;
&lt;br /&gt;
    sbatch -o outputfile.txt -e errofile.txt -J jobdescriptor myscript.sh&lt;br /&gt;
&lt;br /&gt;
the output of the job will be piped to outputfile.txt and any errors if the job crashes to errofile.txt&lt;br /&gt;
&lt;br /&gt;
* Cluster usage&lt;br /&gt;
&lt;br /&gt;
Use&lt;br /&gt;
  squeue&lt;br /&gt;
to get a list of pending and running jobs on the cluster. It will show user names jobdescriptor passed to sbatch, runtime and nodes.&lt;br /&gt;
&lt;br /&gt;
=== Perceus commands ===&lt;br /&gt;
&lt;br /&gt;
The perceus manual is [http://www.warewulf-cluster.org/portal/book/export/html/7 here]&lt;br /&gt;
&lt;br /&gt;
* listing available cluster nodes:&lt;br /&gt;
&lt;br /&gt;
  wwstats&lt;br /&gt;
&lt;br /&gt;
* list cluster usage&lt;br /&gt;
&lt;br /&gt;
  wwtop&lt;br /&gt;
&lt;br /&gt;
* to restrict the scope of these commands to cortex cluster, add the following line to your .bashrc&lt;br /&gt;
&lt;br /&gt;
  export NODES=&#039;*cortex&#039;&lt;br /&gt;
&lt;br /&gt;
* module list&lt;br /&gt;
* module avail&lt;br /&gt;
* module help&lt;br /&gt;
&lt;br /&gt;
* help pages are [http://lrc.lbl.gov/html/guide.html here]&lt;br /&gt;
&lt;br /&gt;
=== Finding out the list of occupants on each cluster node ===&lt;br /&gt;
&lt;br /&gt;
* One can find out the list of users using a particular node by ssh into the node, e.g.&lt;br /&gt;
&lt;br /&gt;
  ssh n0000.cortex&lt;br /&gt;
&lt;br /&gt;
* After logging into the node, type&lt;br /&gt;
&lt;br /&gt;
  top&lt;br /&gt;
&lt;br /&gt;
* This is useful if you believe someone is abusing the machine and would like to send him/her a friendly reminder.&lt;br /&gt;
&lt;br /&gt;
= Software =&lt;br /&gt;
&lt;br /&gt;
== Matlab ==&lt;br /&gt;
&lt;br /&gt;
Start an interactive session on the cluster (requires specifying the cluster and walltime as is shown here):&lt;br /&gt;
&lt;br /&gt;
  srun -u -p cortex -t 2:0:0 bash -i&lt;br /&gt;
&lt;br /&gt;
In order to use matlab, you have to load the matlab environment:&lt;br /&gt;
&lt;br /&gt;
  module load matlab&lt;br /&gt;
&lt;br /&gt;
Once the matlab environment is loaded, you can start a matlab session by running&lt;br /&gt;
&lt;br /&gt;
  matlab -nodesktop&lt;br /&gt;
&lt;br /&gt;
An example PBS script for running matlab code is&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  # request 1 nodes with 2 CPUs &lt;br /&gt;
  #PBS -l nodes=1:ppn=2&lt;br /&gt;
  # reserve time on the selected cores&lt;br /&gt;
  #PBS -l walltime=01:00:00&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm &amp;lt;&amp;lt; EOF&lt;br /&gt;
  test # here you should have whatever you would normally type in the Matlab prompt&lt;br /&gt;
  exit&lt;br /&gt;
  EOF&lt;br /&gt;
&lt;br /&gt;
If you would like to see who is using matlab licenses, enter&lt;br /&gt;
&lt;br /&gt;
  lmstat&lt;br /&gt;
&lt;br /&gt;
== Python ==&lt;br /&gt;
&lt;br /&gt;
We have several Python Distributions installed: The Enthought Python Distribution (EPD), the Source Python Distribution (SPD) and Sage. The easiest way to get started is probably to use EPD (see below).&lt;br /&gt;
&lt;br /&gt;
=== Enthought Python Distribution (EPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Enthought Python Distribution 7.2.0 installed [[http://www.enthought.com/products/epd.php EPD]]. In order to use it, you have to follow the following steps:&lt;br /&gt;
&lt;br /&gt;
* login to the gateway server using &amp;quot;ssh -Y&amp;quot; (see above)&lt;br /&gt;
* start an interactive session using &amp;quot;srun -u -p cortex -t 2:0:0 bash -i&amp;quot; (see above)&lt;br /&gt;
* load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/epd&lt;br /&gt;
&lt;br /&gt;
* start ipython:&lt;br /&gt;
&lt;br /&gt;
  ipython -pylab&lt;br /&gt;
&lt;br /&gt;
* run the following commands inside ipython to test the setup:&lt;br /&gt;
&lt;br /&gt;
  from enthought.mayavi import mlab&lt;br /&gt;
  mlab.test_contour3d()&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== Source Python Distribution (SPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Source Python Distribution installed [[http://code.google.com/p/spdproject/ SPD]]. In order to use it, you have to first load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
&lt;br /&gt;
Afterwards, you can run ipython&lt;br /&gt;
&lt;br /&gt;
  % ipython -pylab&lt;br /&gt;
&lt;br /&gt;
At the moment, we have numpy, scipy, and matplotlib installed. If you would like to have additional modules installed, let me know [[mailto:kilian@berkeley.edu kilian]]&lt;br /&gt;
&lt;br /&gt;
=== Sage ===&lt;br /&gt;
&lt;br /&gt;
Sage is [http://sagemath.org http://sagemath.org]. In order to use sage, you have to first load the sage environment module&lt;br /&gt;
&lt;br /&gt;
  module load python/sage&lt;br /&gt;
&lt;br /&gt;
After loading the sage module, if you want to have a scipy environment (run ipython, etc) in your interactive session, first do:&lt;br /&gt;
&lt;br /&gt;
  % sage -sh&lt;br /&gt;
&lt;br /&gt;
then you can run:&lt;br /&gt;
&lt;br /&gt;
  % ipython&lt;br /&gt;
&lt;br /&gt;
or you can just do:&lt;br /&gt;
&lt;br /&gt;
  % sage -ipython&lt;br /&gt;
&lt;br /&gt;
This is a temporary solution for people wanting use scipy with mpi on the cluster. It was built against the default openmpi (1.2.8) (icc) and mpi4py 1.1.0. For those using hdf5, I also built hdf5 1.8.3 (gcc)  and h5py 1.2.&lt;br /&gt;
&lt;br /&gt;
Sample pbs and mpi script is here:&lt;br /&gt;
&lt;br /&gt;
  ~amirk/test&lt;br /&gt;
&lt;br /&gt;
You can run it as:&lt;br /&gt;
&lt;br /&gt;
  % mkdir -p ~/jobs&lt;br /&gt;
  % cd ~amirk/test&lt;br /&gt;
  % qsub pbs&lt;br /&gt;
&lt;br /&gt;
--Amir&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== CUDA ==&lt;br /&gt;
&lt;br /&gt;
CUDA is a library to use the graphics processing units (GPU) on the graphics card for general-purpose computing. We have a separate wiki page to collect information on how to do general-purpose computing on the GPU: [[GPGPU]].&lt;br /&gt;
We have installed the CUDA 3.0 driver and toolkit.&lt;br /&gt;
&lt;br /&gt;
In order to use CUDA, you have to load the CUDA environment:&lt;br /&gt;
&lt;br /&gt;
  module load cuda&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock in python ===&lt;br /&gt;
&lt;br /&gt;
If you would like to use one of the GPU cards on node n0000 or n0001, please optain a GPU lock to make sure the card is not in use and that no one else will be using the card. &lt;br /&gt;
&lt;br /&gt;
If you are using Python, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  import gpu_lock&lt;br /&gt;
  gpu_lock.obtain_lock_id()&lt;br /&gt;
&lt;br /&gt;
The function either returns the number of the card you can use (0 or 1) or -1 if both cards are in use.&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock for Jacket in Matlab ===&lt;br /&gt;
&lt;br /&gt;
If you are using Matlab, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/gpu_lock&#039;);&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/jacket/engine&#039;);&lt;br /&gt;
  gpu_id = obtain_gpu_lock_id();&lt;br /&gt;
  gselect(gpu_id);&lt;br /&gt;
&lt;br /&gt;
By default, obtain_gpu_lock() throws an error when all gpu cards are taken.&lt;br /&gt;
There is another option: obtain_gpu_lock_id(true) will return -1 in case there&lt;br /&gt;
is no card available and you can then write your own code to deal with that&lt;br /&gt;
fact.&lt;br /&gt;
&lt;br /&gt;
ginfo tells you which gpu card you are using.&lt;br /&gt;
&lt;br /&gt;
The following lines should also be in your .bashrc&lt;br /&gt;
&lt;br /&gt;
  ## jacket stuff!&lt;br /&gt;
  module load cuda&lt;br /&gt;
  export LD_LIBRARY_PATH=/clusterfs/cortex/software/jacket/engine/lib64:$LD_LIBRARY_PATH&lt;br /&gt;
&lt;br /&gt;
=== CUDA SDK (Outdated since version change to 3.0) ===&lt;br /&gt;
&lt;br /&gt;
You can install the CUDA SDK by running&lt;br /&gt;
&lt;br /&gt;
  bash /clusterfs/cortex/software/cuda-2.3/src/cudasdk_2.3_linux.run&lt;br /&gt;
&lt;br /&gt;
You can compile all the code examples by running&lt;br /&gt;
&lt;br /&gt;
  module load X11&lt;br /&gt;
  module load Mesa/7.4.4&lt;br /&gt;
  cd ~/NVIDIA_GPU_Computing_SDK/C&lt;br /&gt;
  make&lt;br /&gt;
&lt;br /&gt;
The compiled examples can be found in the directory&lt;br /&gt;
&lt;br /&gt;
  ~/NVIDIA_GPU_Computing_SDK/C/bin/linux/release&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;note:&#039;&#039;&#039; The examples using graphics with OpenGL don&#039;t seem to run on a remote X server. In order to make them work, we probably need to install something like [http://www.virtualgl.org/ virtualgl].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== PyCuda ===&lt;br /&gt;
&lt;br /&gt;
PyCuda 0.93 is installed as part of the Source Python Distribution (SPD). This is how you run all unit tests:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
  cd /clusterfs/cortex/software/src/pycuda-0.93/test/&lt;br /&gt;
  nosetests&lt;br /&gt;
&lt;br /&gt;
If you are having trouble installing PyCuda, please note the following:&lt;br /&gt;
&lt;br /&gt;
* gcc 4.1.2 related issues with boost [http://tinyurl.com/28zrjnv]&lt;br /&gt;
* also, gcc 4.1.2 related [http://tinyurl.com/25obx6g]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Usage Tips =&lt;br /&gt;
Here are some tips on how to effectively use the cluster.&lt;br /&gt;
&lt;br /&gt;
== Embarrassingly Parallel Submissions ==&lt;br /&gt;
&lt;br /&gt;
Here is an alternate script to do embarrassingly parallel submissions on the cluster.&lt;br /&gt;
 &lt;br /&gt;
iterate.sh&lt;br /&gt;
  #!/bin/sh&lt;br /&gt;
  #Leap Size&lt;br /&gt;
  param1=11&lt;br /&gt;
  param2=1.2&lt;br /&gt;
  param3=.75&lt;br /&gt;
  #LeapSize&lt;br /&gt;
  for i in 14 15 16&lt;br /&gt;
  do&lt;br /&gt;
  #Epsilon&lt;br /&gt;
   for j in $(seq .8 .1 $param2);&lt;br /&gt;
       do&lt;br /&gt;
       #Beta&lt;br /&gt;
       for k in $(seq .65 .01 $param3);&lt;br /&gt;
             do&lt;br /&gt;
                 echo $i,$j,$k&lt;br /&gt;
                 qsub param_test.sh  -v &amp;quot;LeapSize=$i,Epsilon=$j,Beta=$k&amp;quot;&lt;br /&gt;
             done&lt;br /&gt;
       done&lt;br /&gt;
   done&lt;br /&gt;
&lt;br /&gt;
param_test.sh&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  #PBS -l nodes=1:ppn=2:gpu&lt;br /&gt;
  #PBS -l walltime=10:35:00&lt;br /&gt;
  #PBS -o /global/home/users/mayur/Logs&lt;br /&gt;
  #PBS -e /global/home/users/mayur/Errors&lt;br /&gt;
  cd /global/home/users/mayur/HMC_reducedflip/&lt;br /&gt;
  module load matlab&lt;br /&gt;
  echo &amp;quot;Epsilon = &amp;quot;,$Epsilon&lt;br /&gt;
  echo &amp;quot;Leap Size = &amp;quot;,$LeapSize&lt;br /&gt;
  echo &amp;quot;Beta = &amp;quot;,$Beta&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;make_figures_fneval_cluster $LeapSize $Epsilon $Beta&amp;quot;&lt;br /&gt;
&lt;br /&gt;
   Now run ./iterate.sh&lt;br /&gt;
&lt;br /&gt;
== Mounting Cluster File System ==&lt;br /&gt;
Mounting the cluster file system remotely allows you to easily access files on the cluster, and allows you to use local programs to edit code or examine simulation outputs locally (very useful). I often edit the remote code using a text editor running on my local machine. This allows you to take advantage of the niceties of a native editor without having to copy code back and forth before you run a simulation on the cluster.&lt;br /&gt;
&lt;br /&gt;
On linux distributions you can mount your cluster home directory locally using sshfs [http://fuse.sourceforge.net/sshfs.html]&lt;br /&gt;
&lt;br /&gt;
  sshfs hadley.berkeley.edu: &amp;lt;mount-dir&amp;gt;&lt;br /&gt;
&lt;br /&gt;
On Mac and Windows machines the program ExpanDrive works well (uses Fuse under the hood): [http://www.expandrive.com]&lt;br /&gt;
&lt;br /&gt;
= Support Requests =&lt;br /&gt;
&lt;br /&gt;
* If you have a problem that is not covered on this page, you can send an email to our user list:&lt;br /&gt;
&lt;br /&gt;
  [mailto:redwood_cluster@lists.berkeley.edu redwood_cluster@lists.berkeley.edu]&lt;br /&gt;
&lt;br /&gt;
* If you need additional help from the LBL group, send an email to their email list. Please always cc our email list as well. Or visit their website[https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/].&lt;br /&gt;
&lt;br /&gt;
  [mailto:hpcshelp@lbl.gov hpcshelp@lbl.gov]&lt;br /&gt;
&lt;br /&gt;
* In urgent cases, you can also email [mailto:kmuriki@lbl.gov Krishna Muriki] (LBL User Services) directly.&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Cluster&amp;diff=7055</id>
		<title>Cluster</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Cluster&amp;diff=7055"/>
		<updated>2013-07-08T20:29:59Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* ssh to the gateway computer (hadley) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Video Tutorial=&lt;br /&gt;
&lt;br /&gt;
Taught by our cluster aficionado and computer master, Mayur Mudigonda.  Please watch and or read below information it before asking him questions: [https://archive.org/details/MayurClusterTutorial_201304]&lt;br /&gt;
&lt;br /&gt;
= General Information =&lt;br /&gt;
&lt;br /&gt;
Contrary to popularly held belief, our cluster is not a magical computational powerhorse that will take your code and make it run hundreds of times faster. Read on to find out what it is, and how you might utilize it. &lt;br /&gt;
&lt;br /&gt;
We have about a dozen somewhat heterogeneous machines, many of which can be matched or exceeded in performance today by purchasing a $300-$400 desktop, or a laptop costing twice as much. There are exceptions to this. For example, there are a couple of machines which have graphics cards (GPUs) which cost about the same, but to take advantage of them, your code needs to be written specifically for the GPU using CUDA / OpenCL or it needs to call into libraries and packages which do that dirty work for you, such as PyCUDA / PyOpenCL or Jacket for Matlab. A few machines have a bit of extra memory (12-16G). The network connectivity is comparable to what we have in the lab (i.e. it is &#039;&#039;&#039;not&#039;&#039;&#039; some exotic ultra fast network interface utilizing a fancy topology).&lt;br /&gt;
&lt;br /&gt;
Given the above, the typical use cases for the cluster are that you have jobs that run in parallel which are independent, so having several machines will complete the task faster, even though any one machine might not be faster than your own laptop. Or you have a long running job which may take a day, and you don&#039;t want to worry about having to leave your laptop on at all times and not be able to use it. Another reason is that your code leverages a communication scheme (such as MPI) to have multiple machines cooperatively work on a problem. In order for the cluster to be useful and well-utilized, it works best for everyone to submit jobs (see &#039;&#039;&#039;qsub&#039;&#039;&#039; further down on this page for the details) to the queue which may not start right away, but which will get run once their turn comes. Please do not run extended interactive sessions or ssh directly to worker nodes for performing computation.&lt;br /&gt;
&lt;br /&gt;
== Hardware Overview == &lt;br /&gt;
&lt;br /&gt;
We are in the process of upgrading the older machines in the cluster. We currently have:&lt;br /&gt;
  #   Node names   CPU type           Speed   CPU count		Memory	Vintage	GPU &lt;br /&gt;
  2x  n0000-n0001  Intel Xeon E5410 @ 2.33GHz dual 4-core	16GB	2007 	Tesla GPUs&lt;br /&gt;
  10x n0002-n0011 Intel Xeon E3-1220 @ 3.1GHz 4-core 		16GB	2012	no GPU&lt;br /&gt;
  2x  n0012-n0013  Intel Xeon X5650 @ 2.66GHz dual 6-core	24GB	2010 	Fermi GPUs&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
In addition to the compute nodes we own a file server&lt;br /&gt;
  NetOp 4TB&lt;br /&gt;
which is mounted as scratch space.&lt;br /&gt;
&lt;br /&gt;
== Getting an account and crypto card == &lt;br /&gt;
If reading the above does not deter you, in order to get an account on the cluster, please send an email to Mayur Mudigonda (lastname AT berk...edu) with the following information:&lt;br /&gt;
&lt;br /&gt;
    Full Name &amp;lt;emailaddress&amp;gt; desiredusername&lt;br /&gt;
&lt;br /&gt;
You can also include a note about which PI you are working with. Note: the &#039;&#039;&#039;desireusername&#039;&#039;&#039; must be 3-8 characters long, so it would have been truncated to &#039;&#039;&#039;desireus&#039;&#039;&#039; in this case.&lt;br /&gt;
&lt;br /&gt;
It takes the SCS folks about one to two weeks to make the accounts and ship a new crypto card token to you. You&#039;ll need to sign and fax back to them a form that arrives with the crypto card, and then leave the hardcopy of it in my box. -pi&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;OTP (One Time Password) Service&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Once you have a username you can follow the instructions found here https://commons.lbl.gov/display/itfaq/OTP+%28One+Time+Password%29+Service to get access to the cluster (see &#039;&#039;&#039;Installing and Configuring the OTP Token&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
== Directory setup ==&lt;br /&gt;
&lt;br /&gt;
=== home directory quota ===&lt;br /&gt;
&lt;br /&gt;
There is a 10GB quota limit enforced on $HOME directory&lt;br /&gt;
(/global/home/users/username) usage. Please keep your usage below&lt;br /&gt;
this limit. There will NETAPP snapshots in place in this file&lt;br /&gt;
system so we suggest you store only your source code and scripts&lt;br /&gt;
in this area and store all your data under /clusterfs/cortex&lt;br /&gt;
(see below).&lt;br /&gt;
&lt;br /&gt;
In order to see your current quota and usage, use the following command:&lt;br /&gt;
&lt;br /&gt;
  quota -s&lt;br /&gt;
&lt;br /&gt;
=== data ===&lt;br /&gt;
&lt;br /&gt;
For large amounts of data, please create a directory&lt;br /&gt;
&lt;br /&gt;
  /clusterfs/cortex/scratch/username&lt;br /&gt;
&lt;br /&gt;
and store the data inside that directory. Note that unlike the home directory, scratch space is not backed up and permanence of your data is not guaranteed. There is a total limit of 4 TB for this drive that is shared by everyone at the Redwood center.&lt;br /&gt;
&lt;br /&gt;
== Connect ==&lt;br /&gt;
&lt;br /&gt;
=== get a password ===&lt;br /&gt;
&lt;br /&gt;
* Press the &amp;quot;PASSWORD&amp;quot; button to power on the CryptoCard. You will see &amp;quot;PIN?&amp;quot; request prompt&lt;br /&gt;
* Enter your PIN, and press the &amp;quot;ENT&amp;quot; key.&lt;br /&gt;
* You should see 7 digits presented like a phone number; this is your one-time password&lt;br /&gt;
&lt;br /&gt;
=== ssh to the gateway computer (hadley) ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; note: please don&#039;t use the gateway for computations (e.g. matlab)! &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
  ssh -Y neuro-calhpc.berkeley.edu (or hadley.berkeley.edu) &lt;br /&gt;
&lt;br /&gt;
and use your crypto password&lt;br /&gt;
&lt;br /&gt;
If you intend on working in a GUI session you can add a -C flag to command above to enable compression for data sent through the ssh tunnel.&lt;br /&gt;
&lt;br /&gt;
=== Setup environment ===&lt;br /&gt;
&lt;br /&gt;
* put all your customizations into your .bashrc &lt;br /&gt;
* for login shells, .bash_profile is used, which in turn loads .bashrc&lt;br /&gt;
&lt;br /&gt;
=== Using a Windows machine ===&lt;br /&gt;
Windows is not a Unix-based operating system and as a result does not natively interface with a Unix environment. Download the 2 following pieces of software to create a workaround:&lt;br /&gt;
* Install a Unix environment emulator to interface directly with the cluster. Cygwin [http://www.cygwin.com] seems to work well. During installation make sure to install Net -&amp;gt; &amp;quot;openssh&amp;quot;. Editors -&amp;gt; &amp;quot;vim&amp;quot; is also recommended. Then you can use the instructions detailed in ssh to gateway above&lt;br /&gt;
* Install an SFTP/SCP/FTP client to allow for file sharing between the cluster and your local machine. WinSCP [http://www.winscp.net] is recommended. ExpanDrive can also be used to create a cluster-based network drive on your local machine.&lt;br /&gt;
&lt;br /&gt;
== Useful commands ==&lt;br /&gt;
&lt;br /&gt;
See https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/scheduler/ucb-supercluster-slurm-migration for a detailed FAQ on the SLURM job manager. &lt;br /&gt;
&lt;br /&gt;
=== SLURM usage ===&lt;br /&gt;
&lt;br /&gt;
* Submitting a Job&lt;br /&gt;
&lt;br /&gt;
From the login node, you can submit jobs to the compute nodes using the syntax&lt;br /&gt;
&lt;br /&gt;
  sbatch myscript.sh&lt;br /&gt;
&lt;br /&gt;
where the myscript.sh is an shell script containing the call to the executable to be submitted to the cluster. Typically, for a matlab job, it would look like&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash -l&lt;br /&gt;
  #SBATCH -p cortex&lt;br /&gt;
  #SBATCH --time=03:30:00&lt;br /&gt;
  #SBATCH --mem-per-cpu=2G&lt;br /&gt;
&lt;br /&gt;
  cd /clusterfs/cortex/scratch/working/dir/for/your/code&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;mymatlabfunction( parameters); exit&amp;quot;&lt;br /&gt;
  exit&lt;br /&gt;
&lt;br /&gt;
the --time defines the walltime of the job, which is an upper bound on the estimated runtime. The job will be killed after this time is elapsed. --mem specifies how much memory the job requires, the default is 1GB per job. &lt;br /&gt;
&lt;br /&gt;
* Monitoring Jobs &lt;br /&gt;
&lt;br /&gt;
Additional options can be passed to sbatch to monitor outputs from the running jobs&lt;br /&gt;
&lt;br /&gt;
    sbatch -o outputfile.txt -e errofile.txt -J jobdescriptor myscript.sh&lt;br /&gt;
&lt;br /&gt;
the output of the job will be piped to outputfile.txt and any errors if the job crashes to errofile.txt&lt;br /&gt;
&lt;br /&gt;
* Cluster usage&lt;br /&gt;
&lt;br /&gt;
Use&lt;br /&gt;
  squeue&lt;br /&gt;
to get a list of pending and running jobs on the cluster. It will show user names jobdescriptor passed to sbatch, runtime and nodes.&lt;br /&gt;
&lt;br /&gt;
=== Perceus commands ===&lt;br /&gt;
&lt;br /&gt;
The perceus manual is [http://www.warewulf-cluster.org/portal/book/export/html/7 here]&lt;br /&gt;
&lt;br /&gt;
* listing available cluster nodes:&lt;br /&gt;
&lt;br /&gt;
  wwstats&lt;br /&gt;
&lt;br /&gt;
* list cluster usage&lt;br /&gt;
&lt;br /&gt;
  wwtop&lt;br /&gt;
&lt;br /&gt;
* to restrict the scope of these commands to cortex cluster, add the following line to your .bashrc&lt;br /&gt;
&lt;br /&gt;
  export NODES=&#039;*cortex&#039;&lt;br /&gt;
&lt;br /&gt;
* module list&lt;br /&gt;
* module avail&lt;br /&gt;
* module help&lt;br /&gt;
&lt;br /&gt;
* help pages are [http://lrc.lbl.gov/html/guide.html here]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Finding out the list of occupants on each cluster node ===&lt;br /&gt;
&lt;br /&gt;
* One can find out the list of users using a particular node by ssh into the node, e.g.&lt;br /&gt;
&lt;br /&gt;
  ssh n0000.cortex&lt;br /&gt;
&lt;br /&gt;
* After logging into the node, type&lt;br /&gt;
&lt;br /&gt;
  top&lt;br /&gt;
&lt;br /&gt;
* This is useful if you believe someone is abusing the machine and would like to send him/her a friendly reminder.&lt;br /&gt;
&lt;br /&gt;
= Software =&lt;br /&gt;
&lt;br /&gt;
== Matlab ==&lt;br /&gt;
&lt;br /&gt;
Start an interactive session on the cluster (requires specifying the cluster and walltime as is shown here):&lt;br /&gt;
&lt;br /&gt;
  srun -u -p cortex -t 2:0:0 bash -i&lt;br /&gt;
&lt;br /&gt;
In order to use matlab, you have to load the matlab environment:&lt;br /&gt;
&lt;br /&gt;
  module load matlab&lt;br /&gt;
&lt;br /&gt;
Once the matlab environment is loaded, you can start a matlab session by running&lt;br /&gt;
&lt;br /&gt;
  matlab -nodesktop&lt;br /&gt;
&lt;br /&gt;
An example PBS script for running matlab code is&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  # request 1 nodes with 2 CPUs &lt;br /&gt;
  #PBS -l nodes=1:ppn=2&lt;br /&gt;
  # reserve time on the selected cores&lt;br /&gt;
  #PBS -l walltime=01:00:00&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm &amp;lt;&amp;lt; EOF&lt;br /&gt;
  test # here you should have whatever you would normally type in the Matlab prompt&lt;br /&gt;
  exit&lt;br /&gt;
  EOF&lt;br /&gt;
&lt;br /&gt;
If you would like to see who is using matlab licenses, enter&lt;br /&gt;
&lt;br /&gt;
  lmstat&lt;br /&gt;
&lt;br /&gt;
== Python ==&lt;br /&gt;
&lt;br /&gt;
We have several Python Distributions installed: The Enthought Python Distribution (EPD), the Source Python Distribution (SPD) and Sage. The easiest way to get started is probably to use EPD (see below).&lt;br /&gt;
&lt;br /&gt;
=== Enthought Python Distribution (EPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Enthought Python Distribution 7.2.0 installed [[http://www.enthought.com/products/epd.php EPD]]. In order to use it, you have to follow the following steps:&lt;br /&gt;
&lt;br /&gt;
* login to the gateway server using &amp;quot;ssh -Y&amp;quot; (see above)&lt;br /&gt;
* start an interactive session using &amp;quot;srun -u -p cortex -t 2:0:0 bash -i&amp;quot; (see above)&lt;br /&gt;
* load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/epd&lt;br /&gt;
&lt;br /&gt;
* start ipython:&lt;br /&gt;
&lt;br /&gt;
  ipython -pylab&lt;br /&gt;
&lt;br /&gt;
* run the following commands inside ipython to test the setup:&lt;br /&gt;
&lt;br /&gt;
  from enthought.mayavi import mlab&lt;br /&gt;
  mlab.test_contour3d()&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== Source Python Distribution (SPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Source Python Distribution installed [[http://code.google.com/p/spdproject/ SPD]]. In order to use it, you have to first load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
&lt;br /&gt;
Afterwards, you can run ipython&lt;br /&gt;
&lt;br /&gt;
  % ipython -pylab&lt;br /&gt;
&lt;br /&gt;
At the moment, we have numpy, scipy, and matplotlib installed. If you would like to have additional modules installed, let me know [[mailto:kilian@berkeley.edu kilian]]&lt;br /&gt;
&lt;br /&gt;
=== Sage ===&lt;br /&gt;
&lt;br /&gt;
Sage is [http://sagemath.org http://sagemath.org]. In order to use sage, you have to first load the sage environment module&lt;br /&gt;
&lt;br /&gt;
  module load python/sage&lt;br /&gt;
&lt;br /&gt;
After loading the sage module, if you want to have a scipy environment (run ipython, etc) in your interactive session, first do:&lt;br /&gt;
&lt;br /&gt;
  % sage -sh&lt;br /&gt;
&lt;br /&gt;
then you can run:&lt;br /&gt;
&lt;br /&gt;
  % ipython&lt;br /&gt;
&lt;br /&gt;
or you can just do:&lt;br /&gt;
&lt;br /&gt;
  % sage -ipython&lt;br /&gt;
&lt;br /&gt;
This is a temporary solution for people wanting use scipy with mpi on the cluster. It was built against the default openmpi (1.2.8) (icc) and mpi4py 1.1.0. For those using hdf5, I also built hdf5 1.8.3 (gcc)  and h5py 1.2.&lt;br /&gt;
&lt;br /&gt;
Sample pbs and mpi script is here:&lt;br /&gt;
&lt;br /&gt;
  ~amirk/test&lt;br /&gt;
&lt;br /&gt;
You can run it as:&lt;br /&gt;
&lt;br /&gt;
  % mkdir -p ~/jobs&lt;br /&gt;
  % cd ~amirk/test&lt;br /&gt;
  % qsub pbs&lt;br /&gt;
&lt;br /&gt;
--Amir&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== CUDA ==&lt;br /&gt;
&lt;br /&gt;
CUDA is a library to use the graphics processing units (GPU) on the graphics card for general-purpose computing. We have a separate wiki page to collect information on how to do general-purpose computing on the GPU: [[GPGPU]].&lt;br /&gt;
We have installed the CUDA 3.0 driver and toolkit.&lt;br /&gt;
&lt;br /&gt;
In order to use CUDA, you have to load the CUDA environment:&lt;br /&gt;
&lt;br /&gt;
  module load cuda&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock in python ===&lt;br /&gt;
&lt;br /&gt;
If you would like to use one of the GPU cards on node n0000 or n0001, please optain a GPU lock to make sure the card is not in use and that no one else will be using the card. &lt;br /&gt;
&lt;br /&gt;
If you are using Python, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  import gpu_lock&lt;br /&gt;
  gpu_lock.obtain_lock_id()&lt;br /&gt;
&lt;br /&gt;
The function either returns the number of the card you can use (0 or 1) or -1 if both cards are in use.&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock for Jacket in Matlab ===&lt;br /&gt;
&lt;br /&gt;
If you are using Matlab, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/gpu_lock&#039;);&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/jacket/engine&#039;);&lt;br /&gt;
  gpu_id = obtain_gpu_lock_id();&lt;br /&gt;
  gselect(gpu_id);&lt;br /&gt;
&lt;br /&gt;
By default, obtain_gpu_lock() throws an error when all gpu cards are taken.&lt;br /&gt;
There is another option: obtain_gpu_lock_id(true) will return -1 in case there&lt;br /&gt;
is no card available and you can then write your own code to deal with that&lt;br /&gt;
fact.&lt;br /&gt;
&lt;br /&gt;
ginfo tells you which gpu card you are using.&lt;br /&gt;
&lt;br /&gt;
The following lines should also be in your .bashrc&lt;br /&gt;
&lt;br /&gt;
  ## jacket stuff!&lt;br /&gt;
  module load cuda&lt;br /&gt;
  export LD_LIBRARY_PATH=/clusterfs/cortex/software/jacket/engine/lib64:$LD_LIBRARY_PATH&lt;br /&gt;
&lt;br /&gt;
=== CUDA SDK (Outdated since version change to 3.0) ===&lt;br /&gt;
&lt;br /&gt;
You can install the CUDA SDK by running&lt;br /&gt;
&lt;br /&gt;
  bash /clusterfs/cortex/software/cuda-2.3/src/cudasdk_2.3_linux.run&lt;br /&gt;
&lt;br /&gt;
You can compile all the code examples by running&lt;br /&gt;
&lt;br /&gt;
  module load X11&lt;br /&gt;
  module load Mesa/7.4.4&lt;br /&gt;
  cd ~/NVIDIA_GPU_Computing_SDK/C&lt;br /&gt;
  make&lt;br /&gt;
&lt;br /&gt;
The compiled examples can be found in the directory&lt;br /&gt;
&lt;br /&gt;
  ~/NVIDIA_GPU_Computing_SDK/C/bin/linux/release&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;note:&#039;&#039;&#039; The examples using graphics with OpenGL don&#039;t seem to run on a remote X server. In order to make them work, we probably need to install something like [http://www.virtualgl.org/ virtualgl].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== PyCuda ===&lt;br /&gt;
&lt;br /&gt;
PyCuda 0.93 is installed as part of the Source Python Distribution (SPD). This is how you run all unit tests:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
  cd /clusterfs/cortex/software/src/pycuda-0.93/test/&lt;br /&gt;
  nosetests&lt;br /&gt;
&lt;br /&gt;
If you are having trouble installing PyCuda, please note the following:&lt;br /&gt;
&lt;br /&gt;
* gcc 4.1.2 related issues with boost [http://tinyurl.com/28zrjnv]&lt;br /&gt;
* also, gcc 4.1.2 related [http://tinyurl.com/25obx6g]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Usage Tips =&lt;br /&gt;
Here are some tips on how to effectively use the cluster.&lt;br /&gt;
&lt;br /&gt;
== Embarrassingly Parallel Submissions ==&lt;br /&gt;
&lt;br /&gt;
Here is an alternate script to do embarrassingly parallel submissions on the cluster.&lt;br /&gt;
 &lt;br /&gt;
iterate.sh&lt;br /&gt;
  #!/bin/sh&lt;br /&gt;
  #Leap Size&lt;br /&gt;
  param1=11&lt;br /&gt;
  param2=1.2&lt;br /&gt;
  param3=.75&lt;br /&gt;
  #LeapSize&lt;br /&gt;
  for i in 14 15 16&lt;br /&gt;
  do&lt;br /&gt;
  #Epsilon&lt;br /&gt;
   for j in $(seq .8 .1 $param2);&lt;br /&gt;
       do&lt;br /&gt;
       #Beta&lt;br /&gt;
       for k in $(seq .65 .01 $param3);&lt;br /&gt;
             do&lt;br /&gt;
                 echo $i,$j,$k&lt;br /&gt;
                 qsub param_test.sh  -v &amp;quot;LeapSize=$i,Epsilon=$j,Beta=$k&amp;quot;&lt;br /&gt;
             done&lt;br /&gt;
       done&lt;br /&gt;
   done&lt;br /&gt;
&lt;br /&gt;
param_test.sh&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  #PBS -l nodes=1:ppn=2:gpu&lt;br /&gt;
  #PBS -l walltime=10:35:00&lt;br /&gt;
  #PBS -o /global/home/users/mayur/Logs&lt;br /&gt;
  #PBS -e /global/home/users/mayur/Errors&lt;br /&gt;
  cd /global/home/users/mayur/HMC_reducedflip/&lt;br /&gt;
  module load matlab&lt;br /&gt;
  echo &amp;quot;Epsilon = &amp;quot;,$Epsilon&lt;br /&gt;
  echo &amp;quot;Leap Size = &amp;quot;,$LeapSize&lt;br /&gt;
  echo &amp;quot;Beta = &amp;quot;,$Beta&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;make_figures_fneval_cluster $LeapSize $Epsilon $Beta&amp;quot;&lt;br /&gt;
&lt;br /&gt;
   Now run ./iterate.sh&lt;br /&gt;
&lt;br /&gt;
== Mounting Cluster File System ==&lt;br /&gt;
Mounting the cluster file system remotely allows you to easily access files on the cluster, and allows you to use local programs to edit code or examine simulation outputs locally (very useful). I often edit the remote code using a text editor running on my local machine. This allows you to take advantage of the niceties of a native editor without having to copy code back and forth before you run a simulation on the cluster.&lt;br /&gt;
&lt;br /&gt;
On linux distributions you can mount your cluster home directory locally using sshfs [http://fuse.sourceforge.net/sshfs.html]&lt;br /&gt;
&lt;br /&gt;
  sshfs hadley.berkeley.edu: &amp;lt;mount-dir&amp;gt;&lt;br /&gt;
&lt;br /&gt;
On Mac and Windows machines the program ExpanDrive works well (uses Fuse under the hood): [http://www.expandrive.com]&lt;br /&gt;
&lt;br /&gt;
= Support Requests =&lt;br /&gt;
&lt;br /&gt;
* If you have a problem that is not covered on this page, you can send an email to our user list:&lt;br /&gt;
&lt;br /&gt;
  [mailto:redwood_cluster@lists.berkeley.edu redwood_cluster@lists.berkeley.edu]&lt;br /&gt;
&lt;br /&gt;
* If you need additional help from the LBL group, send an email to their email list. Please always cc our email list as well. Or visit their website[https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/].&lt;br /&gt;
&lt;br /&gt;
  [mailto:hpcshelp@lbl.gov hpcshelp@lbl.gov]&lt;br /&gt;
&lt;br /&gt;
* In urgent cases, you can also email [mailto:kmuriki@lbl.gov Krishna Muriki] (LBL User Services) directly.&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Cluster&amp;diff=7054</id>
		<title>Cluster</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Cluster&amp;diff=7054"/>
		<updated>2013-07-08T20:28:38Z</updated>

		<summary type="html">&lt;p&gt;Zayd: /* Using a Windows machine */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Video Tutorial=&lt;br /&gt;
&lt;br /&gt;
Taught by our cluster aficionado and computer master, Mayur Mudigonda.  Please watch and or read below information it before asking him questions: [https://archive.org/details/MayurClusterTutorial_201304]&lt;br /&gt;
&lt;br /&gt;
= General Information =&lt;br /&gt;
&lt;br /&gt;
Contrary to popularly held belief, our cluster is not a magical computational powerhorse that will take your code and make it run hundreds of times faster. Read on to find out what it is, and how you might utilize it. &lt;br /&gt;
&lt;br /&gt;
We have about a dozen somewhat heterogeneous machines, many of which can be matched or exceeded in performance today by purchasing a $300-$400 desktop, or a laptop costing twice as much. There are exceptions to this. For example, there are a couple of machines which have graphics cards (GPUs) which cost about the same, but to take advantage of them, your code needs to be written specifically for the GPU using CUDA / OpenCL or it needs to call into libraries and packages which do that dirty work for you, such as PyCUDA / PyOpenCL or Jacket for Matlab. A few machines have a bit of extra memory (12-16G). The network connectivity is comparable to what we have in the lab (i.e. it is &#039;&#039;&#039;not&#039;&#039;&#039; some exotic ultra fast network interface utilizing a fancy topology).&lt;br /&gt;
&lt;br /&gt;
Given the above, the typical use cases for the cluster are that you have jobs that run in parallel which are independent, so having several machines will complete the task faster, even though any one machine might not be faster than your own laptop. Or you have a long running job which may take a day, and you don&#039;t want to worry about having to leave your laptop on at all times and not be able to use it. Another reason is that your code leverages a communication scheme (such as MPI) to have multiple machines cooperatively work on a problem. In order for the cluster to be useful and well-utilized, it works best for everyone to submit jobs (see &#039;&#039;&#039;qsub&#039;&#039;&#039; further down on this page for the details) to the queue which may not start right away, but which will get run once their turn comes. Please do not run extended interactive sessions or ssh directly to worker nodes for performing computation.&lt;br /&gt;
&lt;br /&gt;
== Hardware Overview == &lt;br /&gt;
&lt;br /&gt;
We are in the process of upgrading the older machines in the cluster. We currently have:&lt;br /&gt;
  #   Node names   CPU type           Speed   CPU count		Memory	Vintage	GPU &lt;br /&gt;
  2x  n0000-n0001  Intel Xeon E5410 @ 2.33GHz dual 4-core	16GB	2007 	Tesla GPUs&lt;br /&gt;
  10x n0002-n0011 Intel Xeon E3-1220 @ 3.1GHz 4-core 		16GB	2012	no GPU&lt;br /&gt;
  2x  n0012-n0013  Intel Xeon X5650 @ 2.66GHz dual 6-core	24GB	2010 	Fermi GPUs&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
In addition to the compute nodes we own a file server&lt;br /&gt;
  NetOp 4TB&lt;br /&gt;
which is mounted as scratch space.&lt;br /&gt;
&lt;br /&gt;
== Getting an account and crypto card == &lt;br /&gt;
If reading the above does not deter you, in order to get an account on the cluster, please send an email to Mayur Mudigonda (lastname AT berk...edu) with the following information:&lt;br /&gt;
&lt;br /&gt;
    Full Name &amp;lt;emailaddress&amp;gt; desiredusername&lt;br /&gt;
&lt;br /&gt;
You can also include a note about which PI you are working with. Note: the &#039;&#039;&#039;desireusername&#039;&#039;&#039; must be 3-8 characters long, so it would have been truncated to &#039;&#039;&#039;desireus&#039;&#039;&#039; in this case.&lt;br /&gt;
&lt;br /&gt;
It takes the SCS folks about one to two weeks to make the accounts and ship a new crypto card token to you. You&#039;ll need to sign and fax back to them a form that arrives with the crypto card, and then leave the hardcopy of it in my box. -pi&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;OTP (One Time Password) Service&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Once you have a username you can follow the instructions found here https://commons.lbl.gov/display/itfaq/OTP+%28One+Time+Password%29+Service to get access to the cluster (see &#039;&#039;&#039;Installing and Configuring the OTP Token&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
== Directory setup ==&lt;br /&gt;
&lt;br /&gt;
=== home directory quota ===&lt;br /&gt;
&lt;br /&gt;
There is a 10GB quota limit enforced on $HOME directory&lt;br /&gt;
(/global/home/users/username) usage. Please keep your usage below&lt;br /&gt;
this limit. There will NETAPP snapshots in place in this file&lt;br /&gt;
system so we suggest you store only your source code and scripts&lt;br /&gt;
in this area and store all your data under /clusterfs/cortex&lt;br /&gt;
(see below).&lt;br /&gt;
&lt;br /&gt;
In order to see your current quota and usage, use the following command:&lt;br /&gt;
&lt;br /&gt;
  quota -s&lt;br /&gt;
&lt;br /&gt;
=== data ===&lt;br /&gt;
&lt;br /&gt;
For large amounts of data, please create a directory&lt;br /&gt;
&lt;br /&gt;
  /clusterfs/cortex/scratch/username&lt;br /&gt;
&lt;br /&gt;
and store the data inside that directory. Note that unlike the home directory, scratch space is not backed up and permanence of your data is not guaranteed. There is a total limit of 4 TB for this drive that is shared by everyone at the Redwood center.&lt;br /&gt;
&lt;br /&gt;
== Connect ==&lt;br /&gt;
&lt;br /&gt;
=== get a password ===&lt;br /&gt;
&lt;br /&gt;
* Press the &amp;quot;PASSWORD&amp;quot; button to power on the CryptoCard. You will see &amp;quot;PIN?&amp;quot; request prompt&lt;br /&gt;
* Enter your PIN, and press the &amp;quot;ENT&amp;quot; key.&lt;br /&gt;
* You should see 7 digits presented like a phone number; this is your one-time password&lt;br /&gt;
&lt;br /&gt;
=== ssh to the gateway computer (hadley) ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; note: please don&#039;t use the gateway for computations (e.g. matlab)! &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
  ssh -Y neuro-calhpc.berkeley.edu (or hadley.berkeley.edu) &lt;br /&gt;
&lt;br /&gt;
and use your crypto password&lt;br /&gt;
&lt;br /&gt;
=== Setup environment ===&lt;br /&gt;
&lt;br /&gt;
* put all your customizations into your .bashrc &lt;br /&gt;
* for login shells, .bash_profile is used, which in turn loads .bashrc&lt;br /&gt;
&lt;br /&gt;
=== Using a Windows machine ===&lt;br /&gt;
Windows is not a Unix-based operating system and as a result does not natively interface with a Unix environment. Download the 2 following pieces of software to create a workaround:&lt;br /&gt;
* Install a Unix environment emulator to interface directly with the cluster. Cygwin [http://www.cygwin.com] seems to work well. During installation make sure to install Net -&amp;gt; &amp;quot;openssh&amp;quot;. Editors -&amp;gt; &amp;quot;vim&amp;quot; is also recommended. Then you can use the instructions detailed in ssh to gateway above&lt;br /&gt;
* Install an SFTP/SCP/FTP client to allow for file sharing between the cluster and your local machine. WinSCP [http://www.winscp.net] is recommended. ExpanDrive can also be used to create a cluster-based network drive on your local machine.&lt;br /&gt;
&lt;br /&gt;
== Useful commands ==&lt;br /&gt;
&lt;br /&gt;
See https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/scheduler/ucb-supercluster-slurm-migration for a detailed FAQ on the SLURM job manager. &lt;br /&gt;
&lt;br /&gt;
=== SLURM usage ===&lt;br /&gt;
&lt;br /&gt;
* Submitting a Job&lt;br /&gt;
&lt;br /&gt;
From the login node, you can submit jobs to the compute nodes using the syntax&lt;br /&gt;
&lt;br /&gt;
  sbatch myscript.sh&lt;br /&gt;
&lt;br /&gt;
where the myscript.sh is an shell script containing the call to the executable to be submitted to the cluster. Typically, for a matlab job, it would look like&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash -l&lt;br /&gt;
  #SBATCH -p cortex&lt;br /&gt;
  #SBATCH --time=03:30:00&lt;br /&gt;
  #SBATCH --mem-per-cpu=2G&lt;br /&gt;
&lt;br /&gt;
  cd /clusterfs/cortex/scratch/working/dir/for/your/code&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;mymatlabfunction( parameters); exit&amp;quot;&lt;br /&gt;
  exit&lt;br /&gt;
&lt;br /&gt;
the --time defines the walltime of the job, which is an upper bound on the estimated runtime. The job will be killed after this time is elapsed. --mem specifies how much memory the job requires, the default is 1GB per job. &lt;br /&gt;
&lt;br /&gt;
* Monitoring Jobs &lt;br /&gt;
&lt;br /&gt;
Additional options can be passed to sbatch to monitor outputs from the running jobs&lt;br /&gt;
&lt;br /&gt;
    sbatch -o outputfile.txt -e errofile.txt -J jobdescriptor myscript.sh&lt;br /&gt;
&lt;br /&gt;
the output of the job will be piped to outputfile.txt and any errors if the job crashes to errofile.txt&lt;br /&gt;
&lt;br /&gt;
* Cluster usage&lt;br /&gt;
&lt;br /&gt;
Use&lt;br /&gt;
  squeue&lt;br /&gt;
to get a list of pending and running jobs on the cluster. It will show user names jobdescriptor passed to sbatch, runtime and nodes.&lt;br /&gt;
&lt;br /&gt;
=== Perceus commands ===&lt;br /&gt;
&lt;br /&gt;
The perceus manual is [http://www.warewulf-cluster.org/portal/book/export/html/7 here]&lt;br /&gt;
&lt;br /&gt;
* listing available cluster nodes:&lt;br /&gt;
&lt;br /&gt;
  wwstats&lt;br /&gt;
&lt;br /&gt;
* list cluster usage&lt;br /&gt;
&lt;br /&gt;
  wwtop&lt;br /&gt;
&lt;br /&gt;
* to restrict the scope of these commands to cortex cluster, add the following line to your .bashrc&lt;br /&gt;
&lt;br /&gt;
  export NODES=&#039;*cortex&#039;&lt;br /&gt;
&lt;br /&gt;
* module list&lt;br /&gt;
* module avail&lt;br /&gt;
* module help&lt;br /&gt;
&lt;br /&gt;
* help pages are [http://lrc.lbl.gov/html/guide.html here]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Finding out the list of occupants on each cluster node ===&lt;br /&gt;
&lt;br /&gt;
* One can find out the list of users using a particular node by ssh into the node, e.g.&lt;br /&gt;
&lt;br /&gt;
  ssh n0000.cortex&lt;br /&gt;
&lt;br /&gt;
* After logging into the node, type&lt;br /&gt;
&lt;br /&gt;
  top&lt;br /&gt;
&lt;br /&gt;
* This is useful if you believe someone is abusing the machine and would like to send him/her a friendly reminder.&lt;br /&gt;
&lt;br /&gt;
= Software =&lt;br /&gt;
&lt;br /&gt;
== Matlab ==&lt;br /&gt;
&lt;br /&gt;
Start an interactive session on the cluster (requires specifying the cluster and walltime as is shown here):&lt;br /&gt;
&lt;br /&gt;
  srun -u -p cortex -t 2:0:0 bash -i&lt;br /&gt;
&lt;br /&gt;
In order to use matlab, you have to load the matlab environment:&lt;br /&gt;
&lt;br /&gt;
  module load matlab&lt;br /&gt;
&lt;br /&gt;
Once the matlab environment is loaded, you can start a matlab session by running&lt;br /&gt;
&lt;br /&gt;
  matlab -nodesktop&lt;br /&gt;
&lt;br /&gt;
An example PBS script for running matlab code is&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  # request 1 nodes with 2 CPUs &lt;br /&gt;
  #PBS -l nodes=1:ppn=2&lt;br /&gt;
  # reserve time on the selected cores&lt;br /&gt;
  #PBS -l walltime=01:00:00&lt;br /&gt;
  module load matlab&lt;br /&gt;
  matlab -nodisplay -nojvm &amp;lt;&amp;lt; EOF&lt;br /&gt;
  test # here you should have whatever you would normally type in the Matlab prompt&lt;br /&gt;
  exit&lt;br /&gt;
  EOF&lt;br /&gt;
&lt;br /&gt;
If you would like to see who is using matlab licenses, enter&lt;br /&gt;
&lt;br /&gt;
  lmstat&lt;br /&gt;
&lt;br /&gt;
== Python ==&lt;br /&gt;
&lt;br /&gt;
We have several Python Distributions installed: The Enthought Python Distribution (EPD), the Source Python Distribution (SPD) and Sage. The easiest way to get started is probably to use EPD (see below).&lt;br /&gt;
&lt;br /&gt;
=== Enthought Python Distribution (EPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Enthought Python Distribution 7.2.0 installed [[http://www.enthought.com/products/epd.php EPD]]. In order to use it, you have to follow the following steps:&lt;br /&gt;
&lt;br /&gt;
* login to the gateway server using &amp;quot;ssh -Y&amp;quot; (see above)&lt;br /&gt;
* start an interactive session using &amp;quot;srun -u -p cortex -t 2:0:0 bash -i&amp;quot; (see above)&lt;br /&gt;
* load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/epd&lt;br /&gt;
&lt;br /&gt;
* start ipython:&lt;br /&gt;
&lt;br /&gt;
  ipython -pylab&lt;br /&gt;
&lt;br /&gt;
* run the following commands inside ipython to test the setup:&lt;br /&gt;
&lt;br /&gt;
  from enthought.mayavi import mlab&lt;br /&gt;
  mlab.test_contour3d()&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== Source Python Distribution (SPD) ===&lt;br /&gt;
&lt;br /&gt;
We have the Source Python Distribution installed [[http://code.google.com/p/spdproject/ SPD]]. In order to use it, you have to first load the python environment module:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
&lt;br /&gt;
Afterwards, you can run ipython&lt;br /&gt;
&lt;br /&gt;
  % ipython -pylab&lt;br /&gt;
&lt;br /&gt;
At the moment, we have numpy, scipy, and matplotlib installed. If you would like to have additional modules installed, let me know [[mailto:kilian@berkeley.edu kilian]]&lt;br /&gt;
&lt;br /&gt;
=== Sage ===&lt;br /&gt;
&lt;br /&gt;
Sage is [http://sagemath.org http://sagemath.org]. In order to use sage, you have to first load the sage environment module&lt;br /&gt;
&lt;br /&gt;
  module load python/sage&lt;br /&gt;
&lt;br /&gt;
After loading the sage module, if you want to have a scipy environment (run ipython, etc) in your interactive session, first do:&lt;br /&gt;
&lt;br /&gt;
  % sage -sh&lt;br /&gt;
&lt;br /&gt;
then you can run:&lt;br /&gt;
&lt;br /&gt;
  % ipython&lt;br /&gt;
&lt;br /&gt;
or you can just do:&lt;br /&gt;
&lt;br /&gt;
  % sage -ipython&lt;br /&gt;
&lt;br /&gt;
This is a temporary solution for people wanting use scipy with mpi on the cluster. It was built against the default openmpi (1.2.8) (icc) and mpi4py 1.1.0. For those using hdf5, I also built hdf5 1.8.3 (gcc)  and h5py 1.2.&lt;br /&gt;
&lt;br /&gt;
Sample pbs and mpi script is here:&lt;br /&gt;
&lt;br /&gt;
  ~amirk/test&lt;br /&gt;
&lt;br /&gt;
You can run it as:&lt;br /&gt;
&lt;br /&gt;
  % mkdir -p ~/jobs&lt;br /&gt;
  % cd ~amirk/test&lt;br /&gt;
  % qsub pbs&lt;br /&gt;
&lt;br /&gt;
--Amir&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== CUDA ==&lt;br /&gt;
&lt;br /&gt;
CUDA is a library to use the graphics processing units (GPU) on the graphics card for general-purpose computing. We have a separate wiki page to collect information on how to do general-purpose computing on the GPU: [[GPGPU]].&lt;br /&gt;
We have installed the CUDA 3.0 driver and toolkit.&lt;br /&gt;
&lt;br /&gt;
In order to use CUDA, you have to load the CUDA environment:&lt;br /&gt;
&lt;br /&gt;
  module load cuda&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock in python ===&lt;br /&gt;
&lt;br /&gt;
If you would like to use one of the GPU cards on node n0000 or n0001, please optain a GPU lock to make sure the card is not in use and that no one else will be using the card. &lt;br /&gt;
&lt;br /&gt;
If you are using Python, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  import gpu_lock&lt;br /&gt;
  gpu_lock.obtain_lock_id()&lt;br /&gt;
&lt;br /&gt;
The function either returns the number of the card you can use (0 or 1) or -1 if both cards are in use.&lt;br /&gt;
&lt;br /&gt;
=== Obtain GPU lock for Jacket in Matlab ===&lt;br /&gt;
&lt;br /&gt;
If you are using Matlab, you can obtain a GPU lock by running&lt;br /&gt;
&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/gpu_lock&#039;);&lt;br /&gt;
  addpath(&#039;/clusterfs/cortex/software/jacket/engine&#039;);&lt;br /&gt;
  gpu_id = obtain_gpu_lock_id();&lt;br /&gt;
  gselect(gpu_id);&lt;br /&gt;
&lt;br /&gt;
By default, obtain_gpu_lock() throws an error when all gpu cards are taken.&lt;br /&gt;
There is another option: obtain_gpu_lock_id(true) will return -1 in case there&lt;br /&gt;
is no card available and you can then write your own code to deal with that&lt;br /&gt;
fact.&lt;br /&gt;
&lt;br /&gt;
ginfo tells you which gpu card you are using.&lt;br /&gt;
&lt;br /&gt;
The following lines should also be in your .bashrc&lt;br /&gt;
&lt;br /&gt;
  ## jacket stuff!&lt;br /&gt;
  module load cuda&lt;br /&gt;
  export LD_LIBRARY_PATH=/clusterfs/cortex/software/jacket/engine/lib64:$LD_LIBRARY_PATH&lt;br /&gt;
&lt;br /&gt;
=== CUDA SDK (Outdated since version change to 3.0) ===&lt;br /&gt;
&lt;br /&gt;
You can install the CUDA SDK by running&lt;br /&gt;
&lt;br /&gt;
  bash /clusterfs/cortex/software/cuda-2.3/src/cudasdk_2.3_linux.run&lt;br /&gt;
&lt;br /&gt;
You can compile all the code examples by running&lt;br /&gt;
&lt;br /&gt;
  module load X11&lt;br /&gt;
  module load Mesa/7.4.4&lt;br /&gt;
  cd ~/NVIDIA_GPU_Computing_SDK/C&lt;br /&gt;
  make&lt;br /&gt;
&lt;br /&gt;
The compiled examples can be found in the directory&lt;br /&gt;
&lt;br /&gt;
  ~/NVIDIA_GPU_Computing_SDK/C/bin/linux/release&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;note:&#039;&#039;&#039; The examples using graphics with OpenGL don&#039;t seem to run on a remote X server. In order to make them work, we probably need to install something like [http://www.virtualgl.org/ virtualgl].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
=== PyCuda ===&lt;br /&gt;
&lt;br /&gt;
PyCuda 0.93 is installed as part of the Source Python Distribution (SPD). This is how you run all unit tests:&lt;br /&gt;
&lt;br /&gt;
  module load python/spd&lt;br /&gt;
  cd /clusterfs/cortex/software/src/pycuda-0.93/test/&lt;br /&gt;
  nosetests&lt;br /&gt;
&lt;br /&gt;
If you are having trouble installing PyCuda, please note the following:&lt;br /&gt;
&lt;br /&gt;
* gcc 4.1.2 related issues with boost [http://tinyurl.com/28zrjnv]&lt;br /&gt;
* also, gcc 4.1.2 related [http://tinyurl.com/25obx6g]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Usage Tips =&lt;br /&gt;
Here are some tips on how to effectively use the cluster.&lt;br /&gt;
&lt;br /&gt;
== Embarrassingly Parallel Submissions ==&lt;br /&gt;
&lt;br /&gt;
Here is an alternate script to do embarrassingly parallel submissions on the cluster.&lt;br /&gt;
 &lt;br /&gt;
iterate.sh&lt;br /&gt;
  #!/bin/sh&lt;br /&gt;
  #Leap Size&lt;br /&gt;
  param1=11&lt;br /&gt;
  param2=1.2&lt;br /&gt;
  param3=.75&lt;br /&gt;
  #LeapSize&lt;br /&gt;
  for i in 14 15 16&lt;br /&gt;
  do&lt;br /&gt;
  #Epsilon&lt;br /&gt;
   for j in $(seq .8 .1 $param2);&lt;br /&gt;
       do&lt;br /&gt;
       #Beta&lt;br /&gt;
       for k in $(seq .65 .01 $param3);&lt;br /&gt;
             do&lt;br /&gt;
                 echo $i,$j,$k&lt;br /&gt;
                 qsub param_test.sh  -v &amp;quot;LeapSize=$i,Epsilon=$j,Beta=$k&amp;quot;&lt;br /&gt;
             done&lt;br /&gt;
       done&lt;br /&gt;
   done&lt;br /&gt;
&lt;br /&gt;
param_test.sh&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  #PBS -l nodes=1:ppn=2:gpu&lt;br /&gt;
  #PBS -l walltime=10:35:00&lt;br /&gt;
  #PBS -o /global/home/users/mayur/Logs&lt;br /&gt;
  #PBS -e /global/home/users/mayur/Errors&lt;br /&gt;
  cd /global/home/users/mayur/HMC_reducedflip/&lt;br /&gt;
  module load matlab&lt;br /&gt;
  echo &amp;quot;Epsilon = &amp;quot;,$Epsilon&lt;br /&gt;
  echo &amp;quot;Leap Size = &amp;quot;,$LeapSize&lt;br /&gt;
  echo &amp;quot;Beta = &amp;quot;,$Beta&lt;br /&gt;
  matlab -nodisplay -nojvm -r &amp;quot;make_figures_fneval_cluster $LeapSize $Epsilon $Beta&amp;quot;&lt;br /&gt;
&lt;br /&gt;
   Now run ./iterate.sh&lt;br /&gt;
&lt;br /&gt;
== Mounting Cluster File System ==&lt;br /&gt;
Mounting the cluster file system remotely allows you to easily access files on the cluster, and allows you to use local programs to edit code or examine simulation outputs locally (very useful). I often edit the remote code using a text editor running on my local machine. This allows you to take advantage of the niceties of a native editor without having to copy code back and forth before you run a simulation on the cluster.&lt;br /&gt;
&lt;br /&gt;
On linux distributions you can mount your cluster home directory locally using sshfs [http://fuse.sourceforge.net/sshfs.html]&lt;br /&gt;
&lt;br /&gt;
  sshfs hadley.berkeley.edu: &amp;lt;mount-dir&amp;gt;&lt;br /&gt;
&lt;br /&gt;
On Mac and Windows machines the program ExpanDrive works well (uses Fuse under the hood): [http://www.expandrive.com]&lt;br /&gt;
&lt;br /&gt;
= Support Requests =&lt;br /&gt;
&lt;br /&gt;
* If you have a problem that is not covered on this page, you can send an email to our user list:&lt;br /&gt;
&lt;br /&gt;
  [mailto:redwood_cluster@lists.berkeley.edu redwood_cluster@lists.berkeley.edu]&lt;br /&gt;
&lt;br /&gt;
* If you need additional help from the LBL group, send an email to their email list. Please always cc our email list as well. Or visit their website[https://sites.google.com/a/lbl.gov/high-performance-computing-services-group/].&lt;br /&gt;
&lt;br /&gt;
  [mailto:hpcshelp@lbl.gov hpcshelp@lbl.gov]&lt;br /&gt;
&lt;br /&gt;
* In urgent cases, you can also email [mailto:kmuriki@lbl.gov Krishna Muriki] (LBL User Services) directly.&lt;/div&gt;</summary>
		<author><name>Zayd</name></author>
	</entry>
</feed>