{"id":381825,"date":"2024-02-01T17:24:31","date_gmt":"2024-02-01T23:24:31","guid":{"rendered":"http:\/\/xianblog.wordpress.com\/?p=55064"},"modified":"2024-02-01T17:24:31","modified_gmt":"2024-02-01T23:24:31","slug":"simulating-signed-mixtures","status":"publish","type":"post","link":"https:\/\/www.r-bloggers.com\/2024\/02\/simulating-signed-mixtures\/","title":{"rendered":"simulating signed mixtures"},"content":{"rendered":"\r\n\r\n
\r\n[This article was first published on R \u2013 Xi'an's Og<\/a><\/strong>, and kindly contributed to R-bloggers<\/a>]. (You can report issue about the content on this page here<\/a>)\r\n
Want to share your content on R-bloggers? click here<\/a> if you have a blog, or here<\/a> if you don't.\r\n<\/div>\n

\"\"<\/a><\/p>\n

W<\/strong>hile simulating from a mixture of standard densities is relatively straightforward, when the component densities are easily simulated, to the point that many simulation methods<\/a> exploit an intermediary mixture construction to speed up the production of pseudo-random samples from more challenging distributions (see Devroye<\/a>, 1986), things get surprisingly more complicated when the mixture weights can take negative values. For instance, the na\u00efve solution consisting in first simulating from the associated mixture of positive weight components
\nand then using an accept-reject step<\/a> may prove highly inefficient since the overall probability of acceptance<\/p>\n

\"{\\displaystyle<\/p>\n

is the inverse of the sum of the positive weights and hence can be arbitrarily close to zero. The intuition for such inefficiency is that simulating from the positive weight components need not produce values within regions of high probability for the actual distribution<\/p>\n

\"m<\/p>\n

since its negative weight components may remove most of the mass under the positive weight components. In other words, the negative weight components do not have a natural latent variable interpretation and the resulting mixture can be anything, as the above graph testifies.<\/p>\n

\"\"<\/a>Julien Stoehr (Paris Dauphine) and I started investigating this interesting challenge when the Master students who had been exposed to said challenge could not dent it in any meaningful way. We have now arXived<\/a> a specific algorithm that proves superior to the na\u00efve accept-reject <\/a> algorithm, but also to the numerical cdf inversion (which happens to be available in this setting). Compared with the na\u00efve version, we construct an alternative accept-reject scheme<\/a> based on pairing positive and negative components as well as possible, partitioning the real line, and finding tighter upper and lower bounds on positive and negative components, respectively, towards yielding a higher acceptance rate<\/a> on average. Designing a random generator of signed mixtures with enough variability and representativity proved a challenge in itself!<\/p>\n\n

\r\n
To leave a comment<\/strong> for the author, please follow the link and comment on their blog: R \u2013 Xi'an's Og<\/a><\/strong>.<\/div>\r\n
\r\nR-bloggers.com<\/a> offers daily e-mail updates<\/a><\/strong> about R<\/a> news and tutorials about learning R<\/a> and many other topics. Click here if you're looking to post or find an R\/data-science job<\/a>.\r\n\r\n
Want to share your content on R-bloggers? click here<\/a> if you have a blog, or here<\/a> if you don't.\r\n<\/div>","protected":false},"excerpt":{"rendered":"
While simulating from a mixture of standard densities is relatively straightforward, when the component densities are easily simulated, to the point that many simulation methods exploit an intermediary mixture construction to speed up the production of pseudo-random samples from more challenging distributions (see Devroye, 1986), things get surprisingly more complicated when …<\/div>\n
<\/div>\n
<\/div>\n","protected":false},"author":56,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[],"aioseo_notices":[],"jetpack-related-posts":[],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/posts\/381825"}],"collection":[{"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/users\/56"}],"replies":[{"embeddable":true,"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/comments?post=381825"}],"version-history":[{"count":6,"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/posts\/381825\/revisions"}],"predecessor-version":[{"id":388597,"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/posts\/381825\/revisions\/388597"}],"wp:attachment":[{"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/media?parent=381825"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/categories?post=381825"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.r-bloggers.com\/wp-json\/wp\/v2\/tags?post=381825"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}