<?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: Probability and information</title>
	<atom:link href="http://www.johndcook.com/blog/2008/03/03/probability-and-information/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2008/03/03/probability-and-information/</link>
	<description>The blog of John D. Cook</description>
	<lastBuildDate>Sat, 11 Feb 2012 01:10:06 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Probability that a number is prime &#8212; The Endeavour</title>
		<link>http://www.johndcook.com/blog/2008/03/03/probability-and-information/comment-page-1/#comment-47971</link>
		<dc:creator>Probability that a number is prime &#8212; The Endeavour</dc:creator>
		<pubDate>Wed, 06 Oct 2010 11:19:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/2008/03/03/probability-and-information/#comment-47971</guid>
		<description>[...] Probability and information What a probability means Connecting probability and number theory    ? X [...]</description>
		<content:encoded><![CDATA[<p>[...] Probability and information What a probability means Connecting probability and number theory    ? X [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2008/03/03/probability-and-information/comment-page-1/#comment-16280</link>
		<dc:creator>John</dc:creator>
		<pubDate>Tue, 21 Apr 2009 20:53:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/2008/03/03/probability-and-information/#comment-16280</guid>
		<description>Loss functions are contentious and easily lead to &lt;a href=&quot;http://www.johndcook.com/blog/2009/02/01/bike-shed-arguments/&quot; rel=&quot;nofollow&quot;&gt;bike shed arguments&lt;/a&gt;. And when people can&#039;t agree on a loss function, the mathematicians win by default: everyone uses classical methods that implicitly assume a squared-error loss function that makes the mathematics most convenient.</description>
		<content:encoded><![CDATA[<p>Loss functions are contentious and easily lead to <a href="http://www.johndcook.com/blog/2009/02/01/bike-shed-arguments/" rel="nofollow">bike shed arguments</a>. And when people can&#8217;t agree on a loss function, the mathematicians win by default: everyone uses classical methods that implicitly assume a squared-error loss function that makes the mathematics most convenient.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ekzept</title>
		<link>http://www.johndcook.com/blog/2008/03/03/probability-and-information/comment-page-1/#comment-16279</link>
		<dc:creator>ekzept</dc:creator>
		<pubDate>Tue, 21 Apr 2009 20:25:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/2008/03/03/probability-and-information/#comment-16279</guid>
		<description>Although I found Berger&#039;s book on Bayesian statistics tough going, he does do a lot with Loss functions and utility.  As an undergraduate physics major and later engineer I was taught a lot of probability in the classic guise.  However, this idea that errors have costs, and you can&#039;t really make the right choice unless and until you decide where your risks are was revealing and interesting.   Not everyone has such a good understanding of the decision they are about to make, so I guess they go with the Loss function equivalent of the uninformed Prior.  Yet, often, as in ROC curves and elsewhere, there&#039;s a natural place for costs of being wrong to be introduced, and I wonder why courses don&#039;t use them more.</description>
		<content:encoded><![CDATA[<p>Although I found Berger&#8217;s book on Bayesian statistics tough going, he does do a lot with Loss functions and utility.  As an undergraduate physics major and later engineer I was taught a lot of probability in the classic guise.  However, this idea that errors have costs, and you can&#8217;t really make the right choice unless and until you decide where your risks are was revealing and interesting.   Not everyone has such a good understanding of the decision they are about to make, so I guess they go with the Loss function equivalent of the uninformed Prior.  Yet, often, as in ROC curves and elsewhere, there&#8217;s a natural place for costs of being wrong to be introduced, and I wonder why courses don&#8217;t use them more.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2008/03/03/probability-and-information/comment-page-1/#comment-43</link>
		<dc:creator>John</dc:creator>
		<pubDate>Thu, 13 Mar 2008 14:21:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/2008/03/03/probability-and-information/#comment-43</guid>
		<description>Agreed. &quot;Optimal&quot; is a loaded term: optimal by what criteria? Does the labor required to compute the solution fit in? A lot of sub-optimal things begin to look closer to optimal when you take more factors -- especially human limitations -- into account.</description>
		<content:encoded><![CDATA[<p>Agreed. &#8220;Optimal&#8221; is a loaded term: optimal by what criteria? Does the labor required to compute the solution fit in? A lot of sub-optimal things begin to look closer to optimal when you take more factors &#8212; especially human limitations &#8212; into account.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew Gelman</title>
		<link>http://www.johndcook.com/blog/2008/03/03/probability-and-information/comment-page-1/#comment-42</link>
		<dc:creator>Andrew Gelman</dc:creator>
		<pubDate>Thu, 13 Mar 2008 14:17:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/2008/03/03/probability-and-information/#comment-42</guid>
		<description>Sure, but &quot;optimal&quot; seems a bit strong!</description>
		<content:encoded><![CDATA[<p>Sure, but &#8220;optimal&#8221; seems a bit strong!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.507 seconds -->

