<?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=Jascha</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=Jascha"/>
	<link rel="alternate" type="text/html" href="https://rctn.org/wiki/Special:Contributions/Jascha"/>
	<updated>2026-06-13T18:51:00Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.4</generator>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=7780</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=7780"/>
		<updated>2014-09-22T01:14:36Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;My new website is at [http://sohldickstein.com/ http://sohldickstein.com/]. Go there instead.&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
The information below is out of date.  I am now a postdoc in Surya Ganguli&#039;s lab at Stanford, and working with the Khan Academy.  A more complete update to follow soon.  -Jascha (Aug 5, 2012)&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_reducedflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=7751</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=7751"/>
		<updated>2014-09-16T02:03:13Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;My new website is at [http://sohldickstein.com/ http://sohldickstein.com/].&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
The information below is out of date.  I am now a postdoc in Surya Ganguli&#039;s lab at Stanford, and working with the Khan Academy.  A more complete update to follow soon.  -Jascha (Aug 5, 2012)&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_reducedflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=7569</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=7569"/>
		<updated>2014-07-25T00:18:51Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The information below is out of date.  I am now a postdoc in Surya Ganguli&#039;s lab at Stanford, and working with the Khan Academy.  A more complete update to follow soon.  -Jascha (Aug 5, 2012)&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_reducedflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6283</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6283"/>
		<updated>2012-08-05T19:37:11Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] &lt;br /&gt;
&lt;br /&gt;
The information below is out of date.  I am now a postdoc in Surya Ganguli&#039;s lab at Stanford, and working with the Khan Academy.  A more complete update to follow soon.  -Jascha (Aug 5, 2012)&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_reducedflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6282</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6282"/>
		<updated>2012-08-05T19:36:34Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] &lt;br /&gt;
&lt;br /&gt;
The information below is out of date.  I am now a postdoc in Surya Ganguli&#039;s lab at Stanford, and working with the Khan Academy.  (Aug 5, 2012)&lt;br /&gt;
&lt;br /&gt;
--&lt;br /&gt;
&lt;br /&gt;
I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_reducedflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6276</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6276"/>
		<updated>2012-07-16T18:36:59Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&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;
&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;
&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6275</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6275"/>
		<updated>2012-07-16T18:36:00Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&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;
&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&lt;br /&gt;
well as a means to better understand the computations performed by the visual system in the brain. A&lt;br /&gt;
lot of theoretical considerations and biological observations point to the fact that &lt;br /&gt;
natural image models should be hierarchically organized, yet to date, the best known models are still based on what is&lt;br /&gt;
better described as shallow representations. In this talk, I will present two image models. One is&lt;br /&gt;
based on the idea of Gaussianization for greedily constructing hierarchical generative models. I&lt;br /&gt;
will show that when combined with independent subspace analysis, it is able to&lt;br /&gt;
compete with the state of the art for modeling image patches. The other model combines mixtures of&lt;br /&gt;
Gaussian scale mixtures with a directed graphical model and multiscale image representations&lt;br /&gt;
and is able to generate highly structured images of arbitrary size. Evaluating the model&#039;s&lt;br /&gt;
likelihood and comparing it to a large number of other image models shows that it might well&lt;br /&gt;
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;
&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6272</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6272"/>
		<updated>2012-07-11T06:59:54Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;20 June 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&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;
&lt;br /&gt;
&#039;&#039;&#039;30 July 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: Lucas Theis&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;
&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6246</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6246"/>
		<updated>2012-05-21T17:32:09Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&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;
&lt;br /&gt;
&#039;&#039;&#039;30 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6245</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6245"/>
		<updated>2012-05-21T17:29:58Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;16 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&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;
&lt;br /&gt;
&#039;&#039;&#039;30 May 2012&#039;&#039;&#039; &lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title:&lt;br /&gt;
* Abstract:&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6227</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6227"/>
		<updated>2012-04-06T22:14:39Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&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&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBD - something about light field microscopy and calcium imaging&lt;br /&gt;
