<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for Xi&#039;an&#039;s Og</title>
	<atom:link href="http://xianblog.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://xianblog.wordpress.com</link>
	<description>an attempt at bloggin, from scratch...</description>
	<lastBuildDate>Thu, 23 May 2013 01:47:56 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals by Manoel Galdino</title>
		<link>http://xianblog.wordpress.com/2013/05/23/adaptive-metropolis-hastings-sampling-using-reversible-dependent-mixture-proposals/comment-page-1/#comment-36029</link>
		<dc:creator><![CDATA[Manoel Galdino]]></dc:creator>
		<pubDate>Thu, 23 May 2013 01:47:56 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20680#comment-36029</guid>
		<description><![CDATA[It sounds cool, even though I don&#039;t fully understand it (e.g. the reference to Dirac Mass, among others)]]></description>
		<content:encoded><![CDATA[<p>It sounds cool, even though I don&#8217;t fully understand it (e.g. the reference to Dirac Mass, among others)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on inference in Kingman&#8217;s coalescent with pMCMC by Dan Simpson</title>
		<link>http://xianblog.wordpress.com/2013/05/22/inference-in-kingmans-coalescent-with-pmcmc/comment-page-1/#comment-36005</link>
		<dc:creator><![CDATA[Dan Simpson]]></dc:creator>
		<pubDate>Tue, 21 May 2013 23:25:35 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20628#comment-36005</guid>
		<description><![CDATA[Surely you can make a PMCMC scheme that doesn&#039;t degrade.  Take an infinite dimensional MCMC scheme coupled with a similar SMC scheme. (This should be possible if there is structure in the parameter posterior, which there must be eventually if the model is identifiable)   Similar with exact-approximate methods - you can find (unrealistic) asymptotic regimes for which the dimension of the parameter space for essentially infinite dimensional spatial problems doesn&#039;t affect the performance of the scheme. (I think... The trick should be to combine a dimension-independt MCMC scheme with a dimension independent approximation to the likelihood.  It&#039;s certainly possible, but only in really dumb situations, like outfill asymptotics for spatial problems....)

But (theoretical) correctness, asymptotic exactness and dimension independence aren&#039;t necessarily useful things... I would love it if someone could prove that, given a random sequence, you can construct a pseudo-marginal mcmc scheme that is exact for an arbitrary distribution that is coupled with the random sequence for an arbitrary time T (in expectation, maybe)...  It would be one hell of a companion to the paper that Geoff Nicholls, Colin Fox and Alexis Muir-Watt wrote!]]></description>
		<content:encoded><![CDATA[<p>Surely you can make a PMCMC scheme that doesn&#8217;t degrade.  Take an infinite dimensional MCMC scheme coupled with a similar SMC scheme. (This should be possible if there is structure in the parameter posterior, which there must be eventually if the model is identifiable)   Similar with exact-approximate methods &#8211; you can find (unrealistic) asymptotic regimes for which the dimension of the parameter space for essentially infinite dimensional spatial problems doesn&#8217;t affect the performance of the scheme. (I think&#8230; The trick should be to combine a dimension-independt MCMC scheme with a dimension independent approximation to the likelihood.  It&#8217;s certainly possible, but only in really dumb situations, like outfill asymptotics for spatial problems&#8230;.)</p>
<p>But (theoretical) correctness, asymptotic exactness and dimension independence aren&#8217;t necessarily useful things&#8230; I would love it if someone could prove that, given a random sequence, you can construct a pseudo-marginal mcmc scheme that is exact for an arbitrary distribution that is coupled with the random sequence for an arbitrary time T (in expectation, maybe)&#8230;  It would be one hell of a companion to the paper that Geoff Nicholls, Colin Fox and Alexis Muir-Watt wrote!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on detachment by Eric Marchand</title>
		<link>http://xianblog.wordpress.com/2013/05/19/detachment/comment-page-1/#comment-36000</link>
		<dc:creator><![CDATA[Eric Marchand]]></dc:creator>
		<pubDate>Tue, 21 May 2013 15:02:18 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20579#comment-36000</guid>
		<description><![CDATA[indeed, a great movie.  The French movie -Entres les Murs - de Laurent Cantet explores a similar theme, as well as the French Canadian -Monsieur Lahzar- (albeit with a happier ending).

Éric]]></description>
		<content:encoded><![CDATA[<p>indeed, a great movie.  The French movie -Entres les Murs &#8211; de Laurent Cantet explores a similar theme, as well as the French Canadian -Monsieur Lahzar- (albeit with a happier ending).</p>
<p>Éric</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on teaching in English by jucor</title>
		<link>http://xianblog.wordpress.com/2013/05/20/teaching-in-english/comment-page-1/#comment-35996</link>
		<dc:creator><![CDATA[jucor]]></dc:creator>
		<pubDate>Tue, 21 May 2013 12:19:15 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20653#comment-35996</guid>
		<description><![CDATA[* For: well, 2 Nobel prizes, 1 Fields medal, among others.
* Against, in reaction a week later: one unknown professor from EPITA, a not-so-famous CS/IT 100% teaching school with no research and a rather tumultuous reputation.
 
Fully endorsing the risk of mixing the message and the speaker, I love the contrast.]]></description>
		<content:encoded><![CDATA[<p>* For: well, 2 Nobel prizes, 1 Fields medal, among others.<br />
* Against, in reaction a week later: one unknown professor from EPITA, a not-so-famous CS/IT 100% teaching school with no research and a rather tumultuous reputation.</p>
<p>Fully endorsing the risk of mixing the message and the speaker, I love the contrast.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on painful truncnorm by Joint_p</title>
		<link>http://xianblog.wordpress.com/2013/04/09/painful-truncnorm/comment-page-1/#comment-35974</link>
		<dc:creator><![CDATA[Joint_p]]></dc:creator>
		<pubDate>Mon, 20 May 2013 18:20:05 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20300#comment-35974</guid>
		<description><![CDATA[I think your comments swallow pasted code ....

truncnorm=function(a,b,mu,sigma){
  u0] = qnorm(pnorm((a-mu)/sigma)*(1-u[foo&gt;0])+u[foo&gt;0]*pnorm((b-mu)/sigma))
  u[foo&lt;=0] =-qnorm(pnorm(-(a-mu)/sigma)*(1-u[foo&lt;=0])-u[foo&lt;=0]*pnorm(-(b-mu)/sigma))
  return(mu+sigma*u)
}]]></description>
		<content:encoded><![CDATA[<p>I think your comments swallow pasted code &#8230;.</p>
<p>truncnorm=function(a,b,mu,sigma){<br />
  u0] = qnorm(pnorm((a-mu)/sigma)*(1-u[foo&gt;0])+u[foo&gt;0]*pnorm((b-mu)/sigma))<br />
  u[foo&lt;=0] =-qnorm(pnorm(-(a-mu)/sigma)*(1-u[foo&lt;=0])-u[foo&lt;=0]*pnorm(-(b-mu)/sigma))<br />
  return(mu+sigma*u)<br />
}</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on painful truncnorm by Joint_p</title>
		<link>http://xianblog.wordpress.com/2013/04/09/painful-truncnorm/comment-page-1/#comment-35973</link>
		<dc:creator><![CDATA[Joint_p]]></dc:creator>
		<pubDate>Mon, 20 May 2013 18:17:35 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20300#comment-35973</guid>
		<description><![CDATA[Thin slices seem to be a problem for this method:

&gt; truncnorm(8,9,0,1)
[1] 8.0414
&gt; truncnorm(8,9,0,1)
[1] 8.0414
&gt; truncnorm(8,9,0,1)
[1] 8.209536
&gt; truncnorm(8,9,0,1)
[1] 8.125891
&gt; truncnorm(8,9,0,1)
[1] 8.076571
&gt; truncnorm(8,9,0,1)
[1] Inf

Compare it:

&gt; sum(is.finite(rtnorm(10000,0,1,8,9)))
[1] 10000


Ok, so I vectorized the original code from this post and did some investigation:

truncnorm=function(a,b,mu,sigma){
  u0] = qnorm(pnorm((a-mu)/sigma)*(1-u[foo&gt;0])+u[foo&gt;0]*pnorm((b-mu)/sigma))
  u[foo&lt;=0] =-qnorm(pnorm(-(a-mu)/sigma)*(1-u[foo&lt;=0])-u[foo 100000-sum(is.finite(truncnorm(rep(8,100000),rep(9,100000),rep(0,100000),rep(1,100000))))
[1] 9166
&gt; system.time(truncnorm(rep(8,100000),rep(9,100000),rep(0,100000),rep(1,100000)))
   user  system elapsed 
   0.08    0.00    0.08 
&gt; system.time((rtnorm(100000,0,1,8,9)))
   user  system elapsed 
   0.11    0.03    0.14 

Clearly, the iCDF is faster. However, it is quite astonishing how fast the A-R sampler is.]]></description>
		<content:encoded><![CDATA[<p>Thin slices seem to be a problem for this method:</p>
<p>&gt; truncnorm(8,9,0,1)<br />
[1] 8.0414<br />
&gt; truncnorm(8,9,0,1)<br />
[1] 8.0414<br />
&gt; truncnorm(8,9,0,1)<br />
[1] 8.209536<br />
&gt; truncnorm(8,9,0,1)<br />
[1] 8.125891<br />
&gt; truncnorm(8,9,0,1)<br />
[1] 8.076571<br />
&gt; truncnorm(8,9,0,1)<br />
[1] Inf</p>
<p>Compare it:</p>
<p>&gt; sum(is.finite(rtnorm(10000,0,1,8,9)))<br />
[1] 10000</p>
<p>Ok, so I vectorized the original code from this post and did some investigation:</p>
<p>truncnorm=function(a,b,mu,sigma){<br />
  u0] = qnorm(pnorm((a-mu)/sigma)*(1-u[foo&gt;0])+u[foo&gt;0]*pnorm((b-mu)/sigma))<br />
  u[foo&lt;=0] =-qnorm(pnorm(-(a-mu)/sigma)*(1-u[foo&lt;=0])-u[foo 100000-sum(is.finite(truncnorm(rep(8,100000),rep(9,100000),rep(0,100000),rep(1,100000))))<br />
[1] 9166<br />
&gt; system.time(truncnorm(rep(8,100000),rep(9,100000),rep(0,100000),rep(1,100000)))<br />
   user  system elapsed<br />
   0.08    0.00    0.08<br />
&gt; system.time((rtnorm(100000,0,1,8,9)))<br />
   user  system elapsed<br />
   0.11    0.03    0.14 </p>
<p>Clearly, the iCDF is faster. However, it is quite astonishing how fast the A-R sampler is.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on painful truncnorm by Joe Liebig</title>
		<link>http://xianblog.wordpress.com/2013/04/09/painful-truncnorm/comment-page-1/#comment-35953</link>
		<dc:creator><![CDATA[Joe Liebig]]></dc:creator>
		<pubDate>Mon, 20 May 2013 04:17:59 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20300#comment-35953</guid>
		<description><![CDATA[This is also my experience. Rtnorm does a very good job in these extreme cases and it seems to be faster than the inverse CDF method. However, I am missing a Rcpp version of this. I have lots of sampling steps involving truncated Normal that I would like to reprogram using RcppArmadillo... Is there any C implementation of this to build on?]]></description>
		<content:encoded><![CDATA[<p>This is also my experience. Rtnorm does a very good job in these extreme cases and it seems to be faster than the inverse CDF method. However, I am missing a Rcpp version of this. I have lots of sampling steps involving truncated Normal that I would like to reprogram using RcppArmadillo&#8230; Is there any C implementation of this to build on?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on the cartoon introduction to statistics by xi'an</title>
		<link>http://xianblog.wordpress.com/2013/05/16/the-cartoon-introduction-to-statistics/comment-page-1/#comment-35942</link>
		<dc:creator><![CDATA[xi'an]]></dc:creator>
		<pubDate>Sun, 19 May 2013 09:02:13 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20605#comment-35942</guid>
		<description><![CDATA[A: I completely agree! In the current case, the drawing style introduces an extra element of confusion...]]></description>
		<content:encoded><![CDATA[<p>A: I completely agree! In the current case, the drawing style introduces an extra element of confusion&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on the cartoon introduction to statistics by Andrew Gelman</title>
		<link>http://xianblog.wordpress.com/2013/05/16/the-cartoon-introduction-to-statistics/comment-page-1/#comment-35936</link>
		<dc:creator><![CDATA[Andrew Gelman]]></dc:creator>
		<pubDate>Sun, 19 May 2013 03:16:26 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20605#comment-35936</guid>
		<description><![CDATA[X,

Here&#039;s what I wrote &lt;a href=&quot;http://andrewgelman.com/2008/12/23/if_textbooks_in/&quot; rel=&quot;nofollow&quot;&gt;a few years ago&lt;/a&gt; about a similar book:

&lt;blockquote&gt;the point of the comic-book format seems to be to allow a punchy, power-point sort of delivery. The picture conveys essentially no content, which would suggest that the entire contents of a 222-page comic book could be presented in a 10-page pamphlet of text. The remaining 212 pages are essentially a reader-friendly trick to get students to turn the pages. It’s the printed analogy to a power-point presentation.

So . . . let’s take the customers’ word for it that these cartoon guides are good. If so, this suggests that the useful content of a typical introductory statistics book can be captured in 10 pages. And, if this is the case, it in turn suggests that textbook writers could do a better job with those other 212 pages. Maybe it would be better to have a 10-page textbook and 212 pages of examples? Presumably a good textbook author could do better than those silly cartoons.&lt;/blockquote&gt;]]></description>
		<content:encoded><![CDATA[<p>X,</p>
<p>Here&#8217;s what I wrote <a href="http://andrewgelman.com/2008/12/23/if_textbooks_in/" rel="nofollow">a few years ago</a> about a similar book:</p>
<blockquote><p>the point of the comic-book format seems to be to allow a punchy, power-point sort of delivery. The picture conveys essentially no content, which would suggest that the entire contents of a 222-page comic book could be presented in a 10-page pamphlet of text. The remaining 212 pages are essentially a reader-friendly trick to get students to turn the pages. It’s the printed analogy to a power-point presentation.</p>
<p>So . . . let’s take the customers’ word for it that these cartoon guides are good. If so, this suggests that the useful content of a typical introductory statistics book can be captured in 10 pages. And, if this is the case, it in turn suggests that textbook writers could do a better job with those other 212 pages. Maybe it would be better to have a 10-page textbook and 212 pages of examples? Presumably a good textbook author could do better than those silly cartoons.</p></blockquote>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Himalayan fight by Julyan Arbel</title>
		<link>http://xianblog.wordpress.com/2013/05/11/himalayan-fight/comment-page-1/#comment-35881</link>
		<dc:creator><![CDATA[Julyan Arbel]]></dc:creator>
		<pubDate>Thu, 16 May 2013 14:13:50 +0000</pubDate>
		<guid isPermaLink="false">http://xianblog.wordpress.com/?p=20573#comment-35881</guid>
		<description><![CDATA[Hi Xian, 
in case you&#039;re not aware of it, I warmly recommand John Griffith&#039; blog : http://www.alpineexposures.com/blogs/chamonix-conditions
Amazing alpine pictures ! and you&#039;ll have his complete version of the Everest story.]]></description>
		<content:encoded><![CDATA[<p>Hi Xian,<br />
in case you&#8217;re not aware of it, I warmly recommand John Griffith&#8217; blog : <a href="http://www.alpineexposures.com/blogs/chamonix-conditions" rel="nofollow">http://www.alpineexposures.com/blogs/chamonix-conditions</a><br />
Amazing alpine pictures ! and you&#8217;ll have his complete version of the Everest story.</p>
]]></content:encoded>
	</item>
</channel>
</rss>