Read the notes, then try the practice. It adapts as you go.When you're ready.
Session Length
~17 min
Adaptive Checks
15 questions
Transfer Probes
8
Computational statistics is a branch of mathematical sciences that lies at the intersection of statistics and computer science, focusing on the design and analysis of algorithms for solving statistical problems. Rather than relying solely on closed-form analytical solutions, computational statistics leverages the power of modern computing to tackle problems that are analytically intractable, involving high-dimensional data, complex models, and large-scale inference tasks. Core techniques include resampling methods such as the bootstrap and permutation tests, Monte Carlo simulation, Markov chain Monte Carlo (MCMC) sampling, the expectation-maximization (EM) algorithm, and kernel density estimation.
The field emerged as computing power grew exponentially in the latter half of the twentieth century. Bradley Efron's introduction of the bootstrap in 1979 was a landmark moment, demonstrating that computers could replace difficult analytical derivations for estimating sampling distributions. Shortly afterward, the rediscovery and popularization of MCMC methods in the 1990s transformed Bayesian statistics from a largely theoretical pursuit into a practical tool for complex modeling. Today, computational statistics underpins machine learning, bioinformatics, econometrics, and virtually every data-intensive scientific discipline.
Modern computational statistics continues to evolve with advances in hardware and algorithmic design. Variational inference methods offer scalable alternatives to MCMC for Bayesian computation. Distributed computing frameworks enable statistical analyses on datasets too large for a single machine. The growing emphasis on reproducibility and open-source software, through tools like R and Python's scientific stack, has made sophisticated statistical computation accessible to researchers and practitioners across every domain.
One step at a time.
A resampling technique introduced by Bradley Efron in 1979 that estimates the sampling distribution of a statistic by repeatedly drawing samples with replacement from the observed data, enabling inference without strong parametric assumptions.
Example: To estimate the 95% confidence interval for a sample median, you resample your dataset with replacement 10,000 times, compute the median each time, and take the 2.5th and 97.5th percentiles of the resulting distribution.
A class of algorithms that draw samples from a probability distribution by constructing a Markov chain whose stationary distribution is the target distribution. Common variants include the Metropolis-Hastings algorithm and Gibbs sampling.
Example: When fitting a Bayesian hierarchical model to clinical trial data, MCMC generates thousands of samples from the posterior distribution of model parameters to estimate means, credible intervals, and posterior predictive distributions.
A broad class of computational methods that use repeated random sampling to obtain numerical results, typically to estimate quantities that are difficult or impossible to compute analytically.
Example: Estimating the value of pi by randomly throwing points into a unit square and computing the ratio of points falling inside the inscribed quarter-circle to the total number of points.
An iterative optimization algorithm for finding maximum likelihood estimates when data is incomplete or has latent variables. It alternates between computing expected values of the latent variables (E-step) and maximizing the likelihood given those expectations (M-step).
Example: Fitting a Gaussian mixture model to customer spending data where cluster membership is unknown: the E-step assigns soft probabilities of cluster membership, and the M-step updates the mean and variance of each cluster.
A non-parametric method for estimating the probability density function of a random variable by placing a smooth kernel function at each data point and summing the contributions, with a bandwidth parameter controlling the degree of smoothing.
Example: Visualizing the distribution of earthquake magnitudes without assuming any particular parametric form by placing a Gaussian kernel centered on each observed magnitude and summing them.
A non-parametric hypothesis test that determines the p-value by computing the test statistic for every possible (or a large random subset of) reassignment of observations to groups, providing an exact or approximate test without distributional assumptions.
Example: Testing whether a new drug has a different effect than a placebo by randomly reassigning patient outcomes between treatment and control groups 100,000 times and computing the fraction of reassignments that produce a difference as large as the observed one.
A model assessment technique that partitions data into complementary subsets, using one subset for training and the other for validation, then rotating the partition to reduce bias in performance estimation. K-fold cross-validation is the most common variant.
Example: Selecting the best regularization parameter for a regression model by splitting the data into 10 folds, fitting the model on 9 folds, evaluating on the held-out fold, and averaging the prediction error across all 10 iterations.
A specific MCMC algorithm that generates samples from a multivariate distribution by iteratively sampling each variable from its conditional distribution given the current values of all other variables.
Example: In a Bayesian linear regression with a normal-inverse-gamma prior, Gibbs sampling alternates between drawing the regression coefficients conditional on the variance and drawing the variance conditional on the coefficients.
More terms are available in the glossary.
Choose a different way to engage with this topic — no grading, just richer thinking.
Explore your way — choose one:
See how the key ideas connect. Nodes color in as you practice.
Walk through a solved problem step-by-step. Try predicting each step before revealing it.
This is guided practice, not just a quiz. Hints and pacing adjust in real time.
Small steps add up.
What you get while practicing:
The best way to know if you understand something: explain it in your own words.
More ways to strengthen what you just learned.