Logistic regression

In statistics, a logistic model (or logit model) is a statistical model that models the log-odds of an event as a linear combination of one or more independent variables. In regression analysis, logistic regression^[1] (or logit regression) estimates the parameters of a logistic model (the coefficients in the linear or non linear combinations). In binary logistic regression there is a single binary dependent variable, coded by an indicator variable, where the two values are labeled "0" and "1", while the independent variables can each be a binary variable (two classes, coded by an indicator variable) or a continuous variable (any real value). The corresponding probability of the value labeled "1" can vary between 0 (certainly the value "0") and 1 (certainly the value "1"), hence the labeling;^[2] the function that converts log-odds to probability is the logistic function, hence the name. The unit of measurement for the log-odds scale is called a logit, from logistic unit, hence the alternative names. See § Background and § Definition for formal mathematics, and § Example for a worked example.

Binary variables are widely used in statistics to model the probability of a certain class or event taking place, such as the probability of a team winning, of a patient being healthy, etc. (see § Applications), and the logistic model has been the most commonly used model for binary regression since about 1970.^[3] Binary variables can be generalized to categorical variables when there are more than two possible values (e.g. whether an image is of a cat, dog, lion, etc.), and the binary logistic regression generalized to multinomial logistic regression. If the multiple categories are ordered, one can use the ordinal logistic regression (for example the proportional odds ordinal logistic model^[4]). See § Extensions for further extensions. The logistic regression model itself simply models probability of output in terms of input and does not perform statistical classification (it is not a classifier), though it can be used to make a classifier, for instance by choosing a cutoff value and classifying inputs with probability greater than the cutoff as one class, below the cutoff as the other; this is a common way to make a binary classifier.

Analogous linear models for binary variables with a different sigmoid function instead of the logistic function (to convert the linear combination to a probability) can also be used, most notably the probit model; see § Alternatives. The defining characteristic of the logistic model is that increasing one of the independent variables multiplicatively scales the odds of the given outcome at a constant rate, with each independent variable having its own parameter; for a binary dependent variable this generalizes the odds ratio. More abstractly, the logistic function is the natural parameter for the Bernoulli distribution, and in this sense is the "simplest" way to convert a real number to a probability.

The parameters of a logistic regression are most commonly estimated by maximum-likelihood estimation (MLE). This does not have a closed-form expression, unlike linear least squares; see § Model fitting. Logistic regression by MLE plays a similarly basic role for binary or categorical responses as linear regression by ordinary least squares (OLS) plays for scalar responses: it is a simple, well-analyzed baseline model; see § Comparison with linear regression for discussion. The logistic regression as a general statistical model was originally developed and popularized primarily by Joseph Berkson,^[5] beginning in Berkson (1944), where he coined "logit"; see § History.

Logistic regression is used in various fields, including machine learning, most medical fields, and social sciences. For example, the Trauma and Injury Severity Score (TRISS), which is widely used to predict mortality in injured patients, was originally developed by Boyd et al. using logistic regression.^[6] Many other medical scales used to assess severity of a patient have been developed using logistic regression.^{[7][8][9][10]} Logistic regression may be used to predict the risk of developing a given disease (e.g. diabetes; coronary heart disease), based on observed characteristics of the patient (age, sex, body mass index, results of various blood tests, etc.).^[11][12] Another example might be to predict whether a Nepalese voter will vote Nepali Congress or Communist Party of Nepal or for any other party, based on age, income, sex, race, state of residence, votes in previous elections, etc.^[13] The technique can also be used in engineering, especially for predicting the probability of failure of a given process, system or product.^[14][15] It is also used in marketing applications such as prediction of a customer's propensity to purchase a product or halt a subscription, etc.^[16] In economics, it can be used to predict the likelihood of a person ending up in the labor force, and a business application would be to predict the likelihood of a homeowner defaulting on a mortgage. Conditional random fields, an extension of logistic regression to sequential data, are used in natural language processing. Disaster planners and engineers rely on these models to predict decisions taken by householders or building occupants in small-scale and large-scales evacuations, such as building fires, wildfires, hurricanes among others.^[17][18][19] These models help in the development of reliable disaster managing plans and safer design for the built environment.

Logistic regression is a supervised machine learning algorithm widely used for binary classification tasks, such as identifying whether an email is spam or not and diagnosing diseases by assessing the presence or absence of specific conditions based on patient test results. This approach utilizes the logistic (or sigmoid) function to transform a linear combination of input features into a probability value ranging between 0 and 1. This probability indicates the likelihood that a given input corresponds to one of two predefined categories. The essential mechanism of logistic regression is grounded in the logistic function's ability to model the probability of binary outcomes accurately. With its distinctive S-shaped curve, the logistic function effectively maps any real-valued number to a value within the 0 to 1 interval. This feature renders it particularly suitable for binary classification tasks, such as sorting emails into "spam" or "not spam". By calculating the probability that the dependent variable will be categorized into a specific group, logistic regression provides a probabilistic framework that supports informed decision-making.^[20]

As a simple example, we can use a logistic regression with one explanatory variable and two categories to answer the following question:

A group of 20 students spends between 0 and 6 hours studying for an exam. How does the number of hours spent studying affect the probability of the student passing the exam?

The reason for using logistic regression for this problem is that the values of the dependent variable, pass and fail, while represented by "1" and "0", are not cardinal numbers. If the problem was changed so that pass/fail was replaced with the grade 0–100 (cardinal numbers), then simple regression analysis could be used.

The table shows the number of hours each student spent studying, and whether they passed (1) or failed (0).

Hours (xk)	0.50	0.75	1.00	1.25	1.50	1.75	1.75	2.00	2.25	2.50	2.75	3.00	3.25	3.50	4.00	4.25	4.50	4.75	5.00	5.50
Pass (yk)	0	0	0	0	0	0	1	0	1	0	1	0	1	0	1	1	1	1	1	1

We wish to fit a logistic function to the data consisting of the hours studied (x_k) and the outcome of the test (y_k =1 for pass, 0 for fail). The data points are indexed by the subscript k which runs from k = 1 {\displaystyle k=1} to k = K = 20 {\displaystyle k=K=20} . The x variable is called the "explanatory variable", and the y variable is called the "categorical variable" consisting of two categories: "pass" or "fail" corresponding to the categorical values 1 and 0 respectively.

The logistic function is of the form:

p ( x ) = 1 1 + e − ( x − μ ) / s {\displaystyle p(x)={\frac {1}{1+e^{-(x-\mu )/s}}}}

where μ is a location parameter (the midpoint of the curve, where p ( μ ) = 1 / 2 {\displaystyle p(\mu )=1/2} ) and s is a scale parameter. This expression may be rewritten as:

p ( x ) = 1 1 + e − ( β 0 + β 1 x ) {\displaystyle p(x)={\frac {1}{1+e^{-(\beta _{0}+\beta _{1}x)}}}}

where β 0 = − μ / s {\displaystyle \beta _{0}=-\mu /s} and is known as the intercept (it is the vertical intercept or y-intercept of the line y = β 0 + β 1 x {\displaystyle y=\beta _{0}+\beta _{1}x} ), and β 1 = 1 / s {\displaystyle \beta _{1}=1/s} (inverse scale parameter or rate parameter): these are the y-intercept and slope of the log-odds as a function of x. Conversely, μ = − β 0 / β 1 {\displaystyle \mu =-\beta _{0}/\beta _{1}} and s = 1 / β 1 {\displaystyle s=1/\beta _{1}} .

Note that this model is actually an oversimplification, as it implies that every student will pass if they study indefinitely (limit = 1).

The usual measure of goodness of fit for a logistic regression uses logistic loss (or log loss), the negative log-likelihood. For a given x_k and y_k, write p k = p ( x k ) {\displaystyle p_{k}=p(x_{k})} . The ⁠ p k {\displaystyle p_{k}} ⁠ are the probabilities that the corresponding ⁠ y k {\displaystyle y_{k}} ⁠ will equal one, and ⁠ 1 − p k {\displaystyle 1-p_{k}} ⁠ are the probabilities that they will be zero (see Bernoulli distribution). We wish to find the values of ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠ which give the "best fit" to the data. For comparison of a "best fit" to the data, see the case of linear regression. There, the sum of the squared deviations of the fit from the data points (y_k), the squared error loss, is taken as a measure of the goodness of fit, and the best fit is obtained when this loss is minimized.

The log loss for the k-th point ⁠ ℓ k {\displaystyle \ell _{k}} ⁠ is:

ℓ k = { − ln ⁡ p k  if  y k = 1 , − ln ⁡ ( 1 − p k )  if  y k = 0. {\displaystyle \ell _{k}={\begin{cases}-\ln p_{k}&{\text{ if }}y_{k}=1,\\-\ln(1-p_{k})&{\text{ if }}y_{k}=0.\end{cases}}}

The log loss can be interpreted as the "surprisal" of the actual outcome ⁠ y k {\displaystyle y_{k}} ⁠ relative to the prediction ⁠ p k {\displaystyle p_{k}} ⁠, and is a measure of information content. Log loss is always greater than or equal to 0, equals 0 only in case of a perfect prediction (i.e., when p k = 1 {\displaystyle p_{k}=1} and y k = 1 {\displaystyle y_{k}=1} , or p k = 0 {\displaystyle p_{k}=0} and y k = 0 {\displaystyle y_{k}=0} ), and approaches infinity as the prediction gets worse (i.e., when y k = 1 {\displaystyle y_{k}=1} and p k → 0 {\displaystyle p_{k}\to 0} or y k = 0 {\displaystyle y_{k}=0} and p k → 1 {\displaystyle p_{k}\to 1} ), meaning the actual outcome is "more surprising". Since the value of the logistic function is always strictly between zero and one, the log loss is always greater than zero and less than infinity. Unlike in a linear regression, where the model can have zero loss at a point by passing through a data point (and zero loss overall if all points are on a line), in a logistic regression it is not possible to have zero loss at any points, since ⁠ y k {\displaystyle y_{k}} ⁠ is either 0 or 1, but ⁠ 0 < p k < 1 {\displaystyle 0<p_{k}<1} ⁠.

These can be combined into a single expression:

ℓ k = − y k ln ⁡ p k − ( 1 − y k ) ln ⁡ ( 1 − p k ) . {\displaystyle \ell _{k}=-y_{k}\ln p_{k}-(1-y_{k})\ln(1-p_{k}).}

This expression is more formally known as the cross-entropy of the predicted distribution ( p k , ( 1 − p k ) ) {\displaystyle {\big (}p_{k},(1-p_{k}){\big )}} from the actual distribution ( y k , ( 1 − y k ) ) {\displaystyle {\big (}y_{k},(1-y_{k}){\big )}} , as probability distributions on the two-element space of (pass, fail).

The sum of these, the total loss, is the overall negative log-likelihood ⁠ − ℓ {\displaystyle -\ell } ⁠, and the best fit is obtained for those choices of ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠ for which ⁠ − ℓ {\displaystyle -\ell } ⁠ is minimized.

Alternatively, instead of minimizing the loss, one can maximize its inverse, the (positive) log-likelihood:

ℓ = ∑ k : y k = 1 ln ⁡ ( p k ) + ∑ k : y k = 0 ln ⁡ ( 1 − p k ) = ∑ k = 1 K ( y k ln ⁡ ( p k ) + ( 1 − y k ) ln ⁡ ( 1 − p k ) ) {\displaystyle \ell =\sum _{k:y_{k}=1}\ln(p_{k})+\sum _{k:y_{k}=0}\ln(1-p_{k})=\sum _{k=1}^{K}\left(\,y_{k}\ln(p_{k})+(1-y_{k})\ln(1-p_{k})\right)}

or equivalently maximize the likelihood function itself, which is the probability that the given data set is produced by a particular logistic function:

L = ∏ k : y k = 1 p k ∏ k : y k = 0 ( 1 − p k ) {\displaystyle L=\prod _{k:y_{k}=1}p_{k}\,\prod _{k:y_{k}=0}(1-p_{k})}

This method is known as maximum likelihood estimation.

Since ℓ is nonlinear in ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠, determining their optimum values will require numerical methods. One method of maximizing ℓ is to require the derivatives of ℓ with respect to ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠ to be zero:

0 = ∂ ℓ ∂ β 0 = ∑ k = 1 K ( y k − p k ) {\displaystyle 0={\frac {\partial \ell }{\partial \beta _{0}}}=\sum _{k=1}^{K}(y_{k}-p_{k})}

0 = ∂ ℓ ∂ β 1 = ∑ k = 1 K ( y k − p k ) x k {\displaystyle 0={\frac {\partial \ell }{\partial \beta _{1}}}=\sum _{k=1}^{K}(y_{k}-p_{k})x_{k}}

and the maximization procedure can be accomplished by solving the above two equations for ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠, which, again, will generally require the use of numerical methods.

The values of ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠ which maximize ℓ and L using the above data are found to be:

β 0 ≈ − 4.1 {\displaystyle \beta _{0}\approx -4.1}

β 1 ≈ 1.5 {\displaystyle \beta _{1}\approx 1.5}

which yields a value for μ and s of:

μ = − β 0 / β 1 ≈ 2.7 {\displaystyle \mu =-\beta _{0}/\beta _{1}\approx 2.7}

s = 1 / β 1 ≈ 0.67 {\displaystyle s=1/\beta _{1}\approx 0.67}

The ⁠ β 0 {\displaystyle \beta _{0}} ⁠ and ⁠ β 1 {\displaystyle \beta _{1}} ⁠ coefficients may be entered into the logistic regression equation to estimate the probability of passing the exam.

For example, for a student who studies 2 hours, entering the value x = 2 {\displaystyle x=2} into the equation gives the estimated probability of passing the exam of 0.25:

t = β 0 + 2 β 1 ≈ − 4.1 + 2 ⋅ 1.5 = − 1.1 {\displaystyle t=\beta _{0}+2\beta _{1}\approx -4.1+2\cdot 1.5=-1.1}

p = 1 1 + e − t ≈ 0.25 = Probability of passing exam {\displaystyle p={\frac {1}{1+e^{-t}}}\approx 0.25={\text{Probability of passing exam}}}

Similarly, for a student who studies 4 hours, the estimated probability of passing the exam is 0.87:

t = β 0 + 4 β 1 ≈ − 4.1 + 4 ⋅ 1.5 = 1.9 {\displaystyle t=\beta _{0}+4\beta _{1}\approx -4.1+4\cdot 1.5=1.9}

p = 1 1 + e − t ≈ 0.87 = Probability of passing exam {\displaystyle p={\frac {1}{1+e^{-t}}}\approx 0.87={\text{Probability of passing exam}}}

This table shows the estimated probability of passing the exam for several values of hours studying.

Hours of study (x)	Passing exam
	Log-odds (t)	Odds (et)	Probability (p)
1	−2.57	0.076 ≈ 1:13.1	0.07
2	−1.07	0.34 ≈ 1:2.91	0.26
⁠ μ ≈ 2.7 {\displaystyle \mu \approx 2.7} ⁠	0	1	⁠1/2⁠ = 0.50
3	0.44	1.55	0.61
4	1.94	6.96	0.87
5	3.45	31.4	0.97

The logistic regression analysis gives the following output.

	Coefficient	Std. Error	z-value	p-value (Wald)
Intercept (β0)	−4.1	1.8	−2.3	0.021
Hours (β1)	1.5	0.9	1.7	0.017

By the Wald test, the output indicates that hours studying is significantly associated with the probability of passing the exam ( p = 0.017 {\displaystyle p=0.017} ). Rather than the Wald method, the recommended method^[21] to calculate the p-value for logistic regression is the likelihood-ratio test (LRT), which for these data give p ≈ 0.00064 {\displaystyle p\approx 0.00064} (see § Deviance and likelihood ratio tests below).

This simple model is an example of binary logistic regression, and has one explanatory variable and a binary categorical variable which can assume one of two categorical values. Multinomial logistic regression is the generalization of binary logistic regression to include any number of explanatory variables and any number of categories.

An explanation of logistic regression can begin with an explanation of the standard logistic function. The logistic function is a sigmoid function, which takes any real input t {\displaystyle t} , and outputs a value between zero and one.^[2] For the logit, this is interpreted as taking input log-odds and having output probability. The standard logistic function σ : R → ( 0 , 1 ) {\displaystyle \sigma :\mathbb {R} \rightarrow (0,1)} is defined as follows:

σ ( t ) = e t e t + 1 = 1 1 + e − t {\displaystyle \sigma (t)={\frac {e^{t}}{e^{t}+1}}={\frac {1}{1+e^{-t}}}}

A graph of the logistic function on the t-interval (−6,6) is shown in Figure 1.

Let us assume that t {\displaystyle t} is a linear function of a single explanatory variable x {\displaystyle x} (the case where t {\displaystyle t} is a linear combination of multiple explanatory variables is treated similarly). We can then express t {\displaystyle t} as follows:

t = β 0 + β 1 x {\displaystyle t=\beta _{0}+\beta _{1}x}

And the general logistic function p : R → ( 0 , 1 ) {\displaystyle p:\mathbb {R} \rightarrow (0,1)} can now be written as:

p ( x ) = σ ( t ) = 1 1 + e − ( β 0 + β 1 x ) {\displaystyle p(x)=\sigma (t)={\frac {1}{1+e^{-(\beta _{0}+\beta _{1}x)}}}}

In the logistic model, p ( x ) {\displaystyle p(x)} is interpreted as the probability of the dependent variable Y {\displaystyle Y} equaling a success/case rather than a failure/non-case. It is clear that the response variables Y i {\displaystyle Y_{i}} are not identically distributed: P ( Y i = 1 ∣ X ) {\displaystyle P(Y_{i}=1\mid X)} differs from one data point X i {\displaystyle X_{i}} to another, though they are independent given design matrix X {\displaystyle X} and shared parameters β {\displaystyle \beta } .^[11]

We can now define the logit (log odds) function as the inverse g = σ − 1 {\displaystyle g=\sigma ^{-1}} of the standard logistic function. It is easy to see that it satisfies:

g ( p ( x ) ) = σ − 1 ( p ( x ) ) = logit ⁡ p ( x ) = ln ⁡ ( p ( x ) 1 − p ( x ) ) = β 0 + β 1 x , {\displaystyle g(p(x))=\sigma ^{-1}(p(x))=\operatorname {logit} p(x)=\ln \left({\frac {p(x)}{1-p(x)}}\right)=\beta _{0}+\beta _{1}x,}

and equivalently, after exponentiating both sides we have the odds:

p ( x ) 1 − p ( x ) = e β 0 + β 1 x . {\displaystyle {\frac {p(x)}{1-p(x)}}=e^{\beta _{0}+\beta _{1}x}.}

In the above equations, the terms are as follows:

• g {\displaystyle g} is the logit function. The equation for g ( p ( x ) ) {\displaystyle g(p(x))} illustrates that the logit (i.e., log-odds or natural logarithm of the odds) is equivalent to the linear regression expression.
• ln {\displaystyle \ln } denotes the natural logarithm.
• p ( x ) {\displaystyle p(x)} is the probability that the dependent variable equals a case, given some linear combination of the predictors. The formula for p ( x ) {\displaystyle p(x)} illustrates that the probability of the dependent variable equaling a case is equal to the value of the logistic function of the linear regression expression. This is important in that it shows that the value of the linear regression expression can vary from negative to positive infinity and yet, after transformation, the resulting expression for the probability p ( x ) {\displaystyle p(x)} ranges between 0 and 1.
• β 0 {\displaystyle \beta _{0}} is the intercept from the linear regression equation (the value of the criterion when the predictor is equal to zero).
• β 1 x {\displaystyle \beta _{1}x} is the regression coefficient multiplied by some value of the predictor.
• base e {\displaystyle e} denotes the exponential function.

The odds of the dependent variable equaling a case (given some linear combination x {\displaystyle x} of the predictors) is equivalent to the exponential function of the linear regression expression. This illustrates how the logit serves as a link function between the probability and the linear regression expression. Given that the logit ranges between negative and positive infinity, it provides an adequate criterion upon which to conduct linear regression and the logit is easily converted back into the odds.^[2]

So we define odds of the dependent variable equaling a case (given some linear combination x {\displaystyle x} of the predictors) as follows:

odds = e β 0 + β 1 x . {\displaystyle {\text{odds}}=e^{\beta _{0}+\beta _{1}x}.}

For a continuous independent variable the odds ratio can be defined as:

O R = odds ⁡ ( x + 1 ) odds ⁡ ( x ) = ( p ( x + 1 ) 1 − p ( x + 1 ) ) ( p ( x ) 1 − p ( x ) ) = e β 0 + β 1 ( x + 1 ) e β 0 + β 1 x = e β 1 {\displaystyle \mathrm {OR} ={\frac {\operatorname {odds} (x+1)}{\operatorname {odds} (x)}}={\frac {\left({\frac {p(x+1)}{1-p(x+1)}}\right)}{\left({\frac {p(x)}{1-p(x)}}\right)}}={\frac {e^{\beta _{0}+\beta _{1}(x+1)}}{e^{\beta _{0}+\beta _{1}x}}}=e^{\beta _{1}}}

This exponential relationship provides an interpretation for β 1 {\displaystyle \beta _{1}} : The odds multiply by e β 1 {\displaystyle e^{\beta _{1}}} for every 1-unit increase in x.^[22]

For a binary independent variable the odds ratio is defined as a d b c {\displaystyle {\frac {ad}{bc}}} where a, b, c and d are cells in a 2×2 contingency table.^[23]

If there are multiple explanatory variables, the above expression β 0 + β 1 x {\displaystyle \beta _{0}+\beta _{1}x} can be revised to β 0 + β 1 x 1 + β 2 x 2 + ⋯ + β m x m = β 0 + ∑ i = 1 m β i x i {\displaystyle \beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2}+\cdots +\beta _{m}x_{m}=\beta _{0}+\sum _{i=1}^{m}\beta _{i}x_{i}} . Then when this is used in the equation relating the log odds of a success to the values of the predictors, the linear regression will be a multiple regression with m explanators; the parameters β i {\displaystyle \beta _{i}} for all i = 0 , 1 , 2 , … , m {\displaystyle i=0,1,2,\dots ,m} are all estimated.

Again, the more traditional equations are:

log ⁡ p 1 − p = β 0 + β 1 x 1 + β 2 x 2 + ⋯ + β m x m {\displaystyle \log {\frac {p}{1-p}}=\beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2}+\cdots +\beta _{m}x_{m}}

and

p = 1 1 + b − ( β 0 + β 1 x 1 + β 2 x 2 + ⋯ + β m x m ) {\displaystyle p={\frac {1}{1+b^{-(\beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2}+\cdots +\beta _{m}x_{m})}}}}

where usually b = e {\displaystyle b=e} .

A dataset contains N points. Each point i consists of a set of m input variables x_1,i ... x_m,i (also called independent variables, explanatory variables, predictor variables, features, or attributes), and a binary outcome variable Y_i (also known as a dependent variable, response variable, output variable, or class), i.e. it can assume only the two possible values 0 (often meaning "no" or "failure") or 1 (often meaning "yes" or "success"). The goal of logistic regression is to use the dataset to create a predictive model of the outcome variable.

As in linear regression, the outcome variables Y_i are assumed to depend on the explanatory variables x_1,i ... x_m,i.

Explanatory variables

The explanatory variables may be of any type: real-valued, binary, categorical, etc. The main distinction is between continuous variables and discrete variables.

(Discrete variables referring to more than two possible choices are typically coded using dummy variables (or indicator variables), that is, separate explanatory variables taking the value 0 or 1 are created for each possible value of the discrete variable, with a 1 meaning "variable does have the given value" and a 0 meaning "variable does not have that value".)

Outcome variables

Formally, the outcomes Y_i are described as being Bernoulli-distributed data, where each outcome is determined by an unobserved probability p_i that is specific to the outcome at hand, but related to the explanatory variables. This can be expressed in any of the following equivalent forms:

Y i ∣ x 1 , i , … , x m , i   ∼ Bernoulli ⁡ ( p i ) E ⁡ [ Y i ∣ x 1 , i , … , x m , i ] = p i Pr ( Y i = y ∣ x 1 , i , … , x m , i ) = { p i if  y = 1 1 − p i if  y = 0 Pr ( Y i = y ∣ x 1 , i , … , x m , i ) = p i y ( 1 − p i ) ( 1 − y ) {\displaystyle {\begin{aligned}Y_{i}\mid x_{1,i},\ldots ,x_{m,i}\ &\sim \operatorname {Bernoulli} (p_{i})\\[5pt]\operatorname {\mathbb {E} } [Y_{i}\mid x_{1,i},\ldots ,x_{m,i}]&=p_{i}\\[5pt]\Pr(Y_{i}=y\mid x_{1,i},\ldots ,x_{m,i})&={\begin{cases}p_{i}&{\text{if }}y=1\\1-p_{i}&{\text{if }}y=0\end{cases}}\\[5pt]\Pr(Y_{i}=y\mid x_{1,i},\ldots ,x_{m,i})&=p_{i}^{y}(1-p_{i})^{(1-y)}\end{aligned}}}

The meanings of these four lines are:

1. The first line expresses the probability distribution of each Y_i : conditioned on the explanatory variables, it follows a Bernoulli distribution with parameters p_i, the probability of the outcome of 1 for trial i. As noted above, each separate trial has its own probability of success, just as each trial has its own explanatory variables. The probability of success p_i is not observed, only the outcome of an individual Bernoulli trial using that probability.
2. The second line expresses the fact that the expected value of each Y_i is equal to the probability of success p_i, which is a general property of the Bernoulli distribution. In other words, if we run a large number of Bernoulli trials using the same probability of success p_i, then take the average of all the 1 and 0 outcomes, then the result would be close to p_i. This is because doing an average this way simply computes the proportion of successes seen, which we expect to converge to the underlying probability of success.
3. The third line writes out the probability mass function of the Bernoulli distribution, specifying the probability of seeing each of the two possible outcomes.
4. The fourth line is another way of writing the probability mass function, which avoids having to write separate cases and is more convenient for certain types of calculations. This relies on the fact that Y_i can take only the value 0 or 1. In each case, one of the exponents will be 1, "choosing" the value under it, while the other is 0, "canceling out" the value under it. Hence, the outcome is either p_i or 1 − p_i, as in the previous line.

Linear predictor function

The basic idea of logistic regression is to use the mechanism already developed for linear regression by modeling the probability p_i using a linear predictor function, i.e. a linear combination of the explanatory variables and a set of regression coefficients that are specific to the model at hand but the same for all trials. The linear predictor function f ( i ) {\displaystyle f(i)} for a particular data point i is written as:

f ( i ) = β 0 + β 1 x 1 , i + ⋯ + β m x m , i , {\displaystyle f(i)=\beta _{0}+\beta _{1}x_{1,i}+\cdots +\beta _{m}x_{m,i},}

where β 0 , … , β m {\displaystyle \beta _{0},\ldots ,\beta _{m}} are regression coefficients indicating the relative effect of a particular explanatory variable on the outcome.

The model is usually put into a more compact form as follows:

• The regression coefficients β₀, β₁, ..., β_m are grouped into a single vector β of size m + 1.
• For each data point i, an additional explanatory pseudo-variable x_0,i is added, with a fixed value of 1, corresponding to the intercept coefficient β₀.
• The resulting explanatory variables x_0,i, x_1,i, ..., x_m,i are then grouped into a single vector X_i of size m + 1.

This makes it possible to write the linear predictor function as follows:

f ( i ) = β ⋅ X i , {\displaystyle f(i)={\boldsymbol {\beta }}\cdot \mathbf {X} _{i},}

using the notation for a dot product between two vectors.

The above example of binary logistic regression on one explanatory variable can be generalized to binary logistic regression on any number of explanatory variables x₁, x₂,... and any number of categorical values y = 0 , 1 , 2 , … {\displaystyle y=0,1,2,\dots } .

To begin with, we may consider a logistic model with M explanatory variables, x₁, x₂ ... x_M and, as in the example above, two categorical values (y = 0 and 1). For the simple binary logistic regression model, we assumed a linear relationship between the predictor variable and the log-odds (also called logit) of the event that y = 1 {\displaystyle y=1} . This linear relationship may be extended to the case of M explanatory variables:

t = log b ⁡ p 1 − p = β 0 + β 1 x 1 + β 2 x 2 + ⋯ + β M x M {\displaystyle t=\log _{b}{\frac {p}{1-p}}=\beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2}+\cdots +\beta _{M}x_{M}}

where t is the log-odds and β i {\displaystyle \beta _{i}} are parameters of the model. An additional generalization has been introduced in which the base of the model (b) is not restricted to Euler's number e. In most applications, the base b {\displaystyle b} of the logarithm is usually taken to be e. However, in some cases it can be easier to communicate results by working in base 2 or base 10.

For a more compact notation, we will specify the explanatory variables and the β coefficients as ⁠ ( M + 1 ) {\displaystyle (M+1)} ⁠-dimensional vectors:

x = { x 0 , x 1 , x 2 , … , x M } {\displaystyle {\boldsymbol {x}}=\{x_{0},x_{1},x_{2},\dots ,x_{M}\}}

β = { β 0 , β 1 , β 2 , … , β M } {\displaystyle {\boldsymbol {\beta }}=\{\beta _{0},\beta _{1},\beta _{2},\dots ,\beta _{M}\}}

with an added explanatory variable x₀ =1. The logit may now be written as:

t = ∑ m = 0 M β m x m = β ⋅ x {\displaystyle t=\sum _{m=0}^{M}\beta _{m}x_{m}={\boldsymbol {\beta }}\cdot x}

Solving for the probability p that y = 1 {\displaystyle y=1} yields:

p ( x ) = b β ⋅ x 1 + b β ⋅ x = 1 1 + b − β ⋅ x = S b ( t ) {\displaystyle p({\boldsymbol {x}})={\frac {b^{{\boldsymbol {\beta }}\cdot {\boldsymbol {x}}}}{1+b^{{\boldsymbol {\beta }}\cdot {\boldsymbol {x}}}}}={\frac {1}{1+b^{-{\boldsymbol {\beta }}\cdot {\boldsymbol {x}}}}}=S_{b}(t)} ,

where S b {\displaystyle S_{b}} is the sigmoid function with base b {\displaystyle b} . The above formula shows that once the β m {\displaystyle \beta _{m}} are fixed, we can easily compute either the log-odds that y = 1 {\displaystyle y=1} for a given observation, or the probability that y = 1 {\displaystyle y=1} for a given observation. The main use-case of a logistic model is to be given an observation x {\displaystyle {\boldsymbol {x}}} , and estimate the probability p ( x ) {\displaystyle p({\boldsymbol {x}})} that y = 1 {\displaystyle y=1} . The optimum beta coefficients may again be found by maximizing the log-likelihood. For K measurements, defining x k {\displaystyle {\boldsymbol {x}}_{k}} as the explanatory vector of the k-th measurement, and y k {\displaystyle y_{k}} as the categorical outcome of that measurement, the log likelihood may be written in a form very similar to the simple M = 1 {\displaystyle M=1} case above:

ℓ = ∑ k = 1 K y k log b ⁡ ( p ( x k ) ) + ∑ k = 1 K ( 1 − y k ) log b ⁡ ( 1 − p ( x k ) ) {\displaystyle \ell =\sum _{k=1}^{K}y_{k}\log _{b}(p({\boldsymbol {x_{k}}}))+\sum _{k=1}^{K}(1-y_{k})\log _{b}(1-p({\boldsymbol {x_{k}}}))}

As in the simple example above, finding the optimum β parameters will require numerical methods. One useful technique is to equate the derivatives of the log likelihood with respect to each of the β parameters to zero yielding a set of equations which will hold at the maximum of the log likelihood:

∂ ℓ ∂ β m = 0 = ∑ k = 1 K y k x m k − ∑ k = 1 K p ( x k ) x m k {\displaystyle {\frac {\partial \ell }{\partial \beta _{m}}}=0=\sum _{k=1}^{K}y_{k}x_{mk}-\sum _{k=1}^{K}p({\boldsymbol {x}}_{k})x_{mk}}

where x_mk is the value of the x_m explanatory variable from the k-th measurement.

Consider an example with M = 2 {\displaystyle M=2} explanatory variables, b = 10 {\displaystyle b=10} , and coefficients β 0 = − 3 {\displaystyle \beta _{0}=-3} , β 1 = 1 {\displaystyle \beta _{1}=1} , and β 2 = 2 {\displaystyle \beta _{2}=2} which have been determined by the above method. To be concrete, the model is:

t = log 10 ⁡ p 1 − p = − 3 + x 1 + 2 x 2 {\displaystyle t=\log _{10}{\frac {p}{1-p}}=-3+x_{1}+2x_{2}}

p = b β ⋅ x 1 + b β ⋅ x = b β 0 + β 1 x 1 + β 2 x 2 1 + b β 0 + β 1 x 1 + β 2 x 2 = 1 1 + b − ( β 0 + β 1 x 1 + β 2 x 2 ) {\displaystyle p={\frac {b^{{\boldsymbol {\beta }}\cdot {\boldsymbol {x}}}}{1+b^{{\boldsymbol {\beta }}\cdot x}}}={\frac {b^{\beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2}}}{1+b^{\beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2}}}}={\frac {1}{1+b^{-(\beta _{0}+\beta _{1}x_{1}+\beta _{2}x_{2})}}}} ,

where p is the probability of the event that y = 1 {\displaystyle y=1} . This can be interpreted as follows:

• β 0 = − 3 {\displaystyle \beta _{0}=-3} is the y-intercept. It is the log-odds of the event that y = 1 {\displaystyle y=1} , when the predictors x 1 = x 2 = 0 {\displaystyle x_{1}=x_{2}=0} . By exponentiating, we can see that when x 1 = x 2 = 0 {\displaystyle x_{1}=x_{2}=0} the odds of the event that y = 1 {\displaystyle y=1} are 1-to-1000, or 10 − 3 {\displaystyle 10^{-3}} . Similarly, the probability of the event that y = 1 {\displaystyle y=1} when x 1 = x 2 = 0 {\displaystyle x_{1}=x_{2}=0} can be computed as 1 / ( 1000 + 1 ) = 1 / 1001. {\displaystyle 1/(1000+1)=1/1001.}
• β 1 = 1 {\displaystyle \beta _{1}=1} means that increasing x 1 {\displaystyle x_{1}} by 1 increases the log-odds by 1 {\displaystyle 1} . So if x 1 {\displaystyle x_{1}} increases by 1, the odds that y = 1 {\displaystyle y=1} increase by a factor of 10 1 {\displaystyle 10^{1}} . The probability of y = 1 {\displaystyle y=1} has also increased, but it has not increased by as much as the odds have increased.
• β 2 = 2 {\displaystyle \beta _{2}=2} means that increasing x 2 {\displaystyle x_{2}} by 1 increases the log-odds by 2 {\displaystyle 2} . So if x 2 {\displaystyle x_{2}} increases by 1, the odds that y = 1 {\displaystyle y=1} increase by a factor of 10 2 . {\displaystyle 10^{2}.} Note how the effect of x 2 {\displaystyle x_{2}} on the log-odds is twice as great as the effect of x 1 {\displaystyle x_{1}} , but the effect on the odds is 10 times greater. But the effect on the probability of y = 1 {\displaystyle y=1} is not as much as 10 times greater, it's only the effect on the odds that is 10 times greater.

In the above cases of two categories (binomial logistic regression), the categories were indexed by "0" and "1", and we had two probabilities: The probability that the outcome was in category 1 was given by p ( x ) {\displaystyle p({\boldsymbol {x}})} and the probability that the outcome was in category 0 was given by 1 − p ( x ) {\displaystyle 1-p({\boldsymbol {x}})} . The sum of these probabilities equals 1, which must be true, since "0" and "1" are the only possible categories in this setup.

In general, if we have ⁠ M + 1 {\displaystyle M+1} ⁠ explanatory variables (including x₀) and ⁠ N + 1 {\displaystyle N+1} ⁠ categories, we will need ⁠ N + 1 {\displaystyle N+1} ⁠ separate probabilities, one for each category, indexed by n, which describe the probability that the categorical outcome y will be in category y=n, conditional on the vector of covariates x. The sum of these probabilities over all categories must equal 1. Using the mathematically convenient base e, these probabilities are:

p n ( x ) = e β n ⋅ x 1 + ∑ u = 1 N e β u ⋅ x {\displaystyle p_{n}({\boldsymbol {x}})={\frac {e^{{\boldsymbol {\beta }}_{n}\cdot {\boldsymbol {x}}}}{1+\sum _{u=1}^{N}e^{{\boldsymbol {\beta }}_{u}\cdot {\boldsymbol {x}}}}}} for n = 1 , 2 , … , N {\displaystyle n=1,2,\dots ,N}

p 0 ( x ) = 1 − ∑ n = 1 N p n ( x ) = 1 1 + ∑ u = 1 N e β u ⋅ x {\displaystyle p_{0}({\boldsymbol {x}})=1-\sum _{n=1}^{N}p_{n}({\boldsymbol {x}})={\frac {1}{1+\sum _{u=1}^{N}e^{{\boldsymbol {\beta }}_{u}\cdot {\boldsymbol {x}}}}}}

Each of the probabilities except p 0 ( x ) {\displaystyle p_{0}({\boldsymbol {x}})} will have their own set of regression coefficients β n {\displaystyle {\boldsymbol {\beta }}_{n}} . It can be seen that, as required, the sum of the p n ( x ) {\displaystyle p_{n}({\boldsymbol {x}})} over all categories n is 1. The selection of p 0 ( x ) {\displaystyle p_{0}({\boldsymbol {x}})} to be defined in terms of the other probabilities is artificial. Any of the probabilities could have been selected to be so defined. This special value of n is termed the "pivot index", and the log-odds (t_n) are expressed in terms of the pivot probability and are again expressed as a linear combination of the explanatory variables:

t n = ln ⁡ ( p n ( x ) p 0 ( x ) ) = β n ⋅ x {\displaystyle t_{n}=\ln \left({\frac {p_{n}({\boldsymbol {x}})}{p_{0}({\boldsymbol {x}})}}\right)={\boldsymbol {\beta }}_{n}\cdot {\boldsymbol {x}}}

Note also that for the simple case of N = 1 {\displaystyle N=1} , the two-category case is recovered, with p ( x ) = p 1 ( x ) {\displaystyle p({\boldsymbol {x}})=p_{1}({\boldsymbol {x}})} and p 0 ( x ) = 1 − p 1 ( x ) {\displaystyle p_{0}({\boldsymbol {x}})=1-p_{1}({\boldsymbol {x}})} .

The log-likelihood that a particular set of K measurements or data points will be generated by the above probabilities can now be calculated. Indexing each measurement by k, let the k-th set of measured explanatory variables be denoted by x k {\displaystyle {\boldsymbol {x}}_{k}} and their categorical outcomes be denoted by y k {\displaystyle y_{k}} which can be equal to any integer in [0,N]. The log-likelihood is then:

ℓ = ∑ k = 1 K ∑ n = 0 N Δ ( n , y k ) ln ⁡ ( p n ( x k ) ) {\displaystyle \ell =\sum _{k=1}^{K}\sum _{n=0}^{N}\Delta (n,y_{k})\,\ln(p_{n}({\boldsymbol {x}}_{k}))}

where Δ ( n , y k ) {\displaystyle \Delta (n,y_{k})} is an indicator function which equals 1 if y_k = n and zero otherwise. In the case of two explanatory variables, this indicator function was defined as y_k when n = 1 and 1-y_k when n = 0. This was convenient, but not necessary.^[24] Again, the optimum beta coefficients may be found by maximizing the log-likelihood function generally using numerical methods. A possible method of solution is to set the derivatives of the log-likelihood with respect to each beta coefficient equal to zero and solve for the beta coefficients:

∂ ℓ ∂ β n m = 0 = ∑ k = 1 K Δ ( n , y k ) x m k − ∑ k = 1 K p n ( x k ) x m k {\displaystyle {\frac {\partial \ell }{\partial \beta _{nm}}}=0=\sum _{k=1}^{K}\Delta (n,y_{k})x_{mk}-\sum _{k=1}^{K}p_{n}({\boldsymbol {x}}_{k})x_{mk}}

where β n m {\displaystyle \beta _{nm}} is the m-th coefficient of the β n {\displaystyle {\boldsymbol {\beta }}_{n}} vector and x m k {\displaystyle x_{mk}} is the m-th explanatory variable of the k-th measurement. Once the beta coefficients have been estimated from the data, we will be able to estimate the probability that any subsequent set of explanatory variables will result in any of the possible outcome categories.

There are various equivalent specifications and interpretations of logistic regression, which fit into different types of more general models, and allow different generalizations.

The particular model used by logistic regression, which distinguishes it from standard linear regression and from other types of regression analysis used for binary-valued outcomes, is the way the probability of a particular outcome is linked to the linear predictor function:

logit ⁡ ( E ⁡ [ Y i ∣ x 1 , i , … , x m , i ] ) = logit ⁡ ( p i ) = ln ⁡ ( p i 1 − p i ) = β 0 + β 1 x 1 , i + ⋯ + β m x m , i {\displaystyle \operatorname {logit} (\operatorname {\mathbb {E} } [Y_{i}\mid x_{1,i},\ldots ,x_{m,i}])=\operatorname {logit} (p_{i})=\ln \left({\frac {p_{i}}{1-p_{i}}}\right)=\beta _{0}+\beta _{1}x_{1,i}+\cdots +\beta _{m}x_{m,i}}

Written using the more compact notation described above, this is:

