<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Update 3.4 Released</title>
	<atom:link href="http://blog.peltarion.com/2006/05/27/update-34-released/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.peltarion.com/2006/05/27/update-34-released/</link>
	<description>The Peltarion Blog</description>
	<lastBuildDate>Fri, 25 Jun 2010 11:27:30 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Thomas (Peltarion)</title>
		<link>http://blog.peltarion.com/2006/05/27/update-34-released/comment-page-1/#comment-58</link>
		<dc:creator>Thomas (Peltarion)</dc:creator>
		<pubDate>Thu, 20 Jul 2006 07:00:57 +0000</pubDate>
		<guid isPermaLink="false">http://blog.peltarion.com/2006/05/27/update-34-released/#comment-58</guid>
		<description>Hi,

You can use Levenberg-Marquardt as well with components that support gradient optimization. As for network pruning, that&#039;s what the optimizers are for (GA, particle swarm etc). There are also implicit pruning methods through unsupervised training (weight decay...).

As for sensitivity analysis, while you can use it for pruning purposes, it is something that I would not recommend. The sensitivity approach is simply a too blunt instrument as it doesn&#039;t take into consideration the complexities of the non-linearity of the systems and the correlation of data. In most cases it will do more damage than it will help.

The best pruning approach is through the use of global optimizers that optimize the whole system topology.

--Thomas</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>You can use Levenberg-Marquardt as well with components that support gradient optimization. As for network pruning, that&#8217;s what the optimizers are for (GA, particle swarm etc). There are also implicit pruning methods through unsupervised training (weight decay&#8230;).</p>
<p>As for sensitivity analysis, while you can use it for pruning purposes, it is something that I would not recommend. The sensitivity approach is simply a too blunt instrument as it doesn&#8217;t take into consideration the complexities of the non-linearity of the systems and the correlation of data. In most cases it will do more damage than it will help.</p>
<p>The best pruning approach is through the use of global optimizers that optimize the whole system topology.</p>
<p>&#8211;Thomas</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: SAndhya Samarasinghe</title>
		<link>http://blog.peltarion.com/2006/05/27/update-34-released/comment-page-1/#comment-57</link>
		<dc:creator>SAndhya Samarasinghe</dc:creator>
		<pubDate>Thu, 20 Jul 2006 04:39:14 +0000</pubDate>
		<guid isPermaLink="false">http://blog.peltarion.com/2006/05/27/update-34-released/#comment-57</guid>
		<description>Hi
I am also wondering if you do now or plan to use sensitivity approaches to network pruning in MLP to optimize the networks as this approach may be more useful in deleting links more meaningfully and methodically?</description>
		<content:encoded><![CDATA[<p>Hi<br />
I am also wondering if you do now or plan to use sensitivity approaches to network pruning in MLP to optimize the networks as this approach may be more useful in deleting links more meaningfully and methodically?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: SAndhya Samarasinghe</title>
		<link>http://blog.peltarion.com/2006/05/27/update-34-released/comment-page-1/#comment-56</link>
		<dc:creator>SAndhya Samarasinghe</dc:creator>
		<pubDate>Thu, 20 Jul 2006 04:32:49 +0000</pubDate>
		<guid isPermaLink="false">http://blog.peltarion.com/2006/05/27/update-34-released/#comment-56</guid>
		<description>Hi
I am wondering if you use any other second order error minimization methods than QuickPRop.  I mean Levenberg Marquardt, Conjugate Gradient, Newton method etc. in MLP.</description>
		<content:encoded><![CDATA[<p>Hi<br />
I am wondering if you use any other second order error minimization methods than QuickPRop.  I mean Levenberg Marquardt, Conjugate Gradient, Newton method etc. in MLP.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Robert</title>
		<link>http://blog.peltarion.com/2006/05/27/update-34-released/comment-page-1/#comment-13</link>
		<dc:creator>Robert</dc:creator>
		<pubDate>Wed, 31 May 2006 01:15:43 +0000</pubDate>
		<guid isPermaLink="false">http://blog.peltarion.com/2006/05/27/update-34-released/#comment-13</guid>
		<description>I had some trouble installing it until I realized that my firewall was blocking it out. Doh!</description>
		<content:encoded><![CDATA[<p>I had some trouble installing it until I realized that my firewall was blocking it out. Doh!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Zeppo</title>
		<link>http://blog.peltarion.com/2006/05/27/update-34-released/comment-page-1/#comment-12</link>
		<dc:creator>Zeppo</dc:creator>
		<pubDate>Sun, 28 May 2006 23:53:38 +0000</pubDate>
		<guid isPermaLink="false">http://blog.peltarion.com/2006/05/27/update-34-released/#comment-12</guid>
		<description>Good work, the csv file format is much bettern now. Thanks.</description>
		<content:encoded><![CDATA[<p>Good work, the csv file format is much bettern now. Thanks.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