* Abstract:&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Cluster&amp;diff=6220</id>
		<title>Cluster</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Cluster&amp;diff=6220"/>
		<updated>2012-04-02T01:35:36Z</updated>

		<summary type="html">&lt;p&gt;Jascha: /* Matlab */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= General Information =&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.&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;
== Useful commands ==&lt;br /&gt;
&lt;br /&gt;
=== Start interactive session on compute node ===&lt;br /&gt;
&lt;br /&gt;
* start interactive session: &lt;br /&gt;
&lt;br /&gt;
  qsub -X -I&lt;br /&gt;
&lt;br /&gt;
* start interactive session on particular node (nodes n0000.cortex and n0001.cortex have GPUs): &lt;br /&gt;
&lt;br /&gt;
  qsub -X -I -l nodes=n0001.cortex&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;
=== Resource Manager PBS ===&lt;br /&gt;
&lt;br /&gt;
* Job Scheduler MOAB&lt;br /&gt;
* List running jobs:&lt;br /&gt;
&lt;br /&gt;
  qstat -a&lt;br /&gt;
&lt;br /&gt;
* List jobs of a given node:&lt;br /&gt;
&lt;br /&gt;
  qstat -n 98&lt;br /&gt;
&lt;br /&gt;
* sample script&lt;br /&gt;
&lt;br /&gt;
  #!/bin/bash&lt;br /&gt;
  &lt;br /&gt;
  #PBS -q cortex&lt;br /&gt;
  #PBS -l nodes=1:ppn=2:cortex&lt;br /&gt;
  #PBS -l walltime=01:00:00&lt;br /&gt;
  #PBS -o path-to-output&lt;br /&gt;
  #PBS -e path-to-error&lt;br /&gt;
  cd /global/home/users/kilian/sample_executables&lt;br /&gt;
  cat $PBS_NODEFILE&lt;br /&gt;
  mpirun -np 8 /bin/hostname&lt;br /&gt;
  sleep 60&lt;br /&gt;
&lt;br /&gt;
* submit script&lt;br /&gt;
&lt;br /&gt;
  qsub scriptname&lt;br /&gt;
&lt;br /&gt;
* interactive session&lt;br /&gt;
&lt;br /&gt;
  qsub -I -q cortex -l nodes=1:ppn=2:cortex -l walltime=00:15:00&lt;br /&gt;
&lt;br /&gt;
* flush STDOUT and STDERR to files in your home directory so you can tail the output of the job while it&#039;s running&lt;br /&gt;
&lt;br /&gt;
  qsub -k oe scriptname&lt;br /&gt;
&lt;br /&gt;
* remove a queued/running job (you can get the job_id from qstat)&lt;br /&gt;
&lt;br /&gt;
  qdel job_id&lt;br /&gt;
&lt;br /&gt;
* list nodes that your job is running on&lt;br /&gt;
&lt;br /&gt;
  cat $PBS_NODEFILE&lt;br /&gt;
&lt;br /&gt;
* run the program on several cores&lt;br /&gt;
&lt;br /&gt;
  mpirun -np 4 -mca btl ^openib sample_executables/mpi_hello&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;
