liveBook · Manning

Target distribution

As explained in Fabulous Adventures in Data Structures and Algorithms

A target distribution is the probability distribution that a sampling procedure is intended to reproduce.

A target distribution is the probability distribution a sampling procedure aims to reproduce. It specifies what the generated samples should represent, even when the procedure reaches it indirectly. section 16.6 section 15.6

Different sampling routes use different information about the target:

  • A known quantile function transforms a standard uniform sample directly into a target-distributed sample. section 15.6
  • A PDF can support rejection sampling through a helper distribution, although finding a suitable helper and avoiding repeated rejection can be difficult. section 15.6
  • The Metropolis algorithm uses information about high-weight regions to construct a Markov process whose states sample the target distribution. section 16.6

Updating uncertainty

A prior distribution captures beliefs before observations; combining it with a likelihood function produces a posterior distribution that updates uncertainty. That posterior can serve as the target for continuous sampling. section 16.6

How Fabulous Adventures in Data Structures and Algorithms covers it

How deep it goes
Treats targets operationally through quantile inversion, rejection acceptance, and Metropolis chains.
Examples
Uses standard uniform, continuous uniform, normal, and posterior distributions as sampling contexts.
What it assumes
Assumes probability-distribution vocabulary and access to a PDF, quantile function, or related distribution information.
What you can do after
Apply it via quantile functions, rejection sampling, or the Metropolis algorithm to generate samples from a desired distribution.
How it connects
Connects target distributions to PDFs, CDFs, quantile functions, rejection sampling, Markov processes, and posterior distributions.

Also explained in

Compare how 2 books explain target distribution →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Fabulous Adventures in Data Structures and Algorithms. The section links point to the parts of the book it draws on.