Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Distributions to Estimate Population Parameter01:26

Distributions to Estimate Population Parameter

The accurate values of population parameters such as population proportion, population mean, and population standard deviation (or variance) are usually unknown. These are fixed values that can only be estimated from the data collected from the samples. The estimates of each of these parameters are sample proportion, the sample mean, and sample standard deviation (or variance). To obtain the values of these sample statistics, data are required that have particular distribution and central...
Central Limit Theorem01:14

Central Limit Theorem

The central limit theorem, abbreviated as clt, is one of the most powerful and useful ideas in all of statistics. The central limit theorem for sample means says that if you repeatedly draw samples of a given size and calculate their means, and create a histogram of those means, then the resulting histogram will tend to have an approximate normal bell shape. In other words, as sample sizes increase, the distribution of means follows the normal distribution more closely.
The sample size, n, that...
Sampling Distribution01:12

Sampling Distribution

Given simple random samples of size n from a given population with a measured characteristic such as mean, proportion, or standard deviation for each sample, the probability distribution of all the measured characteristics is called a sampling distribution. How much the statistic varies from one sample to another is known as the sampling variability of a statistic. You typically measure the sampling variability of a statistic by its standard error. The standard error of the mean is an example...
Applications of Normal Distribution01:22

Applications of Normal Distribution

The normal distribution is a useful statistical tool. One of its practical applications is determining the door height after considering the normal distribution of heights of persons, such that many can pass through it easily without striking their heads. The normal distribution can also determine the probability of a person having a height less than a specific height.
The heights of 15 to 18-year-old males from Chile from 1984 to 1985 followed a normal distribution. The mean height is 172.36...
Random Sampling Method01:09

Random Sampling Method

Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Fast Value Tracking for Deep Reinforcement Learning.

... International Conference on Learning Representations·2026
Same author

Causal-StoNet: Causal Inference for High-Dimensional Complex Data.

... International Conference on Learning Representations·2026
Same author

Conformal Prediction in Clinical Artificial Intelligence: Enhancing Model Reliability and Interpretability.

Chest·2026
Same author

Magnitude Pruning of Large Pretrained Transformer Models with a Mixture Gaussian Prior.

Journal of data science : JDS·2025
Same author

Extended fiducial inference for individual treatment effects via deep neural networks.

Statistics and computing·2025
Same author

A New Paradigm for Generative Adversarial Networks based on Randomized Decision Rules.

Statistica Sinica·2025

Related Experiment Video

Updated: May 12, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

A Monte Carlo Metropolis-Hastings algorithm for sampling from distributions with intractable normalizing constants.

Faming Liang, Ick-Hoon Jin

    Neural Computation
    |April 24, 2013
    PubMed
    Summary

    A new Monte Carlo Metropolis-Hastings (MCMH) algorithm enables simulations from complex distributions. This method overcomes challenges with intractable normalizing constants, offering broader applicability in machine learning and statistics.

    More Related Videos

    Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package
    06:37

    Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package

    Published on: September 17, 2021

    Related Experiment Videos

    Last Updated: May 12, 2026

    Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
    12:11

    Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

    Published on: April 8, 2020

    Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package
    06:37

    Analyzing Melts and Fluids from Ab Initio Molecular Dynamics Simulations with the UMD Package

    Published on: September 17, 2021

    Area of Science:

    • Machine Learning
    • Statistical Modeling
    • Computational Statistics

    Background:

    • Simulating from probability distributions with intractable normalizing constants is a significant challenge in statistical modeling and machine learning.
    • Existing methods like auxiliary variable Markov chain Monte Carlo (MCMC) algorithms often require perfect sampling, which is computationally expensive or unavailable for many models.

    Discussion:

    • The proposed Monte Carlo Metropolis-Hastings (MCMH) algorithm offers a novel approach to address intractable normalizing constants.
    • MCMH replaces the exact normalizing constant ratio with a Monte Carlo estimate, enabling convergence to the target distribution under mild conditions.
    • This method is demonstrated on spatial autologistic and exponential random graph models, showcasing its practical utility.

    Key Insights:

    • The MCMH algorithm provides a viable alternative to existing MCMC methods by removing the need for perfect sampling.
    • It expands the applicability of simulation-based inference to a wider range of statistical models, including those with intractable integrals.
    • The algorithm is suitable for Bayesian inference in random effect models and handling missing data problems.

    Outlook:

    • Further research can explore the theoretical properties and efficiency of MCMH across diverse complex models.
    • The algorithm's application can be extended to other areas of artificial intelligence and data science requiring intractable distribution simulation.
    • Investigating adaptive versions of MCMH could enhance its performance and computational efficiency for large-scale problems.