<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://www.complexity-research.org" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>REVAC</title>
 <link>http://www.complexity-research.org/revac</link>
 <description>Relevance Estimation and Value Calibration of complex system parameters</description>
 <language>en</language>
<item>
 <title>Project Index</title>
 <link>http://www.complexity-research.org/revac/project-index</link>
 <description>&lt;p&gt;The REVAC method provides an information theoretic measure on how sensitive a parameter is to the choice of its value. This can be used to estimate the relevance of parameters, to choose between different possible sets of parameters, and to allocate resources to the calibration of relevant parameters.&lt;/p&gt;
&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/project-index&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Fri, 18 May 2007 18:46:24 +0200</pubDate>
 <dc:creator />
 <guid isPermaLink="false">350 at http://www.complexity-research.org</guid>
</item>
<item>
 <title>Measuring relevance by Shannon entropy</title>
 <link>http://www.complexity-research.org/revac/measuring-relevance-shannon-entropy</link>
 <description>&lt;p&gt;Because REVAC is implemented as a sequence of distributions with slowly decreasing Shannon entropy we can use the Shannon entropy of these distributions to estimate the minimum amount of information needed to reach a target performance level. We can also measure how this information is distributed over the parameters, resulting in a straightforward measure for parameter relevance.&lt;/p&gt;
&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/measuring-relevance-shannon-entropy&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.complexity-research.org/revac/measuring-relevance-shannon-entropy#comments</comments>
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Thu, 10 May 2007 15:25:35 +0200</pubDate>
 <dc:creator>volker</dc:creator>
 <guid isPermaLink="false">355 at http://www.complexity-research.org</guid>
</item>
<item>
 <title>Algorithm details</title>
 <link>http://www.complexity-research.org/revac/algorithm-details</link>
 <description>REVAC starts from an initial table &lt;em class=&quot;error&quot;&gt;TeX Embedding failed!&lt;/em&gt; that was drawn from the uniform distribution over &lt;em class=&quot;error&quot;&gt;TeX Embedding failed!&lt;/em&gt;. The update process that creates a new table &lt;em class=&quot;error&quot;&gt;TeX Embedding failed!&lt;/em&gt; from a given &lt;em class=&quot;error&quot;&gt;TeX Embedding failed!&lt;/em&gt; can be described from both the horizontal and the vertical perspective. Looking at Table &lt;a href=&quot;#vectors&quot;&gt;&lt;/a&gt; from the &lt;em&gt;horizontal&lt;/em&gt; perspective we can identify two basic steps:

&lt;ol&gt;
&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/algorithm-details&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.complexity-research.org/revac/algorithm-details#comments</comments>
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Thu, 10 May 2007 15:10:48 +0200</pubDate>
 <dc:creator>volker</dc:creator>
 <guid isPermaLink="false">354 at http://www.complexity-research.org</guid>
</item>
<item>
 <title>Demonstration</title>
 <link>http://www.complexity-research.org/revac/demonstration</link>
 <description>&lt;p&gt;This demonstration is based on the file &lt;code&gt;calibrate_ga.m&lt;/code&gt; in the software bundle on the &lt;a href=&quot;software&quot;&gt;software page&lt;/a&gt;. The function calibrates a generational genetic algorithm (GA) on one of four test functions: sphere (f1), saddle (f2), step (f3), and Schaffer&#039;s f6 (f6).&lt;/p&gt;
&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/demonstration&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.complexity-research.org/revac/demonstration#comments</comments>
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Thu, 10 May 2007 03:29:29 +0200</pubDate>
 <dc:creator>volker</dc:creator>
 <guid isPermaLink="false">356 at http://www.complexity-research.org</guid>
</item>
<item>
 <title>Publications</title>
 <link>http://www.complexity-research.org/revac/publications</link>
 <description>&lt;p&gt;Volker Nannen, S. K. Smit, and A. E. Eiben, &lt;b&gt;Costs and Benefits of Tuning Parameters of Evolutionary Algorithms,&lt;/b&gt; &lt;i&gt;Proceedings of the 20th Conference on Parallel Problem Solving from Nature&lt;/i&gt;, 2008. [&lt;a href=&quot;http://volker.nannen.com/preprint/Nannen-Smit-Eiben-PPSN-2008.pdf&quot;&gt;pdf&lt;/a&gt;]&lt;/p&gt;
&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/publications&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.complexity-research.org/revac/publications#comments</comments>
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Tue, 08 May 2007 01:20:51 +0200</pubDate>
 <dc:creator>volker</dc:creator>
 <guid isPermaLink="false">358 at http://www.complexity-research.org</guid>
</item>
<item>
 <title>Software</title>
 <link>http://www.complexity-research.org/revac/software</link>
 <description>&lt;p&gt;A zip file with the matlab code used for the IJCAI-07 paper can be downloaded &lt;a href=&quot;/system/files/revac_demo.zip&quot;&gt;here&lt;/a&gt;. After unpacking you have a directory &lt;code&gt;revac_demo/&lt;/code&gt; with the following files and directories: &lt;/p&gt;
&lt;table&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;calibrate_ga.m&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;A function that allows you to test REVAC on a genetic algorithm&lt;/td&gt;
&lt;/tr&gt;
&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/software&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.complexity-research.org/revac/software#comments</comments>
 <enclosure url="http://www.complexity-research.org/system/files/revac_demo.zip" length="40406" type="application/zip" />
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Tue, 08 May 2007 01:19:28 +0200</pubDate>
 <dc:creator>volker</dc:creator>
 <guid isPermaLink="false">357 at http://www.complexity-research.org</guid>
</item>
<item>
 <title>Algorithm</title>
 <link>http://www.complexity-research.org/revac/algorithm</link>
 <description>REVAC uses information theory to measure parameter relevance. Instead of estimating the performance of an EA for specific parameter values or ranges of values, REVAC estimates the expected performance when parameter values are chosen from specific probability density distributions.&lt;div class=&quot;og_rss_groups&quot;&gt;&lt;ul class=&quot;links&quot;&gt;&lt;li class=&quot;first last og_links&quot;&gt;&lt;a href=&quot;/revac&quot; class=&quot;og_links&quot;&gt;REVAC&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;&lt;p&gt;&lt;a href=&quot;http://www.complexity-research.org/revac/algorithm&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.complexity-research.org/revac/algorithm#comments</comments>
 <group domain="http://www.complexity-research.org/revac">REVAC</group>
 <pubDate>Tue, 08 May 2007 01:18:53 +0200</pubDate>
 <dc:creator>volker</dc:creator>
 <guid isPermaLink="false">353 at http://www.complexity-research.org</guid>
</item>
</channel>
</rss>

