Bayesian Signal Updating
An interactive app for Bayesian belief updating with binary signals
Bayesian Signal Updating
A small interactive page for exploring Bayesian belief updating with a binary state, a noisy binary signal, and live posterior calculations.
Signal structure
| Signal \(s=1\) | Signal \(s=0\) | |
|---|---|---|
| True state \( \theta=1 \) (passed) | \(1-\alpha\) | \(\alpha\) |
| True state \( \theta=0 \) (failed) | \(\beta\) | \(1-\beta\) |
Controls
Setup
The environment is characterized by a binary outcome, corresponding to whether the decision-maker passes or fails the exam. Formally, the state is \( \theta \in \{0,1\} \), where \( \theta=1 \) means “passed” and \( \theta=0 \) means “failed.” The prior probability of passing is denoted by \( \pi_0 = \mathbb{P}(\theta=1) \), with \( \pi_0 \in (0,1) \).
Before making a decision, the decision-maker receives a binary signal \( s \in \{0,1\} \). We interpret \( s=1 \) as a signal in favor of passing, and \( s=0 \) as a signal in favor of failing. The signal is noisy rather than perfectly revealing, with likelihoods
where \( \alpha,\beta\in[0,1] \) are the false-negative and false-positive rates, respectively.
Posterior beliefs
By Bayes’ rule, the posterior probability of passing after signal \( s=1 \) is
Similarly, the posterior probability of passing after signal \( s=0 \) is
Use the sliders to see how the prior \( \pi_0 \), the false-negative rate \( \alpha \), and the false-positive rate \( \beta \) jointly determine posterior beliefs. In particular, a more accurate signal corresponds to lower values of both \( \alpha \) and \( \beta \).