<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Amplification using recurrent connectivity</title>
	<atom:link href="http://neurodudes.com/2005/09/08/amplification-using-recurrent-connectivity/feed/" rel="self" type="application/rss+xml" />
	<link>http://neurodudes.com/2005/09/08/amplification-using-recurrent-connectivity/</link>
	<description>at the intersection of neuroscience and AI.</description>
	<pubDate>Sun, 07 Sep 2008 02:01:10 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: Viren</title>
		<link>http://neurodudes.com/2005/09/08/amplification-using-recurrent-connectivity/#comment-850</link>
		<dc:creator>Viren</dc:creator>
		<pubDate>Fri, 09 Sep 2005 06:20:12 +0000</pubDate>
		<guid isPermaLink="false">http://neurodudes.com/2005/09/08/amplification-using-recurrent-connectivity/#comment-850</guid>
		<description>If you are interested in this type of thing, I highly recommend looking into Sebastian Seung's neural network course lecture notes &#38; videos (http://seunglab.mit.edu/courses/9.641/lectures/index.html). The first half of the course takes a very EE-inspired approach to analyzing neural network dynamics in terms of concepts such as amplification, attenuation, and integration. A short summary of these results can be found in: http://hebb.mit.edu/people/seung/papers/hbtnn.pdf

The theory of "permitted and forbidden sets" leads to more sophisticated analysis of recurrent networks. For example, one can use the eigenvalues of the synaptic weight matrix to show that certain sets of neurons in a network are "forbidden" from ever being activated together while others are "permitted" to be active together (at stable points of the network activity). This makes it simple to analytically relate synaptic structure to computational function (with relevant examples from associative memory and constraint satisfacation studied in the course notes). Also, these networks (provably) operate within a dynamical regime known as "hybrid computation" that exhibits both digital and analog qualities conjectured to be important properties of biological networks.</description>
		<content:encoded><![CDATA[<p>If you are interested in this type of thing, I highly recommend looking into Sebastian Seung&#8217;s neural network course lecture notes &amp; videos (http://seunglab.mit.edu/courses/9.641/lectures/index.html). The first half of the course takes a very EE-inspired approach to analyzing neural network dynamics in terms of concepts such as amplification, attenuation, and integration. A short summary of these results can be found in: <a href="http://hebb.mit.edu/people/seung/papers/hbtnn.pdf" rel="nofollow">http://hebb.mit.edu/people/seung/papers/hbtnn.pdf</a></p>
<p>The theory of &#8220;permitted and forbidden sets&#8221; leads to more sophisticated analysis of recurrent networks. For example, one can use the eigenvalues of the synaptic weight matrix to show that certain sets of neurons in a network are &#8220;forbidden&#8221; from ever being activated together while others are &#8220;permitted&#8221; to be active together (at stable points of the network activity). This makes it simple to analytically relate synaptic structure to computational function (with relevant examples from associative memory and constraint satisfacation studied in the course notes). Also, these networks (provably) operate within a dynamical regime known as &#8220;hybrid computation&#8221; that exhibits both digital and analog qualities conjectured to be important properties of biological networks.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
