<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>De Rerum Natura</title>
	<atom:link href="http://www.corrada.com/blog/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.corrada.com/blog</link>
	<description>Randomness, entropy, pattern matching, maps, geometry, knots, and scientific readings</description>
	<lastBuildDate>Fri, 24 Jul 2009 20:36:23 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>On the usefulness of glorious failures</title>
		<link>http://www.corrada.com/blog/2009/07/23/on-the-usefulness-of-glorious-failures/</link>
		<comments>http://www.corrada.com/blog/2009/07/23/on-the-usefulness-of-glorious-failures/#comments</comments>
		<pubDate>Fri, 24 Jul 2009 03:03:05 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Randomness]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=127</guid>
		<description><![CDATA[Jon Stewart&#8217;s comments on the usefulness of the Apollo missions:
It was that fateful day in July that we planted the Stars and Stripes in the lunar surface, officially claiming the moon as America&#8217;s space Puerto Rico. It was all ours. It was the culmination of a dream. &#8230; It took us ten years, astronauts&#8217; lives, [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2009/07/23/on-the-usefulness-of-glorious-failures/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Apology to my few readers</title>
		<link>http://www.corrada.com/blog/2009/01/13/apology-to-my-few-readers/</link>
		<comments>http://www.corrada.com/blog/2009/01/13/apology-to-my-few-readers/#comments</comments>
		<pubDate>Wed, 14 Jan 2009 00:56:46 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Randomness]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=112</guid>
		<description><![CDATA[I want to apologize to my few readers for the lack of posts since May of last year. This is partly due to personal circumstances that overwhelmed me emotionally and mentally. Since last Fall, however, I have rebounded and have been, since Thanksgiving, been engaged in an immensely satisfying intellectual journey that has greatly generalized [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2009/01/13/apology-to-my-few-readers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Guaranteeing accuracy and precision</title>
		<link>http://www.corrada.com/blog/2008/11/17/guaranteeing-accuracy-and-precision/</link>
		<comments>http://www.corrada.com/blog/2008/11/17/guaranteeing-accuracy-and-precision/#comments</comments>
		<pubDate>Mon, 17 Nov 2008 19:41:21 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Randomness]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=90</guid>
		<description><![CDATA[Discussions in this blog on precision error estimation via &ell; 1  minimization have made it clear that the technique is only good for recovering precision, not accuracy. This post will argue that accuracy can also be guaranteed if all the detectors have a greater than one-half probability of being correct.
By &#8220;guaranteed&#8221;, I mean that [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/11/17/guaranteeing-accuracy-and-precision/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Site CSS broken</title>
		<link>http://www.corrada.com/blog/2008/11/17/site-css-broken/</link>
		<comments>http://www.corrada.com/blog/2008/11/17/site-css-broken/#comments</comments>
		<pubDate>Mon, 17 Nov 2008 05:41:18 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Randomness]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=88</guid>
		<description><![CDATA[My introduction of cool pop-out images has created all sorts of bad css entries for this site. The site no longer validates as having well-formed CSS (check out the validate button at the bottom of this page). I apologize to the purists out there. I am proud to say, however, that it validates as correct [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/11/17/site-css-broken/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Robust voting in uncertain environments</title>
		<link>http://www.corrada.com/blog/2008/11/17/robust-voting-in-uncertain-environments/</link>
		<comments>http://www.corrada.com/blog/2008/11/17/robust-voting-in-uncertain-environments/#comments</comments>
		<pubDate>Mon, 17 Nov 2008 05:00:15 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Compressed Sensing]]></category>
		<category><![CDATA[Machine Learning]]></category>
		<category><![CDATA[Randomness]]></category>
		<category><![CDATA[precision error application]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=83</guid>
		<description><![CDATA[Combining the judgments of different recognizers is always better than using the best one alone. This observation is universal in machine learning realms. But it seldom gets used in practice. Why?
For one, it costs more to implement. Instead of one recognizer, you must deploy several. Computing cycles grow linearly with the number of recognizers if [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/11/17/robust-voting-in-uncertain-environments/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Positive and negative precision error correlations, real or not?</title>
		<link>http://www.corrada.com/blog/2008/05/07/positive-and-negative-precision-error-correlations-real-or-not/</link>
		<comments>http://www.corrada.com/blog/2008/05/07/positive-and-negative-precision-error-correlations-real-or-not/#comments</comments>
		<pubDate>Thu, 08 May 2008 02:27:16 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Compressed Sensing]]></category>
		<category><![CDATA[Error Theory]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=78</guid>
		<description><![CDATA[

All the experiments we have been carrying out with precision error have, so far, been with real data. Because of this, we do not have &#8220;ground truth&#8221; to determine if the reconstruction is correct. That changed today.
Synthetic experiments are a well-known device for studying models or algorithms. By artificially creating data where one knows exactly [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/05/07/positive-and-negative-precision-error-correlations-real-or-not/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Not every measurement is perfect</title>
		<link>http://www.corrada.com/blog/2008/04/13/not-every-measurement-is-perfect/</link>
		<comments>http://www.corrada.com/blog/2008/04/13/not-every-measurement-is-perfect/#comments</comments>
		<pubDate>Mon, 14 Apr 2008 01:34:12 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Multiple Choice Questions Exam]]></category>
		<category><![CDATA[precision error application]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=73</guid>
		<description><![CDATA[
Just to show that not all questions behave as nicely as question 9 in the previous post, here is the plot for question 6 in the same exam.The fit is not as good as for question 9. This is expected, there is no reason why the precision error should decay with a perfect exponential behavior. [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/04/13/not-every-measurement-is-perfect/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Minimum number of questions revisited</title>
		<link>http://www.corrada.com/blog/2008/04/11/minimum-number-of-questions-revisited/</link>
		<comments>http://www.corrada.com/blog/2008/04/11/minimum-number-of-questions-revisited/#comments</comments>
		<pubDate>Sat, 12 Apr 2008 04:02:10 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Randomness]]></category>
		<category><![CDATA[Multiple Choice Questions Exam]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=70</guid>
		<description><![CDATA[To show off the installation of FancyZoom (a trick I learned while visiting the excellent Language Log), I present a graph of the percentage variation in the mean square precision error as a function of the number of questions used to compute it. The image looks small but you can now click on it to [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/04/11/minimum-number-of-questions-revisited/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ICML accepts precision error via L1 minimization paper</title>
		<link>http://www.corrada.com/blog/2008/04/09/icml-accepts-precision-error-via-l1-minimization-paper/</link>
		<comments>http://www.corrada.com/blog/2008/04/09/icml-accepts-precision-error-via-l1-minimization-paper/#comments</comments>
		<pubDate>Wed, 09 Apr 2008 10:48:02 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Compressed Sensing]]></category>
		<category><![CDATA[Fourier Analysis]]></category>
		<category><![CDATA[Group Theory]]></category>
		<category><![CDATA[MathML]]></category>
		<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Randomness]]></category>
		<category><![CDATA[Scientific Readings]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=69</guid>
		<description><![CDATA[Our technical report on how to recover precision error estimates with &ell; 1 -minimization has been accepted by the 2008 International Conference on Machine Learning.
The paper originally got three anonymous reviews. Two were positive, one strongly negative. In our response to the reviews, we agreed with the general criticism by the reviewers that one experimental [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/04/09/icml-accepts-precision-error-via-l1-minimization-paper/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Precision error for parse trees</title>
		<link>http://www.corrada.com/blog/2008/04/01/precision-error-for-parse-trees/</link>
		<comments>http://www.corrada.com/blog/2008/04/01/precision-error-for-parse-trees/#comments</comments>
		<pubDate>Tue, 01 Apr 2008 05:20:21 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Error Theory]]></category>
		<category><![CDATA[Graph Theory]]></category>
		<category><![CDATA[Natural Language Processing]]></category>
		<category><![CDATA[parse trees]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=68</guid>
		<description><![CDATA[The precision error equations require that &#8220;ground truth&#8221; cancel out. It is easy to see what that means for elevations in a map. What does it mean for parse trees in a natural language processing task like sentence parsing?
One way to define distance between trees is to consider the total number of reverse operations that [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2008/04/01/precision-error-for-parse-trees/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
