Bayesian methods
What Are Bayesian Methods?
Bayesian methods are statistical and computational techniques that apply Bayes' theorem to inference, estimation, and decision-making. They treat all unknown quantities as probability distributions rather than fixed values, enabling the systematic combination of prior knowledge with evidence from observed data to produce a posterior distribution over quantities of interest. The term covers a broad class of approaches unified by this probabilistic treatment of uncertainty, ranging from simple conjugate models to complex hierarchical structures computed via simulation.
The conceptual roots of the framework lie in the 18th-century work of Thomas Bayes and Pierre-Simon Laplace, though widespread practical use became feasible only after efficient computational algorithms emerged in the late 20th century. Bayesian methods now occupy a central role in machine learning, signal processing, statistics, and engineering, alongside frequentist approaches that treat unknown parameters as fixed but unknown constants.
The Bayesian Update Cycle
The core operation in any Bayesian method is the update from prior to posterior. A prior distribution summarizes what is known about a parameter before observations are collected. The likelihood function scores how probable the observed data are under each candidate parameter value. Multiplying prior by likelihood and normalizing yields the posterior distribution, which concentrates probability where both the prior and the data agree. When models are conjugate, this calculation is algebraic; for most practical models, numerical approximation is required. This foundational process is described in detail in introductory treatments from probability theory curricula.
Approximate Inference Techniques
The posterior is rarely available in closed form. Markov Chain Monte Carlo (MCMC) methods, including the Metropolis-Hastings and Hamiltonian Monte Carlo algorithms, draw samples from the posterior by simulating a Markov chain that converges to the target distribution. Variational inference reframes the problem as optimization: a parameterized family of simpler distributions is fitted to the true posterior by minimizing the Kullback-Leibler divergence between them. Sequential Monte Carlo (particle filtering) extends these ideas to dynamic settings where parameters or states evolve over time. Each technique involves tradeoffs among computational cost, sample quality, and scalability to high-dimensional problems. A thorough treatment of these computational methods appears in the Bayesian models for machine learning course notes from Columbia University.
Model Comparison and Selection
Bayesian methods provide a natural framework for comparing models of different complexity without separate cross-validation procedures. The Bayesian model evidence (also called the marginal likelihood) integrates the likelihood over the prior distribution of parameters, automatically penalizing overly complex models that spread probability mass too broadly. Ratios of model evidences, called Bayes factors, offer a calibrated comparison between competing hypotheses. Bayesian information criteria provide a computationally lighter approximation to model evidence and are widely used in applied work. The PMC review on Bayesian analysis in developmental research illustrates how these tools apply in empirical sciences.
Applications
Bayesian methods have applications in a wide range of fields, including:
- Autonomous systems and robotics, through Bayesian filtering for localization and tracking
- Medical imaging and clinical trial design
- Natural language processing, including topic modeling and language model calibration
- Structural reliability and engineering design under uncertainty
- Anomaly detection and fault diagnosis in industrial monitoring
- Financial risk modeling and portfolio optimization