<?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: Parameters and percentiles</title>
	<atom:link href="http://www.johndcook.com/blog/2010/01/31/parameters-from-percentiles/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2010/01/31/parameters-from-percentiles/</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: human mathematics</title>
		<link>http://www.johndcook.com/blog/2010/01/31/parameters-from-percentiles/comment-page-1/#comment-120988</link>
		<dc:creator>human mathematics</dc:creator>
		<pubDate>Sat, 10 Dec 2011 07:25:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=4351#comment-120988</guid>
		<description>Super awesome. In addition to the practical problem you&#039;ve solved (and could there be survey applications? customer response? employee preference? dating sites?) it makes me think of several abstract issues.

For one, what&#039;s the minimum storage size of a distribution? If you manually specified &quot;all&quot; of the percentiles of the exponential distribution, it could take an infinite amount of storage space, right? But you only need one parameter (or should I say three: base, &#955;, and the function definition) to generate it. On the other hand what&#039;s so special about the functions that we know? A sum of exponentials is simple in some other linear basis but I can&#039;t think of a cheap way to store that in a computer.

For two, every probability distribution is just a 1-generalised function s.t. &#8747;&#402; is a function while &#402; is not guaranteed to be one. Which is why it makes sense to store the CDF&#039;s (they&#039;re also monotonic which has to be good for making them small in some way). So now chase the diagram backwards: your solution with storing percentiles of CDF&#039;s is applicable to any 1-generalised function. Does that buy us anything for free?</description>
		<content:encoded><![CDATA[<p>Super awesome. In addition to the practical problem you&#8217;ve solved (and could there be survey applications? customer response? employee preference? dating sites?) it makes me think of several abstract issues.</p>
<p>For one, what&#8217;s the minimum storage size of a distribution? If you manually specified &#8220;all&#8221; of the percentiles of the exponential distribution, it could take an infinite amount of storage space, right? But you only need one parameter (or should I say three: base, &lambda;, and the function definition) to generate it. On the other hand what&#8217;s so special about the functions that we know? A sum of exponentials is simple in some other linear basis but I can&#8217;t think of a cheap way to store that in a computer.</p>
<p>For two, every probability distribution is just a 1-generalised function s.t. &int;&fnof; is a function while &fnof; is not guaranteed to be one. Which is why it makes sense to store the CDF&#8217;s (they&#8217;re also monotonic which has to be good for making them small in some way). So now chase the diagram backwards: your solution with storing percentiles of CDF&#8217;s is applicable to any 1-generalised function. Does that buy us anything for free?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gregor Gorjanc</title>
		<link>http://www.johndcook.com/blog/2010/01/31/parameters-from-percentiles/comment-page-1/#comment-32032</link>
		<dc:creator>Gregor Gorjanc</dc:creator>
		<pubDate>Mon, 01 Feb 2010 19:15:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=4351#comment-32032</guid>
		<description>This is cool!</description>
		<content:encoded><![CDATA[<p>This is cool!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

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

