University of Cambridge > Talks.cam > Inference Group > On the Analysis of Ellipsoid Approximation of Nested Sampling

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

On the Analysis of Ellipsoid Approximation of Nested Sampling

Download to your calendar using vCal

If you have a question about this talk, please contact Ryan Prescott Adams .

In 2004, Skilling proposed an efficient monte carlo method, called nested sampling, to numerically calculate the evidence in model comparison tasks. One important technical problem is that, in each iteration, we have to perform a uniform sampling under a hard constrain.

In 2006, Mukherjee, Liddle and Parkinson proposed the method called an “ellipsoid approximation” to solve this technical problem. However, a new problem, arising from the ellipsoid method itself, is to select its parameter called the “expansion factor”.

This talk shall breifly give some theoretical and experimental results based on random matrix theory about how to select the appropriate parameter. This is an in-progress work.

This talk is part of the Inference Group series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Institute of Metabolic Science (IMS), Level 4 ATC, Seminar rooms 1,2 & 3 Streaming online Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Group Work An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Pancreatic cancer - the clinical challenge;  Why the microenvironment matters during pancreatic cancer progression and treatment Talk TBC Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity