liveBook · Manning

Binary random variable

As explained in Timeless Algorithms, The Foundational Ideas

A Bernoulli random variable has two possible values, conventionally 0 and 1.

A binary (Bernoulli) random variable takes exactly two values, conventionally 1 and 0. In binary classification, 1 denotes the positive class and 0 the negative class. If the probability of 1 is p, the probability of 0 is 1−p. section 3.3.2 section 11.4.2

P(Yi=yi)=pi yi(1-pi) 1-yi

For an observed binary outcome yᵢ and predicted probability pᵢ, this expression gives the probability assigned to that outcome. section 3.3.2

For independent observations, multiply their individual outcome probabilities to obtain the likelihood of the data. In classification, maximizing this likelihood is equivalent to minimizing binary cross-entropy. section 3.3.2 section 11.4.2

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines the two outcomes and their probability form, then uses independence to construct a data likelihood.
Examples
Distinguishes positive-class outcome 1 from negative-class outcome 0.
What you can do after
Evaluate how a predicted probability assigns likelihood to an observed binary outcome.
How it connects
Connects Bernoulli outcomes to logistic regression, maximum likelihood, and binary cross-entropy.

Also explained in

Compare how 5 books explain binary random variable →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.