logit ⁡ ( E ⁡ [ Y i ∣ X i ] ) = logit ⁡ ( p i ) = ln ⁡ ( p i 1 − p i ) = β ⋅ X i {\displaystyle \operatorname {logit} (\operatorname {\mathbb {E} } [Y_{i}\mid \mathbf {X} _{i}])=\operatorname {logit} (p_{i})=\ln \left({\frac {p_{i}}{1-p_{i}}}\right)={\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}

This formulation expresses logistic regression as a type of generalized linear model, which predicts variables with various types of probability distributions by fitting a linear predictor function of the above form to some sort of arbitrary transformation of the expected value of the variable.

The intuition for transforming using the logit function (the natural log of the odds) was explained above^{[clarification needed]}. It also has the practical effect of converting the probability (which is bounded to be between 0 and 1) to a variable that ranges over ( − ∞ , + ∞ ) {\displaystyle (-\infty ,+\infty )} — thereby matching the potential range of the linear prediction function on the right side of the equation.

Both the probabilities p_i and the regression coefficients are unobserved, and the means of determining them is not part of the model itself. They are typically determined by some sort of optimization procedure, e.g. maximum likelihood estimation, that finds values that best fit the observed data (i.e. that give the most accurate predictions for the data already observed), usually subject to regularization conditions that seek to exclude unlikely values, e.g. extremely large values for any of the regression coefficients. The use of a regularization condition is equivalent to doing maximum a posteriori (MAP) estimation, an extension of maximum likelihood. (Regularization is most commonly done using a squared regularizing function, which is equivalent to placing a zero-mean Gaussian prior distribution on the coefficients, but other regularizers are also possible.) Whether or not regularization is used, it is usually not possible to find a closed-form solution; instead, an iterative numerical method must be used, such as iteratively reweighted least squares (IRLS) or, more commonly these days, a quasi-Newton method such as the L-BFGS method.^[25]

The interpretation of the β_j parameter estimates is as the additive effect on the log of the odds for a unit change in the j the explanatory variable. In the case of a dichotomous explanatory variable, for instance, gender e β {\displaystyle e^{\beta }} is the estimate of the odds of having the outcome for, say, males compared with females.

An equivalent formula uses the inverse of the logit function, which is the logistic function, i.e.:

E ⁡ [ Y i ∣ X i ] = p i = logit − 1 ⁡ ( β ⋅ X i ) = 1 1 + e − β ⋅ X i {\displaystyle \operatorname {\mathbb {E} } [Y_{i}\mid \mathbf {X} _{i}]=p_{i}=\operatorname {logit} ^{-1}({\boldsymbol {\beta }}\cdot \mathbf {X} _{i})={\frac {1}{1+e^{-{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}}}

The formula can also be written as a probability distribution (specifically, using a probability mass function):

Pr ( Y i = y ∣ X i ) = p i y ( 1 − p i ) 1 − y = ( e β ⋅ X i 1 + e β ⋅ X i ) y ( 1 − e β ⋅ X i 1 + e β ⋅ X i ) 1 − y = e β ⋅ X i ⋅ y 1 + e β ⋅ X i {\displaystyle \Pr(Y_{i}=y\mid \mathbf {X} _{i})={p_{i}}^{y}(1-p_{i})^{1-y}=\left({\frac {e^{{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}{1+e^{{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}}\right)^{y}\left(1-{\frac {e^{{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}{1+e^{{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}}\right)^{1-y}={\frac {e^{{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}\cdot y}}{1+e^{{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}}}

The logistic model has an equivalent formulation as a latent-variable model. This formulation is common in the theory of discrete choice models and makes it easier to extend to certain more complicated models with multiple, correlated choices, as well as to compare logistic regression to the closely related probit model.

Imagine that, for each trial i, there is a continuous latent variable Y_i^* (i.e. an unobserved random variable) that is distributed as follows:

Y i ∗ = β ⋅ X i + ε i {\displaystyle Y_{i}^{\ast }={\boldsymbol {\beta }}\cdot \mathbf {X} _{i}+\varepsilon _{i}\,}

where

ε i ∼ Logistic ⁡ ( 0 , 1 ) {\displaystyle \varepsilon _{i}\sim \operatorname {Logistic} (0,1)\,}

i.e. the latent variable can be written directly in terms of the linear predictor function and an additive random error variable that is distributed according to a standard logistic distribution.

Then Y_i can be viewed as an indicator for whether this latent variable is positive:

Y i = { 1 if  Y i ∗ > 0    i.e.  − ε i < β ⋅ X i , 0 otherwise. {\displaystyle Y_{i}={\begin{cases}1&{\text{if }}Y_{i}^{\ast }>0\ {\text{ i.e. }}{-\varepsilon _{i}}<{\boldsymbol {\beta }}\cdot \mathbf {X} _{i},\\0&{\text{otherwise.}}\end{cases}}}

The choice of modeling the error variable specifically with a standard logistic distribution, rather than a general logistic distribution with the location and scale set to arbitrary values, seems restrictive, but in fact, it is not. It must be kept in mind that we can choose the regression coefficients ourselves, and very often can use them to offset changes in the parameters of the error variable's distribution. For example, a logistic error-variable distribution with a non-zero location parameter μ (which sets the mean) is equivalent to a distribution with a zero location parameter, where μ has been added to the intercept coefficient. Both situations produce the same value for Y_i^* regardless of settings of explanatory variables. Similarly, an arbitrary scale parameter s is equivalent to setting the scale parameter to 1 and then dividing all regression coefficients by s. In the latter case, the resulting value of Y_i^* will be smaller by a factor of s than in the former case, for all sets of explanatory variables — but critically, it will always remain on the same side of 0, and hence lead to the same Y_i choice.

(This predicts that the irrelevancy of the scale parameter may not carry over into more complex models where more than two choices are available.)

It turns out that this formulation is exactly equivalent to the preceding one, phrased in terms of the generalized linear model and without any latent variables. This can be shown as follows, using the fact that the cumulative distribution function (CDF) of the standard logistic distribution is the logistic function, which is the inverse of the logit function, i.e.

Pr ( ε i < x ) = logit − 1 ⁡ ( x ) {\displaystyle \Pr(\varepsilon _{i}<x)=\operatorname {logit} ^{-1}(x)}

Then:

Pr ( Y i = 1 ∣ X i ) = Pr ( Y i ∗ > 0 ∣ X i ) = Pr ( β ⋅ X i + ε i > 0 ) = Pr ( ε i > − β ⋅ X i ) = Pr ( ε i < β ⋅ X i ) (because the logistic distribution is symmetric) = logit − 1 ⁡ ( β ⋅ X i ) = p i (see above) {\displaystyle {\begin{aligned}\Pr(Y_{i}=1\mid \mathbf {X} _{i})&=\Pr(Y_{i}^{\ast }>0\mid \mathbf {X} _{i})\\[5pt]&=\Pr({\boldsymbol {\beta }}\cdot \mathbf {X} _{i}+\varepsilon _{i}>0)\\[5pt]&=\Pr(\varepsilon _{i}>-{\boldsymbol {\beta }}\cdot \mathbf {X} _{i})\\[5pt]&=\Pr(\varepsilon _{i}<{\boldsymbol {\beta }}\cdot \mathbf {X} _{i})&&{\text{(because the logistic distribution is symmetric)}}\\[5pt]&=\operatorname {logit} ^{-1}({\boldsymbol {\beta }}\cdot \mathbf {X} _{i})&\\[5pt]&=p_{i}&&{\text{(see above)}}\end{aligned}}}

This formulation—which is standard in discrete choice models—makes clear the relationship between logistic regression (the "logit model") and the probit model, which uses an error variable distributed according to a standard normal distribution instead of a standard logistic distribution. Both the logistic and normal distributions are symmetric with a basic unimodal, "bell curve" shape. The only difference is that the logistic distribution has somewhat heavier tails, which means that it is less sensitive to outlying data (and hence somewhat more robust to model mis-specifications or erroneous data).

Yet another formulation uses two separate latent variables:

Y i 0 ∗ = β 0 ⋅ X i + ε 0 Y i 1 ∗ = β 1 ⋅ X i + ε 1 {\displaystyle {\begin{aligned}Y_{i}^{0\ast }&={\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}+\varepsilon _{0}\,\\Y_{i}^{1\ast }&={\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}+\varepsilon _{1}\,\end{aligned}}}

where

ε 0 ∼ EV 1 ⁡ ( 0 , 1 ) ε 1 ∼ EV 1 ⁡ ( 0 , 1 ) {\displaystyle {\begin{aligned}\varepsilon _{0}&\sim \operatorname {EV} _{1}(0,1)\\\varepsilon _{1}&\sim \operatorname {EV} _{1}(0,1)\end{aligned}}}

where EV₁(0,1) is a standard type-1 extreme value distribution: i.e.

Pr ( ε 0 = x ) = Pr ( ε 1 = x ) = e − x e − e − x {\displaystyle \Pr(\varepsilon _{0}=x)=\Pr(\varepsilon _{1}=x)=e^{-x}e^{-e^{-x}}}

Then

Y i = { 1 if  Y i 1 ∗ > Y i 0 ∗ , 0 otherwise. {\displaystyle Y_{i}={\begin{cases}1&{\text{if }}Y_{i}^{1\ast }>Y_{i}^{0\ast },\\0&{\text{otherwise.}}\end{cases}}}

This model has a separate latent variable and a separate set of regression coefficients for each possible outcome of the dependent variable. The reason for this separation is that it makes it easy to extend logistic regression to multi-outcome categorical variables, as in the multinomial logit model. In such a model, it is natural to model each possible outcome using a different set of regression coefficients. It is also possible to motivate each of the separate latent variables as the theoretical utility associated with making the associated choice, and thus motivate logistic regression in terms of utility theory. (In terms of utility theory, a rational actor always chooses the choice with the greatest associated utility.) This is the approach taken by economists when formulating discrete choice models, because it both provides a theoretically strong foundation and facilitates intuitions about the model, which in turn makes it easy to consider various sorts of extensions. (See the example below.)

The choice of the type-1 extreme value distribution seems fairly arbitrary, but it makes the mathematics work out, and it may be possible to justify its use through rational choice theory.

It turns out that this model is equivalent to the previous model, although this seems non-obvious, since there are now two sets of regression coefficients and error variables, and the error variables have a different distribution. In fact, this model reduces directly to the previous one with the following substitutions:

β = β 1 − β 0 {\displaystyle {\boldsymbol {\beta }}={\boldsymbol {\beta }}_{1}-{\boldsymbol {\beta }}_{0}}

ε = ε 1 − ε 0 {\displaystyle \varepsilon =\varepsilon _{1}-\varepsilon _{0}}

An intuition for this comes from the fact that, since we choose based on the maximum of two values, only their difference matters, not the exact values — and this effectively removes one degree of freedom. Another critical fact is that the difference of two type-1 extreme-value-distributed variables is a logistic distribution, i.e. ε = ε 1 − ε 0 ∼ Logistic ⁡ ( 0 , 1 ) . {\displaystyle \varepsilon =\varepsilon _{1}-\varepsilon _{0}\sim \operatorname {Logistic} (0,1).} We can demonstrate the equivalent as follows:

Pr ( Y i = 1 ∣ X i ) = Pr ( Y i 1 ∗ > Y i 0 ∗ ∣ X i ) = Pr ( Y i 1 ∗ − Y i 0 ∗ > 0 ∣ X i ) = Pr ( β 1 ⋅ X i + ε 1 − ( β 0 ⋅ X i + ε 0 ) > 0 ) = Pr ( ( β 1 ⋅ X i − β 0 ⋅ X i ) + ( ε 1 − ε 0 ) > 0 ) = Pr ( ( β 1 − β 0 ) ⋅ X i + ( ε 1 − ε 0 ) > 0 ) = Pr ( ( β 1 − β 0 ) ⋅ X i + ε > 0 ) (substitute  ε  as above) = Pr ( β ⋅ X i + ε > 0 ) (substitute  β  as above) = Pr ( ε > − β ⋅ X i ) (now, same as above model) = Pr ( ε < β ⋅ X i ) = logit − 1 ⁡ ( β ⋅ X i ) = p i {\displaystyle {\begin{aligned}\Pr(Y_{i}=1\mid \mathbf {X} _{i})={}&\Pr \left(Y_{i}^{1\ast }>Y_{i}^{0\ast }\mid \mathbf {X} _{i}\right)&\\[5pt]={}&\Pr \left(Y_{i}^{1\ast }-Y_{i}^{0\ast }>0\mid \mathbf {X} _{i}\right)&\\[5pt]={}&\Pr \left({\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}+\varepsilon _{1}-\left({\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}+\varepsilon _{0}\right)>0\right)&\\[5pt]={}&\Pr \left(({\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}-{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i})+(\varepsilon _{1}-\varepsilon _{0})>0\right)&\\[5pt]={}&\Pr(({\boldsymbol {\beta }}_{1}-{\boldsymbol {\beta }}_{0})\cdot \mathbf {X} _{i}+(\varepsilon _{1}-\varepsilon _{0})>0)&\\[5pt]={}&\Pr(({\boldsymbol {\beta }}_{1}-{\boldsymbol {\beta }}_{0})\cdot \mathbf {X} _{i}+\varepsilon >0)&&{\text{(substitute }}\varepsilon {\text{ as above)}}\\[5pt]={}&\Pr({\boldsymbol {\beta }}\cdot \mathbf {X} _{i}+\varepsilon >0)&&{\text{(substitute }}{\boldsymbol {\beta }}{\text{ as above)}}\\[5pt]={}&\Pr(\varepsilon >-{\boldsymbol {\beta }}\cdot \mathbf {X} _{i})&&{\text{(now, same as above model)}}\\[5pt]={}&\Pr(\varepsilon <{\boldsymbol {\beta }}\cdot \mathbf {X} _{i})&\\[5pt]={}&\operatorname {logit} ^{-1}({\boldsymbol {\beta }}\cdot \mathbf {X} _{i})\\[5pt]={}&p_{i}\end{aligned}}}

Yet another formulation combines the two-way latent variable formulation above with the original formulation higher up without latent variables, and in the process provides a link to one of the standard formulations of the multinomial logit.

Here, instead of writing the logit of the probabilities p_i as a linear predictor, we separate the linear predictor into two, one for each of the two outcomes:

ln ⁡ Pr ( Y i = 0 ) = β 0 ⋅ X i − ln ⁡ Z ln ⁡ Pr ( Y i = 1 ) = β 1 ⋅ X i − ln ⁡ Z {\displaystyle {\begin{aligned}\ln \Pr(Y_{i}=0)&={\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}-\ln Z\\\ln \Pr(Y_{i}=1)&={\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}-\ln Z\end{aligned}}}

Two separate sets of regression coefficients have been introduced, just as in the two-way latent variable model, and the two equations appear a form that writes the logarithm of the associated probability as a linear predictor, with an extra term − ln ⁡ Z {\displaystyle -\ln Z} at the end. This term, as it turns out, serves as the normalizing factor ensuring that the result is a distribution. This can be seen by exponentiating both sides:

Pr ( Y i = 0 ) = 1 Z e β 0 ⋅ X i Pr ( Y i = 1 ) = 1 Z e β 1 ⋅ X i {\displaystyle {\begin{aligned}\Pr(Y_{i}=0)&={\frac {1}{Z}}e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}\\[5pt]\Pr(Y_{i}=1)&={\frac {1}{Z}}e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}\end{aligned}}}

In this form it is clear that the purpose of Z is to ensure that the resulting distribution over Y_i is in fact a probability distribution, i.e. it sums to 1. This means that Z is simply the sum of all un-normalized probabilities, and by dividing each probability by Z, the probabilities become "normalized". That is:

Z = e β 0 ⋅ X i + e β 1 ⋅ X i {\displaystyle Z=e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}

and the resulting equations are

Pr ( Y i = 0 ) = e β 0 ⋅ X i e β 0 ⋅ X i + e β 1 ⋅ X i Pr ( Y i = 1 ) = e β 1 ⋅ X i e β 0 ⋅ X i + e β 1 ⋅ X i . {\displaystyle {\begin{aligned}\Pr(Y_{i}=0)&={\frac {e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}}{e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}}\\[5pt]\Pr(Y_{i}=1)&={\frac {e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}{e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}}.\end{aligned}}}

Or generally:

Pr ( Y i = c ) = e β c ⋅ X i ∑ h e β h ⋅ X i {\displaystyle \Pr(Y_{i}=c)={\frac {e^{{\boldsymbol {\beta }}_{c}\cdot \mathbf {X} _{i}}}{\sum _{h}e^{{\boldsymbol {\beta }}_{h}\cdot \mathbf {X} _{i}}}}}

This shows clearly how to generalize this formulation to more than two outcomes, as in multinomial logit. This general formulation is exactly the softmax function as in

Pr ( Y i = c ) = softmax ⁡ ( c , β 0 ⋅ X i , β 1 ⋅ X i , … ) . {\displaystyle \Pr(Y_{i}=c)=\operatorname {softmax} (c,{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i},{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i},\dots ).}

To prove that this is equivalent to the previous model, we start by recognizing the above model is overspecified, in that Pr ( Y i = 0 ) {\displaystyle \Pr(Y_{i}=0)} and Pr ( Y i = 1 ) {\displaystyle \Pr(Y_{i}=1)} cannot be independently specified: rather Pr ( Y i = 0 ) + Pr ( Y i = 1 ) = 1 {\displaystyle \Pr(Y_{i}=0)+\Pr(Y_{i}=1)=1} so knowing one automatically determines the other. As a result, the model is nonidentifiable, in that multiple combinations of β 0 {\displaystyle {\boldsymbol {\beta }}_{0}} and β 1 {\displaystyle {\boldsymbol {\beta }}_{1}} will produce the same probabilities for all possible explanatory variables. In fact, it can be seen that adding any constant vector to both of them will produce the same probabilities:

Pr ( Y i = 1 ) = e ( β 1 + C ) ⋅ X i e ( β 0 + C ) ⋅ X i + e ( β 1 + C ) ⋅ X i = e β 1 ⋅ X i e C ⋅ X i e β 0 ⋅ X i e C ⋅ X i + e β 1 ⋅ X i e C ⋅ X i = e C ⋅ X i e β 1 ⋅ X i e C ⋅ X i ( e β 0 ⋅ X i + e β 1 ⋅ X i ) = e β 1 ⋅ X i e β 0 ⋅ X i + e β 1 ⋅ X i . {\displaystyle {\begin{aligned}\Pr(Y_{i}=1)&={\frac {e^{({\boldsymbol {\beta }}_{1}+\mathbf {C} )\cdot \mathbf {X} _{i}}}{e^{({\boldsymbol {\beta }}_{0}+\mathbf {C} )\cdot \mathbf {X} _{i}}+e^{({\boldsymbol {\beta }}_{1}+\mathbf {C} )\cdot \mathbf {X} _{i}}}}\\[5pt]&={\frac {e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}e^{\mathbf {C} \cdot \mathbf {X} _{i}}}{e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}e^{\mathbf {C} \cdot \mathbf {X} _{i}}+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}e^{\mathbf {C} \cdot \mathbf {X} _{i}}}}\\[5pt]&={\frac {e^{\mathbf {C} \cdot \mathbf {X} _{i}}e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}{e^{\mathbf {C} \cdot \mathbf {X} _{i}}(e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}})}}\\[5pt]&={\frac {e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}{e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}}.\end{aligned}}}

As a result, we can simplify matters, and restore identifiability, by picking an arbitrary value for one of the two vectors. We choose to set β 0 = 0 . {\displaystyle {\boldsymbol {\beta }}_{0}=\mathbf {0} .} Then,

e β 0 ⋅ X i = e 0 ⋅ X i = 1 {\displaystyle e^{{\boldsymbol {\beta }}_{0}\cdot \mathbf {X} _{i}}=e^{\mathbf {0} \cdot \mathbf {X} _{i}}=1}

and so

Pr ( Y i = 1 ) = e β 1 ⋅ X i 1 + e β 1 ⋅ X i = 1 1 + e − β 1 ⋅ X i = p i {\displaystyle \Pr(Y_{i}=1)={\frac {e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}{1+e^{{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}}={\frac {1}{1+e^{-{\boldsymbol {\beta }}_{1}\cdot \mathbf {X} _{i}}}}=p_{i}}

which shows that this formulation is indeed equivalent to the previous formulation. (As in the two-way latent variable formulation, any settings where β = β 1 − β 0 {\displaystyle {\boldsymbol {\beta }}={\boldsymbol {\beta }}_{1}-{\boldsymbol {\beta }}_{0}} will produce equivalent results.)

Most treatments of the multinomial logit model start out either by extending the "log-linear" formulation presented here or the two-way latent variable formulation presented above, since both clearly show the way that the model could be extended to multi-way outcomes. In general, the presentation with latent variables is more common in econometrics and political science, where discrete choice models and utility theory reign, while the "log-linear" formulation here is more common in computer science, e.g. machine learning and natural language processing.

The model has an equivalent formulation

p i = 1 1 + e − ( β 0 + β 1 x 1 , i + ⋯ + β k x k , i ) . {\displaystyle p_{i}={\frac {1}{1+e^{-(\beta _{0}+\beta _{1}x_{1,i}+\cdots +\beta _{k}x_{k,i})}}}.\,}

This functional form is commonly called a single-layer perceptron or single-layer artificial neural network. A single-layer neural network computes a continuous output instead of a step function. The derivative of p_i with respect to X = (x₁, ..., x_k) is computed from the general form:

y = 1 1 + e − f ( X ) {\displaystyle y={\frac {1}{1+e^{-f(X)}}}}

where f(X) is an analytic function in X. With this choice, the single-layer neural network is identical to the logistic regression model. This function has a continuous derivative, which allows it to be used in backpropagation. This function is also preferred because its derivative is easily calculated:

d y d X = y ( 1 − y ) d f d X . {\displaystyle {\frac {\mathrm {d} y}{\mathrm {d} X}}=y(1-y){\frac {\mathrm {d} f}{\mathrm {d} X}}.\,}

A closely related model assumes that each i is associated not with a single Bernoulli trial but with n_i independent identically distributed trials, where the observation Y_i is the number of successes observed (the sum of the individual Bernoulli-distributed random variables), and hence follows a binomial distribution:

Y i ∼ Bin ⁡ ( n i , p i ) ,  for  i = 1 , … , n {\displaystyle Y_{i}\,\sim \operatorname {Bin} (n_{i},p_{i}),{\text{ for }}i=1,\dots ,n}

An example of this distribution is the fraction of seeds (p_i) that germinate after n_i are planted.

In terms of expected values, this model is expressed as follows:

p i = E ⁡ [ Y i n i | X i ] , {\displaystyle p_{i}=\operatorname {\mathbb {E} } \left[\left.{\frac {Y_{i}}{n_{i}}}\,\right|\,\mathbf {X} _{i}\right]\,,}

so that

logit ⁡ ( E ⁡ [ Y i n i | X i ] ) = logit ⁡ ( p i ) = ln ⁡ ( p i 1 − p i ) = β ⋅ X i , {\displaystyle \operatorname {logit} \left(\operatorname {\mathbb {E} } \left[\left.{\frac {Y_{i}}{n_{i}}}\,\right|\,\mathbf {X} _{i}\right]\right)=\operatorname {logit} (p_{i})=\ln \left({\frac {p_{i}}{1-p_{i}}}\right)={\boldsymbol {\beta }}\cdot \mathbf {X} _{i}\,,}

Or equivalently:

Pr ( Y i = y ∣ X i ) = ( n i y ) p i y ( 1 − p i ) n i − y = ( n i y ) ( 1 1 + e − β ⋅ X i ) y ( 1 − 1 1 + e − β ⋅ X i ) n i − y . {\displaystyle \Pr(Y_{i}=y\mid \mathbf {X} _{i})={n_{i} \choose y}p_{i}^{y}(1-p_{i})^{n_{i}-y}={n_{i} \choose y}\left({\frac {1}{1+e^{-{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}}\right)^{y}\left(1-{\frac {1}{1+e^{-{\boldsymbol {\beta }}\cdot \mathbf {X} _{i}}}}\right)^{n_{i}-y}\,.}

This model can be fit using the same sorts of methods as the above more basic model.

The regression coefficients are usually estimated using maximum likelihood estimation.^[26][27] Unlike linear regression with normally distributed residuals, it is not possible to find a closed-form expression for the coefficient values that maximize the likelihood function so an iterative process must be used instead; for example Newton's method. This process begins with a tentative solution, revises it slightly to see if it can be improved, and repeats this revision until no more improvement is made, at which point the process is said to have converged.^[26]

In some instances, the model may not reach convergence. Non-convergence of a model indicates that the coefficients are not meaningful because the iterative process was unable to find appropriate solutions. A failure to converge may occur for a number of reasons: having a large ratio of predictors to cases, multicollinearity, sparseness, or complete separation.

• Having a large ratio of variables to cases results in an overly conservative Wald statistic (discussed below) and can lead to non-convergence. Regularized logistic regression is specifically intended to be used in this situation.
• Multicollinearity refers to unacceptably high correlations between predictors. As multicollinearity increases, coefficients remain unbiased but standard errors increase and the likelihood of model convergence decreases.^[26] To detect multicollinearity amongst the predictors, one can conduct a linear regression analysis with the predictors of interest for the sole purpose of examining the tolerance statistic ^[26] used to assess whether multicollinearity is unacceptably high.
• Sparseness in the data refers to having a large proportion of empty cells (cells with zero counts). Zero cell counts are particularly problematic with categorical predictors. With continuous predictors, the model can infer values for the zero cell counts, but this is not the case with categorical predictors. The model will not converge with zero cell counts for categorical predictors because the natural logarithm of zero is an undefined value so that the final solution to the model cannot be reached. To remedy this problem, researchers may collapse categories in a theoretically meaningful way or add a constant to all cells.^[26]
• Another numerical problem that may lead to a lack of convergence is complete separation, which refers to the instance in which the predictors perfectly predict the criterion – all cases are accurately classified and the likelihood maximized with infinite coefficients. In such instances, one should re-examine the data, as there may be some kind of error.^{[2][further explanation needed]}
• One can also take semi-parametric or non-parametric approaches, e.g., via local-likelihood or nonparametric quasi-likelihood methods, which avoid assumptions of a parametric form for the index function and is robust to the choice of the link function (e.g., probit or logit).^[28]

Binary logistic regression ( y = 0 {\displaystyle y=0} or y = 1 {\displaystyle y=1} ) can, for example, be calculated using iteratively reweighted least squares (IRLS), which is equivalent to maximizing the log-likelihood of a Bernoulli distributed process using Newton's method. If the problem is written in vector matrix form, with parameters w T = [ β 0 , β 1 , β 2 , … ] {\displaystyle \mathbf {w} ^{T}=[\beta _{0},\beta _{1},\beta _{2},\ldots ]} , explanatory variables x ( i ) = [ 1 , x 1 ( i ) , x 2 ( i ) , … ] T {\displaystyle \mathbf {x} (i)=[1,x_{1}(i),x_{2}(i),\ldots ]^{T}} and expected value of the Bernoulli distribution μ ( i ) = 1 1 + e − w T x ( i ) {\displaystyle \mu (i)={\frac {1}{1+e^{-\mathbf {w} ^{T}\mathbf {x} (i)}}}} , the parameters w {\displaystyle \mathbf {w} } can be found using the following iterative algorithm:

w k + 1 = ( X T S k X ) − 1 X T ( S k X w k + y − μ k ) {\displaystyle \mathbf {w} _{k+1}=\left(\mathbf {X} ^{T}\mathbf {S} _{k}\mathbf {X} \right)^{-1}\mathbf {X} ^{T}\left(\mathbf {S} _{k}\mathbf {X} \mathbf {w} _{k}+\mathbf {y} -\mathbf {\boldsymbol {\mu }} _{k}\right)}

where S = diag ⁡ ( μ ( i ) ( 1 − μ ( i ) ) ) {\displaystyle \mathbf {S} =\operatorname {diag} (\mu (i)(1-\mu (i)))} is a diagonal weighting matrix, μ = [ μ ( 1 ) , μ ( 2 ) , … ] {\displaystyle {\boldsymbol {\mu }}=[\mu (1),\mu (2),\ldots ]} the vector of expected values,

X = [ 1 x 1 ( 1 ) x 2 ( 1 ) … 1 x 1 ( 2 ) x 2 ( 2 ) … ⋮ ⋮ ⋮ ] {\displaystyle \mathbf {X} ={\begin{bmatrix}1&x_{1}(1)&x_{2}(1)&\ldots \\1&x_{1}(2)&x_{2}(2)&\ldots \\\vdots &\vdots &\vdots \end{bmatrix}}}

the regressor matrix and y ( i ) = [ y ( 1 ) , y ( 2 ) , … ] T {\displaystyle \mathbf {y} (i)=[y(1),y(2),\ldots ]^{T}} the vector of response variables. More details can be found in the literature.^[29]

In a Bayesian statistics context, prior distributions are normally placed on the regression coefficients, for example in the form of Gaussian distributions. There is no conjugate prior of the likelihood function in logistic regression. When Bayesian inference was performed analytically, this made the posterior distribution difficult to calculate except in very low dimensions. Now, though, automatic software such as OpenBUGS, JAGS, PyMC, Stan or Turing.jl allows these posteriors to be computed using simulation, so lack of conjugacy is not a concern. However, when the sample size or the number of parameters is large, full Bayesian simulation can be slow, and people often use approximate methods such as variational Bayesian methods and expectation propagation.

Widely used, the "one in ten rule", states that logistic regression models give stable values for the explanatory variables if based on a minimum of about 10 events per explanatory variable (EPV); where event denotes the cases belonging to the less frequent category in the dependent variable. Thus a study designed to use k {\displaystyle k} explanatory variables for an event (e.g. myocardial infarction) expected to occur in a proportion p {\displaystyle p} of participants in the study will require a total of 10 k / p {\displaystyle 10k/p} participants. However, there is considerable debate about the reliability of this rule, which is based on simulation studies and lacks a secure theoretical underpinning.^[30] According to some authors^[31] the rule is overly conservative in some circumstances, with the authors stating, "If we (somewhat subjectively) regard confidence interval coverage less than 93 percent, type I error greater than 7 percent, or relative bias greater than 15 percent as problematic, our results indicate that problems are fairly frequent with 2–4 EPV, uncommon with 5–9 EPV, and still observed with 10–16 EPV. The worst instances of each problem were not severe with 5–9 EPV and usually comparable to those with 10–16 EPV".^[32]

Others have found results that are not consistent with the above, using different criteria. A useful criterion is whether the fitted model will be expected to achieve the same predictive discrimination in a new sample as it appeared to achieve in the model development sample. For that criterion, 20 events per candidate variable may be required.^[33] Also, one can argue that 96 observations are needed only to estimate the model's intercept precisely enough that the margin of error in predicted probabilities is ±0.1 with a 0.95 confidence level.^[13]

In any fitting procedure, the addition of another fitting parameter to a model (e.g. the beta parameters in a logistic regression model) will almost always improve the ability of the model to predict the measured outcomes. This will be true even if the additional term has no predictive value, since the model will simply be "overfitting" to the noise in the data. The question arises as to whether the improvement gained by the addition of another fitting parameter is significant enough to recommend the inclusion of the additional term, or whether the improvement is simply that which may be expected from overfitting.

In short, for logistic regression, a statistic known as the deviance is defined which is a measure of the error between the logistic model fit and the outcome data. In the limit of a large number of data points, the deviance is chi-squared distributed, which allows a chi-squared test to be implemented in order to determine the significance of the explanatory variables.

Linear regression and logistic regression have many similarities. For example, in simple linear regression, a set of K data points (x_k, y_k) are fitted to a proposed model function of the form y = b 0 + b 1 x {\displaystyle y=b_{0}+b_{1}x} . The fit is obtained by choosing the b parameters which minimize the sum of the squares of the residuals (the squared error term) for each data point:

ε 2 = ∑ k = 1 K ( b 0 + b 1 x k − y k ) 2 . {\displaystyle \varepsilon ^{2}=\sum _{k=1}^{K}(b_{0}+b_{1}x_{k}-y_{k})^{2}.}

The minimum value which constitutes the fit will be denoted by ε ^ 2 {\displaystyle {\hat {\varepsilon }}^{2}}

The idea of a null model may be introduced, in which it is assumed that the x variable is of no use in predicting the y_k outcomes: The data points are fitted to a null model function of the form y = b₀ with a squared error term:

ε 2 = ∑ k = 1 K ( b 0 − y k ) 2 . {\displaystyle \varepsilon ^{2}=\sum _{k=1}^{K}(b_{0}-y_{k})^{2}.}

The fitting process consists of choosing a value of b₀ which minimizes ε 2 {\displaystyle \varepsilon ^{2}} of the fit to the null model, denoted by ε φ 2 {\displaystyle \varepsilon _{\varphi }^{2}} where the φ {\displaystyle \varphi } subscript denotes the null model. It is seen that the null model is optimized by b 0 = y ¯ {\displaystyle b_{0}={\overline {y}}} where y ¯ {\displaystyle {\overline {y}}} is the mean of the y_k values, and the optimized ε φ 2 {\displaystyle \varepsilon _{\varphi }^{2}} is:

ε ^ φ 2 = ∑ k = 1 K ( y ¯ − y k ) 2 {\displaystyle {\hat {\varepsilon }}_{\varphi }^{2}=\sum _{k=1}^{K}({\overline {y}}-y_{k})^{2}}

which is proportional to the square of the (uncorrected) sample standard deviation of the y_k data points.

We can imagine a case where the y_k data points are randomly assigned to the various x_k, and then fitted using the proposed model. Specifically, we can consider the fits of the proposed model to every permutation of the y_k outcomes. It can be shown that the optimized error of any of these fits will never be less than the optimum error of the null model, and that the difference between these minimum error will follow a chi-squared distribution, with degrees of freedom equal those of the proposed model minus those of the null model which, in this case, will be 2 − 1 = 1 {\displaystyle 2-1=1} . Using the chi-squared test, we may then estimate how many of these permuted sets of y_k will yield a minimum error less than or equal to the minimum error using the original y_k, and so we can estimate how significant an improvement is given by the inclusion of the x variable in the proposed model.

For logistic regression, the measure of goodness-of-fit is the likelihood function L, or its logarithm, the log-likelihood ℓ. The likelihood function L is analogous to the ε 2 {\displaystyle \varepsilon ^{2}} in the linear regression case, except that the likelihood is maximized rather than minimized. Denote the maximized log-likelihood of the proposed model by ℓ ^ {\displaystyle {\hat {\ell }}} .

In the case of simple binary logistic regression, the set of K data points are fitted in a probabilistic sense to a function of the form:

p ( x ) = 1 1 + e − t {\displaystyle p(x)={\frac {1}{1+e^{-t}}}}

where ⁠ p ( x ) {\displaystyle p(x)} ⁠ is the probability that y = 1 {\displaystyle y=1} . The log-odds are given by:

t = β 0 + β 1 x {\displaystyle t=\beta _{0}+\beta _{1}x}

and the log-likelihood is:

ℓ = ∑ k = 1 K ( y k ln ⁡ ( p ( x k ) ) + ( 1 − y k ) ln ⁡ ( 1 − p ( x k ) ) ) {\displaystyle \ell =\sum _{k=1}^{K}\left(y_{k}\ln(p(x_{k}))+(1-y_{k})\ln(1-p(x_{k}))\right)}

For the null model, the probability that y = 1 {\displaystyle y=1} is given by:

p φ ( x ) = 1 1 + e − t φ {\displaystyle p_{\varphi }(x)={\frac {1}{1+e^{-t_{\varphi }}}}}

The log-odds for the null model are given by:

t φ = β 0 {\displaystyle t_{\varphi }=\beta _{0}}

and the log-likelihood is:

ℓ φ = ∑ k = 1 K ( y k ln ⁡ ( p φ ) + ( 1 − y k ) ln ⁡ ( 1 − p φ ) ) {\displaystyle \ell _{\varphi }=\sum _{k=1}^{K}\left(y_{k}\ln(p_{\varphi })+(1-y_{k})\ln(1-p_{\varphi })\right)}

Since we have p φ = y ¯ {\displaystyle p_{\varphi }={\overline {y}}} at the maximum of L, the maximum log-likelihood for the null model is

ℓ ^ φ = K ( y ¯ ln ⁡ ( y ¯ ) + ( 1 − y ¯ ) ln ⁡ ( 1 − y ¯ ) ) {\displaystyle {\hat {\ell }}_{\varphi }=K(\,{\overline {y}}\ln({\overline {y}})+(1-{\overline {y}})\ln(1-{\overline {y}}))}

The optimum β 0 {\displaystyle \beta _{0}} is:

β 0 = ln ⁡ ( y ¯ 1 − y ¯ ) {\displaystyle \beta _{0}=\ln \left({\frac {\overline {y}}{1-{\overline {y}}}}\right)}

where y ¯ {\displaystyle {\overline {y}}} is again the mean of the y_k values. Again, we can conceptually consider the fit of the proposed model to every permutation of the y_k and it can be shown that the maximum log-likelihood of these permutation fits will never be smaller than that of the null model:

ℓ ^ ≥ ℓ ^ φ {\displaystyle {\hat {\ell }}\geq {\hat {\ell }}_{\varphi }}

Also, as an analog to the error of the linear regression case, we may define the deviance of a logistic regression fit as:

D = ln ⁡ ( L ^ 2 L ^ φ 2 ) = 2 ( ℓ ^ − ℓ ^ φ ) {\displaystyle D=\ln \left({\frac {{\hat {L}}^{2}}{{\hat {L}}_{\varphi }^{2}}}\right)=2({\hat {\ell }}-{\hat {\ell }}_{\varphi })}

which will always be positive or zero. The reason for this choice is that not only is the deviance a good measure of the goodness of fit, it is also approximately chi-squared distributed, with the approximation improving as the number of data points (K) increases, becoming exactly chi-square distributed in the limit of an infinite number of data points. As in the case of linear regression, we may use this fact to estimate the probability that a random set of data points will give a better fit than the fit obtained by the proposed model, and so have an estimate how significantly the model is improved by including the x_k data points in the proposed model.

For the simple model of student test scores described above, the maximum value of the log-likelihood of the null model is ℓ ^ φ = − 13.8629 … {\displaystyle {\hat {\ell }}_{\varphi }=-13.8629\ldots } The maximum value of the log-likelihood for the simple model is ℓ ^ = − 8.02988 … {\displaystyle {\hat {\ell }}=-8.02988\ldots } so that the deviance is D = 2 ( ℓ ^ − ℓ ^ φ ) = 11.6661 … {\displaystyle D=2({\hat {\ell }}-{\hat {\ell }}_{\varphi })=11.6661\ldots }

Using the chi-squared test of significance, the integral of the chi-squared distribution with one degree of freedom from 11.6661... to infinity is equal to 0.00063649...

This effectively means that about 6 out of a 10,000 fits to random y_k can be expected to have a better fit (smaller deviance) than the given y_k and so we can conclude that the inclusion of the x variable and data in the proposed model is a very significant improvement over the null model. In other words, we reject the null hypothesis with 1 − D ≈ 99.94 % {\displaystyle 1-D\approx 99.94\%} confidence.

Goodness of fit in linear regression models is generally measured using R². Since this has no direct analog in logistic regression, various methods^{[34]: ch.21} including the following can be used instead.

In linear regression analysis, one is concerned with partitioning variance via the sum of squares calculations – variance in the criterion is essentially divided into variance accounted for by the predictors and residual variance. In logistic regression analysis, deviance is used in lieu of a sum of squares calculations.^[35] Deviance is analogous to the sum of squares calculations in linear regression^[2] and is a measure of the lack of fit to the data in a logistic regression model.^[35] When a "saturated" model is available (a model with a theoretically perfect fit), deviance is calculated by comparing a given model with the saturated model.^[2] This computation gives the likelihood-ratio test:^[2]

D = − 2 ln ⁡ likelihood of the fitted model likelihood of the saturated model . {\displaystyle D=-2\ln {\frac {\text{likelihood of the fitted model}}{\text{likelihood of the saturated model}}}.}

In the above equation, D represents the deviance and ln represents the natural logarithm. The log of this likelihood ratio (the ratio of the fitted model to the saturated model) will produce a negative value, hence the need for a negative sign. D can be shown to follow an approximate chi-squared distribution.^[2] Smaller values indicate better fit as the fitted model deviates less from the saturated model. When assessed upon a chi-square distribution, nonsignificant chi-square values indicate very little unexplained variance and thus, good model fit. Conversely, a significant chi-square value indicates that a significant amount of the variance is unexplained.

When the saturated model is not available (a common case), deviance is calculated simply as −2·(log likelihood of the fitted model), and the reference to the saturated model's log likelihood can be removed from all that follows without harm.

Two measures of deviance are particularly important in logistic regression: null deviance and model deviance. The null deviance represents the difference between a model with only the intercept (which means "no predictors") and the saturated model. The model deviance represents the difference between a model with at least one predictor and the saturated model.^[35] In this respect, the null model provides a baseline upon which to compare predictor models. Given that deviance is a measure of the difference between a given model and the saturated model, smaller values indicate better fit. Thus, to assess the contribution of a predictor or set of predictors, one can subtract the model deviance from the null deviance and assess the difference on a χ s − p 2 , {\displaystyle \chi _{s-p}^{2},} chi-square distribution with degrees of freedom^[2] equal to the difference in the number of parameters estimated.

Let

D null = − 2 ln ⁡ likelihood of null model likelihood of the saturated model D fitted = − 2 ln ⁡ likelihood of fitted model likelihood of the saturated model . {\displaystyle {\begin{aligned}D_{\text{null}}&=-2\ln {\frac {\text{likelihood of null model}}{\text{likelihood of the saturated model}}}\\[6pt]D_{\text{fitted}}&=-2\ln {\frac {\text{likelihood of fitted model}}{\text{likelihood of the saturated model}}}.\end{aligned}}}

Then the difference of both is:

D null − D fitted = − 2 ( ln ⁡ likelihood of null model likelihood of the saturated model − ln ⁡ likelihood of fitted model likelihood of the saturated model ) = − 2 ln ⁡ ( likelihood of null model likelihood of the saturated model ) ( likelihood of fitted model likelihood of the saturated model ) = − 2 ln ⁡ likelihood of the null model likelihood of fitted model . {\displaystyle {\begin{aligned}D_{\text{null}}-D_{\text{fitted}}&=-2\left(\ln {\frac {\text{likelihood of null model}}{\text{likelihood of the saturated model}}}-\ln {\frac {\text{likelihood of fitted model}}{\text{likelihood of the saturated model}}}\right)\\[6pt]&=-2\ln {\frac {\left({\dfrac {\text{likelihood of null model}}{\text{likelihood of the saturated model}}}\right)}{\left({\dfrac {\text{likelihood of fitted model}}{\text{likelihood of the saturated model}}}\right)}}\\[6pt]&=-2\ln {\frac {\text{likelihood of the null model}}{\text{likelihood of fitted model}}}.\end{aligned}}}

If the model deviance is significantly smaller than the null deviance then one can conclude that the predictor or set of predictors significantly improve the model's fit. This is analogous to the F-test used in linear regression analysis to assess the significance of prediction.^[35]

In linear regression the squared multiple correlation, R² is used to assess goodness of fit as it represents the proportion of variance in the criterion that is explained by the predictors.^[35] In logistic regression analysis, there is no agreed upon analogous measure, but there are several competing measures each with limitations.^[35][36]

Four of the most commonly used indices and one less commonly used one are examined on this page:

• Likelihood ratio R²_L
• Cox and Snell R²_CS
• Nagelkerke R²_N
• McFadden R²_McF
• Tjur R²_T

The Hosmer–Lemeshow test uses a test statistic that asymptotically follows a χ 2 {\displaystyle \chi ^{2}} distribution to assess whether or not the observed event rates match expected event rates in subgroups of the model population. This test is considered to be obsolete by some statisticians because of its dependence on arbitrary binning of predicted probabilities and relative low power.^[37]

After fitting the model, it is likely that researchers will want to examine the contribution of individual predictors. To do so, they will want to examine the regression coefficients. In linear regression, the regression coefficients represent the change in the criterion for each unit change in the predictor.^[35] In logistic regression, however, the regression coefficients represent the change in the logit for each unit change in the predictor. Given that the logit is not intuitive, researchers are likely to focus on a predictor's effect on the exponential function of the regression coefficient – the odds ratio (see definition). In linear regression, the significance of a regression coefficient is assessed by computing a t test. In logistic regression, there are several different tests designed to assess the significance of an individual predictor, most notably the likelihood ratio test and the Wald statistic.

The likelihood-ratio test discussed above to assess model fit is also the recommended procedure to assess the contribution of individual "predictors" to a given model.^[2][26][35] In the case of a single predictor model, one simply compares the deviance of the predictor model with that of the null model on a chi-square distribution with a single degree of freedom. If the predictor model has significantly smaller deviance (c.f. chi-square using the difference in degrees of freedom of the two models), then one can conclude that there is a significant association between the "predictor" and the outcome. Although some common statistical packages (e.g. SPSS) do provide likelihood ratio test statistics, without this computationally intensive test it would be more difficult to assess the contribution of individual predictors in the multiple logistic regression case.^{[citation needed]} To assess the contribution of individual predictors one can enter the predictors hierarchically, comparing each new model with the previous to determine the contribution of each predictor.^[35] There is some debate among statisticians about the appropriateness of so-called "stepwise" procedures.^{[weasel words]} The fear is that they may not preserve nominal statistical properties and may become misleading.^[38]

Alternatively, when assessing the contribution of individual predictors in a given model, one may examine the significance of the Wald statistic. The Wald statistic, analogous to the t-test in linear regression, is used to assess the significance of coefficients. The Wald statistic is the ratio of the square of the regression coefficient to the square of the standard error of the coefficient and is asymptotically distributed as a chi-square distribution.^[26]

W j = β j 2 S E β j 2 {\displaystyle W_{j}={\frac {\beta _{j}^{2}}{SE_{\beta _{j}}^{2}}}}

Although several statistical packages (e.g., SPSS, SAS) report the Wald statistic to assess the contribution of individual predictors, the Wald statistic has limitations. When the regression coefficient is large, the standard error of the regression coefficient also tends to be larger increasing the probability of Type-II error. The Wald statistic also tends to be biased when data are sparse.^[35]

Suppose cases are rare. Then we might wish to sample them more frequently than their prevalence in the population. For example, suppose there is a disease that affects 1 person in 10,000 and to collect our data we need to do a complete physical. It may be too expensive to do thousands of physicals of healthy people in order to obtain data for only a few diseased individuals. Thus, we may evaluate more diseased individuals, perhaps all of the rare outcomes. This is also retrospective sampling, or equivalently it is called unbalanced data. As a rule of thumb, sampling controls at a rate of five times the number of cases will produce sufficient control data.^[39]

Logistic regression is unique in that it may be estimated on unbalanced data, rather than randomly sampled data, and still yield correct coefficient estimates of the effects of each independent variable on the outcome. That is to say, if we form a logistic model from such data, if the model is correct in the general population, the β j {\displaystyle \beta _{j}} parameters are all correct except for β 0 {\displaystyle \beta _{0}} . We can correct β 0 {\displaystyle \beta _{0}} if we know the true prevalence as follows:^[39]

β ^ 0 ∗ = β ^ 0 + log ⁡ π 1 − π − log ⁡ π ~ 1 − π ~ {\displaystyle {\widehat {\beta }}_{0}^{*}={\widehat {\beta }}_{0}+\log {\frac {\pi }{1-\pi }}-\log {{\tilde {\pi }} \over {1-{\tilde {\pi }}}}}

where π {\displaystyle \pi } is the true prevalence and π ~ {\displaystyle {\tilde {\pi }}} is the prevalence in the sample.

Like other forms of regression analysis, logistic regression makes use of one or more predictor variables that may be either continuous or categorical. Unlike ordinary linear regression, however, logistic regression is used for predicting dependent variables that take membership in one of a limited number of categories (treating the dependent variable in the binomial case as the outcome of a Bernoulli trial) rather than a continuous outcome. Given this difference, the assumptions of linear regression are violated. In particular, the residuals cannot be normally distributed. In addition, linear regression may make nonsensical predictions for a binary dependent variable. What is needed is a way to convert a binary variable into a continuous one that can take on any real value (negative or positive). To do that, binomial logistic regression first calculates the odds of the event happening for different levels of each independent variable, and then takes its logarithm to create a continuous criterion as a transformed version of the dependent variable. The logarithm of the odds is the logit of the probability, the logit is defined as follows: logit ⁡ p = ln ⁡ p 1 − p for  0 < p < 1 . {\displaystyle \operatorname {logit} p=\ln {\frac {p}{1-p}}\quad {\text{for }}0<p<1\,.}

Although the dependent variable in logistic regression is Bernoulli, the logit is on an unrestricted scale.^[2] The logit function is the link function in this kind of generalized linear model, i.e. logit ⁡ E ⁡ ( Y ) = β 0 + β 1 x {\displaystyle \operatorname {logit} \operatorname {\mathcal {E}} (Y)=\beta _{0}+\beta _{1}x}

Y is the Bernoulli-distributed response variable and x is the predictor variable; the β values are the linear parameters.

The logit of the probability of success is then fitted to the predictors. The predicted value of the logit is converted back into predicted odds, via the inverse of the natural logarithm – the exponential function. Thus, although the observed dependent variable in binary logistic regression is a 0-or-1 variable, the logistic regression estimates the odds, as a continuous variable, that the dependent variable is a 'success'. In some applications, the odds are all that is needed. In others, a specific yes-or-no prediction is needed for whether the dependent variable is or is not a 'success'; this categorical prediction can be based on the computed odds of success, with predicted odds above some chosen cutoff value being translated into a prediction of success.

In machine learning applications where logistic regression is used for binary classification, the MLE minimises the cross-entropy loss function.

Logistic regression is an important machine learning algorithm. The goal is to model the probability of a random variable Y {\displaystyle Y} being 0 or 1 given experimental data.^[40]

Consider a generalized linear model function parameterized by θ {\displaystyle \theta } ,

h θ ( X ) = 1 1 + e − θ T X = Pr ( Y = 1 ∣ X ; θ ) {\displaystyle h_{\theta }(X)={\frac {1}{1+e^{-\theta ^{T}X}}}=\Pr(Y=1\mid X;\theta )}

Therefore,

Pr ( Y = 0 ∣ X ; θ ) = 1 − h θ ( X ) {\displaystyle \Pr(Y=0\mid X;\theta )=1-h_{\theta }(X)}

and since Y ∈ { 0 , 1 } {\displaystyle Y\in \{0,1\}} , we see that Pr ( y ∣ X ; θ ) {\displaystyle \Pr(y\mid X;\theta )} is given by Pr ( y ∣ X ; θ ) = h θ ( X ) y ( 1 − h θ ( X ) ) ( 1 − y ) . {\displaystyle \Pr(y\mid X;\theta )=h_{\theta }(X)^{y}(1-h_{\theta }(X))^{(1-y)}.} We now calculate the likelihood function assuming that all the observations in the sample are independently Bernoulli distributed,

L ( θ ∣ y ; x ) = Pr ( Y ∣ X ; θ ) = ∏ i Pr ( y i ∣ x i ; θ ) = ∏ i h θ ( x i ) y i ( 1 − h θ ( x i ) ) ( 1 − y i ) {\displaystyle {\begin{aligned}L(\theta \mid y;x)&=\Pr(Y\mid X;\theta )\\&=\prod _{i}\Pr(y_{i}\mid x_{i};\theta )\\&=\prod _{i}h_{\theta }(x_{i})^{y_{i}}(1-h_{\theta }(x_{i}))^{(1-y_{i})}\end{aligned}}}

Typically, the log likelihood is maximized,

N − 1 log ⁡ L ( θ ∣ y ; x ) = N − 1 ∑ i = 1 N log ⁡ Pr ( y i ∣ x i ; θ ) {\displaystyle N^{-1}\log L(\theta \mid y;x)=N^{-1}\sum _{i=1}^{N}\log \Pr(y_{i}\mid x_{i};\theta )}

which is maximized using optimization techniques such as gradient descent.

Assuming the ( x , y ) {\displaystyle (x,y)} pairs are drawn uniformly from the underlying distribution, then in the limit of large N,

lim N → + ∞ N − 1 ∑ i = 1 N log ⁡ Pr ( y i ∣ x i ; θ ) = ∑ x ∈ X ∑ y ∈ Y Pr ( X = x , Y = y ) log ⁡ Pr ( Y = y ∣ X = x ; θ ) = ∑ x ∈ X ∑ y ∈ Y Pr ( X = x , Y = y ) ( − log ⁡ Pr ( Y = y ∣ X = x ) Pr ( Y = y ∣ X = x ; θ ) + log ⁡ Pr ( Y = y ∣ X = x ) ) = − D KL ( Y ∥ Y θ ) − H ( Y ∣ X ) {\displaystyle {\begin{aligned}&\lim \limits _{N\rightarrow +\infty }N^{-1}\sum _{i=1}^{N}\log \Pr(y_{i}\mid x_{i};\theta )=\sum _{x\in {\mathcal {X}}}\sum _{y\in {\mathcal {Y}}}\Pr(X=x,Y=y)\log \Pr(Y=y\mid X=x;\theta )\\[6pt]={}&\sum _{x\in {\mathcal {X}}}\sum _{y\in {\mathcal {Y}}}\Pr(X=x,Y=y)\left(-\log {\frac {\Pr(Y=y\mid X=x)}{\Pr(Y=y\mid X=x;\theta )}}+\log \Pr(Y=y\mid X=x)\right)\\[6pt]={}&-D_{\text{KL}}(Y\parallel Y_{\theta })-H(Y\mid X)\end{aligned}}}

where H ( Y ∣ X ) {\displaystyle H(Y\mid X)} is the conditional entropy and D KL {\displaystyle D_{\text{KL}}} is the Kullback–Leibler divergence. This leads to the intuition that by maximizing the log-likelihood of a model, you are minimizing the KL divergence of your model from the maximal entropy distribution. Intuitively searching for the model that makes the fewest assumptions in its parameters.

Logistic regression can be seen as a special case of the generalized linear model and thus analogous to linear regression. The model of logistic regression, however, is based on quite different assumptions (about the relationship between the dependent and independent variables) from those of linear regression. In particular, the key differences between these two models can be seen in the following two features of logistic regression. First, the conditional distribution y ∣ x {\displaystyle y\mid x} is a Bernoulli distribution rather than a Gaussian distribution, because the dependent variable is binary. Second, the predicted values are probabilities and are therefore restricted to (0,1) through the logistic distribution function because logistic regression predicts the probability of particular outcomes rather than the outcomes themselves.

A common alternative to the logistic model (logit model) is the probit model, as the related names suggest. From the perspective of generalized linear models, these differ in the choice of link function: the logistic model uses the logit function (inverse logistic function), while the probit model uses the probit function (inverse error function). Equivalently, in the latent variable interpretations of these two methods, the first assumes a standard logistic distribution of errors and the second a standard normal distribution of errors.^[41] Other sigmoid functions or error distributions can be used instead.

Logistic regression is an alternative to Fisher's 1936 method, linear discriminant analysis.^[42] If the assumptions of linear discriminant analysis hold, the conditioning can be reversed to produce logistic regression. The converse is not true, however, because logistic regression does not require the multivariate normal assumption of discriminant analysis.^[43]

The assumption of linear predictor effects can easily be relaxed using techniques such as spline functions.^[13]

A detailed history of the logistic regression is given in Cramer (2002). The logistic function was developed as a model of population growth and named "logistic" by Pierre François Verhulst in the 1830s and 1840s, under the guidance of Adolphe Quetelet; see Logistic function § History for details.^[44] In his earliest paper (1838), Verhulst did not specify how he fit the curves to the data.^[45][46] In his more detailed paper (1845), Verhulst determined the three parameters of the model by making the curve pass through three observed points, which yielded poor predictions.^[47][48]

The logistic function was independently developed in chemistry as a model of autocatalysis (Wilhelm Ostwald, 1883).^[49] An autocatalytic reaction is one in which one of the products is itself a catalyst for the same reaction, while the supply of one of the reactants is fixed. This naturally gives rise to the logistic equation for the same reason as population growth: the reaction is self-reinforcing but constrained.

The logistic function was independently rediscovered as a model of population growth in 1920 by Raymond Pearl and Lowell Reed, published as Pearl & Reed (1920), which led to its use in modern statistics. They were initially unaware of Verhulst's work and presumably learned about it from L. Gustave du Pasquier, but they gave him little credit and did not adopt his terminology.^[50] Verhulst's priority was acknowledged and the term "logistic" revived by Udny Yule in 1925 and has been followed since.^[51] Pearl and Reed first applied the model to the population of the United States, and also initially fitted the curve by making it pass through three points; as with Verhulst, this again yielded poor results.^[52]

In the 1930s, the probit model was developed and systematized by Chester Ittner Bliss, who coined the term "probit" in Bliss (1934), and by John Gaddum in Gaddum (1933), and the model fit by maximum likelihood estimation by Ronald A. Fisher in Fisher (1935), as an addendum to Bliss's work. The probit model was principally used in bioassay, and had been preceded by earlier work dating to 1860; see Probit model § History. The probit model influenced the subsequent development of the logit model and these models competed with each other.^[53]

The logistic model was likely first used as an alternative to the probit model in bioassay by Edwin Bidwell Wilson and his student Jane Worcester in Wilson & Worcester (1943).^[54] However, the development of the logistic model as a general alternative to the probit model was principally due to the work of Joseph Berkson over many decades, beginning in Berkson (1944), where he coined "logit", by analogy with "probit", and continuing through Berkson (1951) and following years.^[55] The logit model was initially dismissed as inferior to the probit model, but "gradually achieved an equal footing with the probit",^[56] particularly between 1960 and 1970. By 1970, the logit model achieved parity with the probit model in use in statistics journals and thereafter surpassed it. This relative popularity was due to the adoption of the logit outside of bioassay, rather than displacing the probit within bioassay, and its informal use in practice; the logit's popularity is credited to the logit model's computational simplicity, mathematical properties, and generality, allowing its use in varied fields.^[3]

Various refinements occurred during that time, notably by David Cox, as in Cox (1958).^[4]

The multinomial logit model was introduced independently in Cox (1966) and Theil (1969), which greatly increased the scope of application and the popularity of the logit model.^[57] In 1973 Daniel McFadden linked the multinomial logit to the theory of discrete choice, specifically Luce's choice axiom, showing that the multinomial logit followed from the assumption of independence of irrelevant alternatives and interpreting odds of alternatives as relative preferences;^[58] this gave a theoretical foundation for the logistic regression.^[57]

There are large numbers of extensions:

• Multinomial logistic regression (or multinomial logit) handles the case of a multi-way categorical dependent variable (with unordered values, also called "classification"). The general case of having dependent variables with more than two values is termed polytomous regression.
• Ordered logistic regression (or ordered logit) handles ordinal dependent variables (ordered values).
• Mixed logit is an extension of multinomial logit that allows for correlations among the choices of the dependent variable.
• An extension of the logistic model to sets of interdependent variables is the conditional random field.
• Conditional logistic regression handles matched or stratified data when the strata are small. It is mostly used in the analysis of observational studies.

• Logistic function
• Discrete choice
• Jarrow–Turnbull model
• Limited dependent variable
• Multinomial logit model
• Ordered logit
• Hosmer–Lemeshow test
• Brier score
• mlpack - contains a C++ implementation of logistic regression
• Local case-control sampling
• Logistic model tree

• Media related to Logistic regression at Wikimedia Commons
• Econometrics Lecture (topic: Logit model) on YouTube by Mark Thoma
• Logistic Regression tutorial
• mlelr: software in C for teaching purposes