COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Statistics > A theoretical and methodological discussion of nested sampling
A theoretical and methodological discussion of nested samplingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact R.B.Gramacy. Nested sampling is a novel simulation method for approximating marginal likelihoods, proposed by \cite{Skilling:2007a,Skilling:2007b}. We establish that nested sampling leads to an error that vanishes at the standard Monte Carlo rate N-1/2, where N is a tuning parameter that is proportional to the computational effort, and that this error is asymptotically Gaussian. We show that the corresponding asymptotic variance typically grows linearly with the dimension of the parameter. We use these results to discuss the applicability and efficiency of nested sampling in realistic problems, including posterior distributions for mixtures. We propose an extension of nested sampling that makes it possible to avoid resorting to MCMC to obtain the simulated points. We study two alternative methods for computing marginal likelihood, which, in contrast with nested sampling, are based on draws from the posterior distribution and we conduct a comparison with nested sampling on several realistic examples. This talk is part of the Statistics series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsClare Hall Thursday Lunchtime Talks DAK Group Meetings Wright Lecture SeriesOther talksTowards a whole brain model of perceptual learning Psychology and Suicidal Behaviour Girton College 57th Founders’ Memorial Lecture with Hisham Matar: Life and Work Open as a Tool to Change Ecosystems Saving the People of the Forest: one chocolate bar and one nebulizer treatment at a time LARMOR LECTURE - Exoplanets, on the hunt of Universal life Coatable photovoltaics (Title t o be confirmed) Networks, resilience and complexity Unbiased Estimation of the Eigenvalues of Large Implicit Matrices |