&#039;&#039;&#039;note: remember to start an interactive session before starting matlab!&#039;&#039;&#039;&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 6.3.1 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;qsub -I -X&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;
== 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.&lt;br /&gt;
&lt;br /&gt;
  [mailto:scs@lbl.gov scs@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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6211</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6211"/>
		<updated>2012-03-14T00:24:46Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&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;11 April 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Logan Grosenick&lt;br /&gt;
* Affiliation: Stanford&lt;br /&gt;
* Host: Jascha&lt;br /&gt;
* Status: confirmed&lt;br /&gt;
* Title: TBD - something about light field microscopy and calcium imaging&lt;br /&gt;
* Abstract:&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 D.&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;
=== 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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6131</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6131"/>
		<updated>2012-01-09T12:32:37Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_reducedflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Seminars&amp;diff=6126</id>
		<title>Seminars</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Seminars&amp;diff=6126"/>
		<updated>2011-12-16T03:04:36Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &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;
# Fill in the speaker information in the &#039;tentative/confirmed speaker&#039; section. Leave the status flag in &#039;tentative&#039;. Please include your name and email 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 flag 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;
# Kati or I will also send out an announcement.  &lt;br /&gt;
# If the speaker needs accommodations you should contact Kati [mailto:ksmarkow@berkeley.edu] to reserve a room at the faculty club.&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).&lt;br /&gt;
# After the seminar have the speaker submit travel expenses to Jadine Palapaz [mailto:jpalapaz@berkeley.edu] at RES for reimbursement.  You can get a travel reimbursement form [http://res.berkeley.edu/res/forms.cfm online] and give to the speaker so they can submit everything before they leave if they have all their receipts on hand, otherwise they can mail it in afterwards.&lt;br /&gt;
&lt;br /&gt;
== Tentative / Confirmed Speakers ==&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;4 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: &lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title: &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;18 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;25 Jan 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;1 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;8 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker:&lt;br /&gt;
* Affiliation:&lt;br /&gt;
* Host:&lt;br /&gt;
* Status:&lt;br /&gt;
* Title: &lt;br /&gt;
* Abstract:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;15 Feb 2012&#039;&#039;&#039;&lt;br /&gt;
* Speaker: Carl Pabo&lt;br /&gt;
* Affiliation:&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 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;
&lt;br /&gt;
== Previous Seminars ==&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;
=== 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>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6115</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6115"/>
		<updated>2011-12-06T05:42:55Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at the University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6114</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6114"/>
		<updated>2011-11-29T02:08:30Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6113</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6113"/>
		<updated>2011-11-29T02:06:26Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the [http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf ICCV paper].&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6112</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6112"/>
		<updated>2011-11-29T02:04:22Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper], the [http://prl.aps.org/abstract/PRL/v107/i22/e220601 PRL paper], and the [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6111</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6111"/>
		<updated>2011-11-29T02:02:37Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6110</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6110"/>
		<updated>2011-11-21T23:18:29Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011) http://redwood.berkeley.edu/jascha/pdfs/culpepper-iccv13.pdf&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6109</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6109"/>
		<updated>2011-11-21T23:12:45Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
International Conference on Computer Vision (2011)&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6108</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6108"/>
		<updated>2011-11-21T23:08:00Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Physical Review Letters (2011). http://prl.aps.org/abstract/PRL/v107/i22/e220601&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6107</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6107"/>
		<updated>2011-11-21T08:52:56Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6106</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6106"/>
		<updated>2011-11-21T08:52:15Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6105</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6105"/>
		<updated>2011-11-21T08:50:17Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Under submission, draft available as technical report. http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Under submission, draft available as technical report. https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6104</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6104"/>
		<updated>2011-11-20T05:21:26Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/DCC_2011_LieGroup.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling/blob/master/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6100</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6100"/>
		<updated>2011-11-15T18:42:05Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6095</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6095"/>
		<updated>2011-11-11T01:17:19Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interest is in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6094</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6094"/>
		<updated>2011-11-10T07:01:52Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interests are in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in our sensory input by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6093</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6093"/>
		<updated>2011-11-10T00:32:58Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
My underlying interests are in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6092</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6092"/>
		<updated>2011-11-10T00:31:06Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].  Most of my projects involve developing techniques to work with highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.  My underlying interests involve unsupervised learning - how people or computers can build a model of the world just by observing examples of it.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
