Tagged articles
MCMC
13 articles · Page 1 of 1
The article explains how Bayesian Structured Time Series (BSTS) combined with the CausalImpact library can be used to estimate causal effects for policies or marketing interventions when traditional A/B experiments are infeasible, detailing model theory, Bayesian inference, MCMC estimation, code implementation, and a real‑world holiday‑push case study.
BSTSBayesian ModelingCausalImpact
0 likes · 20 min read

Markov Chain Monte Carlo (MCMC) extends classic Monte Carlo by generating dependent samples via a Markov chain, enabling Bayesian inference through concepts like the plug‑in principle, burn‑in, asymptotic independence, and algorithms such as Metropolis‑Hastings and Gibbs sampling, while addressing convergence and effective sample size.
Bayesian inferenceGibbs samplingMCMC
0 likes · 13 min read

This article explains the principles behind Markov Chain Monte Carlo methods, including Monte Carlo sampling, the Metropolis‑Hastings algorithm, and the Hamiltonian Monte Carlo (HMC) approach, illustrating how they efficiently approximate posterior distributions in Bayesian analysis.
Bayesian inferenceHamiltonian Monte CarloMCMC
0 likes · 11 min read

This article explains Bayesian statistics as a probabilistic framework, describes how modern numerical methods and probabilistic programming languages automate inference, and reviews both Markov and non‑Markov techniques such as MCMC, grid computation, Laplace approximation, and variational inference for building complex models.
Bayesian inferenceMCMCprobabilistic programming
0 likes · 7 min read

Hamiltonian Monte Carlo (HMC) is a rapid sampling technique that improves upon traditional MCMC by leveraging Hamiltonian dynamics, using position and velocity to define potential and kinetic energy, and follows a series of steps—including momentum sampling, leapfrog integration, and Metropolis acceptance—to efficiently explore complex probability distributions.
Bayesian SamplingHamiltonian Monte CarloMCMC
0 likes · 4 min read

This article explains the detailed‑balance condition for Markov chains, shows why finding a transition matrix for a given stationary distribution is hard, and demonstrates how Metropolis‑Hastings modifies MCMC to achieve higher acceptance rates with a concrete Python example.
MCMCMarkov chainMetropolis-Hastings
0 likes · 9 min read

This article introduces Monte Carlo methods, explains how random sampling approximates integrals, discusses uniform and non‑uniform probability distributions, and details acceptance‑rejection sampling as a technique for generating samples from complex distributions, laying the groundwork for understanding Markov Chain Monte Carlo in AI.
Acceptance-RejectionMCMCMonte Carlo
0 likes · 8 min read

This article explains the motivations behind Monte Carlo methods, introduces acceptance-rejection sampling, details Markov Chain Monte Carlo concepts, and walks through Metropolis-Hastings and Gibbs sampling algorithms with Python implementations, highlighting their use in high‑dimensional probability distribution sampling.
MCMCMonte CarloPython
0 likes · 18 min read

Monte Carlo methods, originally a gambling-inspired random simulation technique, provide a versatile way to approximate integrals and sums, and by using acceptance‑rejection sampling they enable drawing samples from complex probability distributions, a key step toward effective Markov Chain Monte Carlo algorithms in machine learning and AI.
Acceptance-RejectionMCMCMonte Carlo
0 likes · 7 min read

This tutorial explains how to use PyMC3 for Bayesian linear regression, covering model definition, data simulation, MAP estimation, advanced MCMC sampling with NUTS, and posterior analysis, all illustrated with complete Python code examples.
MCMCPyMC3Python
0 likes · 11 min read

This article explains Bayesian linear regression, describing its probabilistic treatment of weights, prior and posterior computation, MAP and numerical solutions, and how it enables uncertainty quantification, online learning, and model comparison through Bayes factors.
Bayesian inferenceMAP estimationMCMC
0 likes · 9 min read

The article presents a machine‑learning‑assisted harmonic mean estimator that computes Bayesian model evidence without dependence on sampling strategies, explains its theoretical basis, compares it to the original estimator, and demonstrates its accuracy on Rosenbrock and Normal‑Gamma benchmarks.
Bayesian model selectionMCMCharmonic mean estimator
0 likes · 12 min read

This article explains the core ideas and step-by-step procedures of widely used sampling methods—including inverse transform, rejection, importance, and Markov Chain Monte Carlo techniques such as Metropolis‑Hastings and Gibbs—highlighting their mathematical foundations, practical implementations, and when each method is appropriate.
Importance SamplingMCMCMonte Carlo
0 likes · 11 min read