[[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) &lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6090</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6090"/>
		<updated>2011-11-09T01:55:16Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=File:Jascha_picture.jpg&amp;diff=6089</id>
		<title>File:Jascha picture.jpg</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=File:Jascha_picture.jpg&amp;diff=6089"/>
		<updated>2011-11-09T01:54:35Z</updated>

		<summary type="html">&lt;p&gt;Jascha: uploaded a new version of &amp;amp;quot;File:Jascha picture.jpg&amp;amp;quot;: Reverted to version as of 04:14, 8 May 2011&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6088</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6088"/>
		<updated>2011-11-09T01:54:07Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] [[Image:jascha_picture.jpg|150px|thumb|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6087</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6087"/>
		<updated>2011-11-09T01:53:17Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals] - Reduces the number of momentum reversals required in Hamiltonian Monte Carlo. This is accomplished by maintaining the net exchange of probability between states with opposite momenta, but reducing the rate of exchange in both directions such that it is 0 in one direction. &lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow] - Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6086</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6086"/>
		<updated>2011-11-09T01:52:00Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf note] below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary Gaussian distributed variables with the Hessian as their coupling matrix.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/HMC_noflip.pdf Hamiltonian Monte Carlo with Fewer Momentum Reversals]&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6085</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6085"/>
		<updated>2011-11-09T01:48:45Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Extensions to Hamiltonian Monte Carlo -&#039;&#039;&#039;  See the note below on modifying the rejection rules to less frequently negate the momentum, increasing mixing speed.  Additionally, ongoing work maintains an online low rank approximation to the inverse Hessian by the introduction of auxiliary variables with a carefully chosen distribution.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6084</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6084"/>
		<updated>2011-11-09T01:37:11Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=File:Jascha_picture.jpg&amp;diff=6083</id>
		<title>File:Jascha picture.jpg</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=File:Jascha_picture.jpg&amp;diff=6083"/>
		<updated>2011-11-09T01:36:33Z</updated>

		<summary type="html">&lt;p&gt;Jascha: uploaded a new version of &amp;amp;quot;File:Jascha picture.jpg&amp;amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6082</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6082"/>
		<updated>2011-11-09T01:36:03Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]][[Image:jascha_picture.jpg|150px|thumb|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=File:Jascha_picture.jpg&amp;diff=6081</id>
		<title>File:Jascha picture.jpg</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=File:Jascha_picture.jpg&amp;diff=6081"/>
		<updated>2011-11-09T01:28:13Z</updated>

		<summary type="html">&lt;p&gt;Jascha: uploaded a new version of &amp;amp;quot;File:Jascha picture.jpg&amp;amp;quot;: Reverted to version as of 01:53, 3 October 2011&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=File:Nicol_bat.jpg&amp;diff=6080</id>
		<title>File:Nicol bat.jpg</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=File:Nicol_bat.jpg&amp;diff=6080"/>
		<updated>2011-11-09T01:25:05Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6079</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6079"/>
		<updated>2011-11-09T01:24:28Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:nicol_bat.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6078</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6078"/>
		<updated>2011-11-09T01:20:33Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture2.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:jascha_picture.jpg|50px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6077</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6077"/>
		<updated>2011-11-09T01:20:15Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture2.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:jascha_picture.jpg|200px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6076</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6076"/>
		<updated>2011-11-09T01:19:15Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture2.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:jascha_picture.jpg|100px|thumb|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6075</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6075"/>
		<updated>2011-11-09T01:18:15Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture2.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:jascha_picture.jpg|100px|text-top|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6074</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6074"/>
		<updated>2011-11-09T01:17:59Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture2.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:jascha_picture.jpg|150px|text-top|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
	<entry>
		<id>https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6073</id>
		<title>Jascha Sohl-Dickstein</title>
		<link rel="alternate" type="text/html" href="https://rctn.org/w/index.php?title=Jascha_Sohl-Dickstein&amp;diff=6073"/>
		<updated>2011-11-09T01:17:04Z</updated>

		<summary type="html">&lt;p&gt;Jascha: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:jascha_picture2.jpg|150px|text-top|right]] I am a graduate student in the [http://redwood.berkeley.edu Redwood Center for Theoretical Neuroscience], at University of California, Berkeley.  I am a member of [https://redwood.berkeley.edu/bruno/ Bruno Olshausen&#039;s] lab, and the [http://biophysics.berkeley.edu/ Biophysics Graduate Group].  My email address is [mailto:jascha@berkeley.edu jascha@berkeley.edu].&lt;br /&gt;
&lt;br /&gt;
I am interested in how we learn to perceive the world.  There is evidence that much of our representation of the world is learned during development rather than being genetically hardwired - everything from the way light intensity is correlated on adjacent patches of the retina all the way up to rules for social interaction.  How this unsupervised learning problem is solved - how we learn the structure inherent in the world by experiencing examples of it - is not well understood.  This is the problem I am interested in tackling.&lt;br /&gt;
&lt;br /&gt;
Practically - I mostly develop techniques to estimate parameters for highly flexible but intractable probabilistic models, using ideas from statistical mechanics and dynamical systems.&lt;br /&gt;
&lt;br /&gt;
== Code ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning MPF] -&#039;&#039;&#039; This repository contains Matlab code implementing Minimum Probability Flow learning (MPF) for several cases, specifically:&lt;br /&gt;
** &#039;&#039;&#039;MPF_ising/ -&#039;&#039;&#039; parameter estimation in the Ising model&lt;br /&gt;
** &#039;&#039;&#039;MPF_RBM_compare_log_likelihood/ -&#039;&#039;&#039; parameter estimation in Restricted Boltzmann Machines.  This directory also includes code comparing the log likelihood of small RBMs trained via pseudolikelihood and Contrastive Divergence to ones trained via MPF.&lt;br /&gt;
* &#039;&#039;&#039;[https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling HAIS] -&#039;&#039;&#039; This repository contains Matlab code to perform partition function estimation, log likelihood estimation, and importance weight estimation in models with intractable partition functions and continuous state spaces, using Hamiltonian Annealed Importance Sampling (HAIS).  It can also be used for standard Hamiltonian Monte Carlo sampling (single step, with partial momentum refreshment).&lt;br /&gt;
&lt;br /&gt;
== Projects ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Minimum Probability Flow (MPF) -&#039;&#039;&#039; A collaboration with Peter Battaglino and Michael R. DeWeese.  MPF is a technique for parameter estimation in un-normalized probabilistic models.  It proves to be an order of magnitude faster than competing techniques for the Ising model, and an effective tool for learning parameters for any non-normalizable distribution. See the [http://redwood.berkeley.edu/jascha/pdfs/icml.pdf ICML paper] and [https://github.com/Sohl-Dickstein/Minimum-Probability-Flow-Learning released code].  If you are interested in using MPF in a continuous state space, you should use the method described in the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hamiltonian Annealed Importance Sampling (HAIS) -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper].  Allows the estimation of importance weights - and thus partition functions and log likelihoods - for intractable probabilistic models.  See the [http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf tech report], and the [https://github.com/Sohl-Dickstein/Hamiltonian-Annealed-Importance-Sampling released code].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Lie group models for transformations in natural video -&#039;&#039;&#039; A collaboration with Jimmy Wang and Bruno Olshausen.  We train first order differential operators on inter-frame differences in natural video, in order to learn a set of natural transformations.  We further explore the use of these transformations in video compression.  See [http://arxiv.org/abs/1001.1027 the tech report], and the [http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf DCC paper].&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A comparison of the log likelihoods of popular image models. -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and [https://redwood.berkeley.edu/cadieu/homepage/Home.html Charles Cadieu].  We use Hamiltonian Annealed Importance Sampling (HAIS - above) to compare the log likelihoods of popular image models trained via several parameter estimation techniques.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Bilinear generative models for natural images -&#039;&#039;&#039; A collaboration with [http://www.cs.berkeley.edu/~bjc/ Jack Culpepper] and Bruno Olshausen.  See the soon to appear ICCV paper.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;A device for human echolocation -&#039;&#039;&#039; A collaboration with Nicol Harper and Chris Rodgers.  (see stylish picture to right) [[Image:jascha_picture.jpg|50px|text-top|right]]&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Statistical analysis of medical images of cancer patients -&#039;&#039;&#039; A collaboration with Joel Zylberberg and Michael DeWeese.  (See also an earlier project training statistical models on MRI and CT breast images - [http://link.aip.org/link/?PSISDG/7263/726317/1 SPIE publication].)&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware online optimization -&#039;&#039;&#039;  By rewriting the inverse Hessian in terms of its Taylor expansion, and then accumulating terms in this expansion in an online fashion, neat things can be done...&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Hessian-aware Hamiltonian Monte Carlo&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf Persistent Minimum Probability Flow]  Develops MPF in the case that non-data states are captured by persistent samples from the current estimate of the model distribution.  Analogous to Persistent CD.  This technique should be used for MPF in continuous state spaces.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/MPF_sampling.pdf Sampling the Connectivity Pattern in Minimum Probability Flow Learning] - Describes how the connectivity pattern between states in MPF can be described using a proposal distribution, rather than a deterministic rule.&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/generic_entropy_091121.pdf Entropy of Generic Distributions] - Calculates the entropy that can be expected for a distribution drawn at random from the simplex of all possible distributions ([http://dittler.us/ John Schulman] points out that ET Jaynes deals with similar questions in chapter 11 of &amp;quot;Probability Theory: The Logic Of Science&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
* [http://redwood.berkeley.edu/jascha/pdfs/independence_of_energy_function_contributions.pdf On the independence of linear contributions to an energy function] - Even in the overcomplete case where there are more experts than data dimensions, product-of-experts style models tend to learn decorrelated features.  This note provides motivation for this by Taylor expanding the KL divergence, and observing that there are terms in the expansion which specifically penalize similarity between the experts.&lt;br /&gt;
&lt;br /&gt;
The following are titles for informal notes I intend to write, but haven&#039;t gotten to/finished yet.  If any of the following sound interesting to you, pester me and they will appear more quickly.&lt;br /&gt;
&lt;br /&gt;
* Natural gradients explained via an analogy to signal whitening&lt;br /&gt;
* A log bound on the growth of intelligence with system size&lt;br /&gt;
* The [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1467533 field of experts model] learns Gabor-like receptive fields when trained via minimum probability flow or score matching&lt;br /&gt;
* For small time bins, [http://www.jneurosci.org/cgi/content/abstract/25/47/11003 generalized linear models] and causal Boltzmann machines become equivalent&lt;br /&gt;
* How to construct phase space volume preserving recurrent networks&lt;br /&gt;
* Maximum likelihood learning as constraint satisfaction&lt;br /&gt;
* A spatial derivation of score matching&lt;br /&gt;
&lt;br /&gt;
== Publications ==&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. New method for parameter estimation in probabilistic models: Minimum probability flow. Accepted, Physical Review Letters (2011).&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, P Battaglino, M DeWeese. Minimum probability flow learning. &amp;quot;Distinguished Paper&amp;quot; ICML (2011) http://redwood.berkeley.edu/jascha/pdfs/icml.pdf with supplementary material http://redwood.berkeley.edu/jascha/pdfs/supplementary_material_icml.pdf (also see the Persistent MPF [http://redwood.berkeley.edu/jascha/pdfs/PMPF.pdf note] for more on learning in continuous state spaces)&lt;br /&gt;
&lt;br /&gt;
A Hayes, J Grotzinger, L Edgar, SW Squyres, W Watters, J Sohl-Dickstein. 	Reconstruction of Eolian Bed Forms and Paleocurrents from Cross-Bedded Strata at Victoria Crater, Meridiani Planum, Mars, Journal of Geophysical Research (2011) http://www.agu.org/pubs/crossref/2011/2010JE003688.shtml&lt;br /&gt;
&lt;br /&gt;
CM Wang, J Sohl-Dickstein, I Tosik. Lie Group Transformation Models for Predictive Video Coding. Proceedings of the Data Compression Conference (2011) http://redwood.berkeley.edu/jascha/pdfs/PID1615931.pdf&lt;br /&gt;
&lt;br /&gt;
BJ Culpepper, J Sohl-Dickstein, B Olshausen.  Building a better probabilistic model of images by factorization.  &lt;br /&gt;
Accepted, ICCV. (2011)&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, BJ Culpepper. Hamiltonian annealed importance sampling for partition function estimation.  Redwood Technical Report. (2011) http://redwood.berkeley.edu/jascha/pdfs/HAIS.pdf&lt;br /&gt;
&lt;br /&gt;
J Sohl-Dickstein, CM Wang, BA Olshausen. An Unsupervised Algorithm For Learning Lie Group Transformations. Redwood Technical Report (2009) http://arxiv.org/abs/1001.1027&lt;br /&gt;
&lt;br /&gt;
C Abbey, J Sohl-Dickstein, BA Olshausen. Higher-order scene statistics of breast images. Proceedings of SPIE (2009) http://link.aip.org/link/?PSISDG/7263/726317/1&lt;br /&gt;
&lt;br /&gt;
K Kinch,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
J Bell III,&lt;br /&gt;
JR Johnson,&lt;br /&gt;
W Goetz,&lt;br /&gt;
GA Landis.&lt;br /&gt;
Dust deposition on the Mars Exploration Rover Panoramic Camera (Pancam) calibration targets. Journal of Geophysical Research-Planets (2007) http://www.agu.org/pubs/crossref/2007/2006JE002807.shtml&lt;br /&gt;
&lt;br /&gt;
POSTER - J Sohl-Dickstein, BA Olshausen. Learning in energy based models via score matching. Cosyne (2007) - this (dense!) poster introduces a spatial derivation of score matching, applies it to learning in a Field of Experts model, and then extends Field of Experts to work with heterogeneous experts (to form a &amp;quot;tapestry of experts&amp;quot;).  I&#039;m including it as it hasn&#039;t been written up elsewhere. [http://redwood.berkeley.edu/jascha/pdfs/jascha_cosyne_07.pdf download poster]&lt;br /&gt;
&amp;lt;!-- POSTER - J Wang, J Sohl-Dickstein, BA Olshausen. Unsupervised learning of Lie group operators from natural movies.  Bay Area Vision Research Day (2009). [http://redwood.berkeley.edu/jascha/pdfs/jimmy_jascha_bavrd_09.pdf download poster] --&amp;gt;&lt;br /&gt;
&amp;lt;!-- POSTER - J Sohl-Dickstein, J Wang, B Olshausen. A Global Energy Function for Deep Belief Networks. Cosyne (2008) - some extensions to DBNs - fixes a problem which probably didn&#039;t need to be fixed.  The most interesting part may be noting the full joint distribution for a Deep Belief Network in the left column. [[Media:jascha_cosyne_08_poster.pdf|download poster]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
JR Johnson,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
WM Grundy,&lt;br /&gt;
RE Arvidson,&lt;br /&gt;
J Bell III,&lt;br /&gt;
P Christensen,&lt;br /&gt;
T Graff,&lt;br /&gt;
EA Guinness,&lt;br /&gt;
K Kinch,&lt;br /&gt;
R Morris,&lt;br /&gt;
MK Shepard.&lt;br /&gt;
Radiative transfer modeling of dust-coated Pancam calibration target materials: Laboratory visible/near-infrared spectrogoniometry. Journal of Geophysical Research (2006) http://www.agu.org/pubs/crossref/2006/2005JE002658.shtml&lt;br /&gt;
&lt;br /&gt;
J Bell III,&lt;br /&gt;
J Joseph,&lt;br /&gt;
J Sohl-Dickstein,&lt;br /&gt;
H Arneson,&lt;br /&gt;
M Johnson,&lt;br /&gt;
M Lemmon,&lt;br /&gt;
D Savransky&lt;br /&gt;
In-flight calibration and performance of the Mars Exploration Rover Panoramic Camera (Pancam) instruments.&lt;br /&gt;
Journal of Geophysical Research (2006)&lt;br /&gt;
http://www.agu.org/pubs/crossref/2006/2005JE002444.shtml&lt;br /&gt;
&lt;br /&gt;
Parker et al. Stratigraphy and sedimentology of a dry to wet eolian depositional system, Burns formation, Meridiani Planum, Mars. Earth and Planetary Science Letters (2005)&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Opportunity rover at Meridiani Planum. Science (2004) http://www.sciencemag.org/content/306/5702/1703&lt;br /&gt;
&lt;br /&gt;
Soderblom et al. Pancam multispectral imaging results from the Spirit rover at Gusev crater. Science (2004) http://www.sciencemag.org/content/305/5685/800&lt;br /&gt;
&lt;br /&gt;
Smith et al. Athena microscopic imager investigation. Journal of Geophysical Research-Planets (2003)&lt;br /&gt;
&lt;br /&gt;
Bell et al. Hubble Space Telescope Imaging and Spectroscopy of Mars During 2001. American Geophysical Union (2001)&lt;/div&gt;</summary>
		<author><name>Jascha</name></author>
	</entry>
</feed>