# Power transform

In statistics, a power transform is a family of functions that are applied to create a monotonic transformation of data using power functions. This is a useful data transformation technique used to stabilize variance, make the data more normal distribution-like, improve the validity of measures of association such as the Pearson correlation between variables and for other data stabilization procedures.

## Definition

The power transformation is defined as a continuously varying function, with respect to the power parameter λ, in a piece-wise function form that makes it continuous at the point of singularity (λ = 0). For data vectors (y1,..., yn) in which each yi > 0, the power transform is

$y_{i}^{(\lambda )}={\begin{cases}{\dfrac {y_{i}^{\lambda }-1}{\lambda (\operatorname {GM} (y))^{\lambda -1}}},&{\text{if }}\lambda \neq 0\\[12pt]\operatorname {GM} (y)\ln {y_{i}},&{\text{if }}\lambda =0\end{cases}}$ where

$\operatorname {GM} (y)=(y_{1}\cdots y_{n})^{1/n}\,$ is the geometric mean of the observations y1, ..., yn. The case for $\lambda =0$ is the limit as $\lambda$ approaches 0. To see this, note that $y_{i}^{\lambda }$ = $\operatorname {exp} ({\lambda \operatorname {log} (y_{i})})=1+\lambda \operatorname {log} (y_{i})+O((\lambda \operatorname {log} (y_{i}))^{2})$ . Then ${\dfrac {y_{i}^{\lambda }-1}{\lambda }}$ = $\operatorname {log} (y_{i})+O(\lambda )$ , and everything but $\operatorname {log} (y_{i})$ becomes negligible for $\lambda$ sufficiently small.

The inclusion of the (λ − 1)th power of the geometric mean in the denominator simplifies the scientific interpretation of any equation involving $y_{i}^{(\lambda )}$ , because the units of measurement do not change as λ changes.

Box and Cox (1964) introduced the geometric mean into this transformation by first including the Jacobian of rescaled power transformation

${\dfrac {y^{\lambda }-1}{\lambda }}$ .

with the likelihood. This Jacobian is as follows:

$J(\lambda ;y_{1},...,y_{n})=\prod _{i=1}^{n}|dy_{i}^{(\lambda )}/dy|=\prod _{i=1}^{n}y_{i}^{\lambda -1}=\operatorname {GM} (y)^{n(\lambda -1)}$ This allows the normal log likelihood at its maximum to be written as follows:

$\log({\mathcal {L}}({\hat {\mu }},{\hat {\sigma }}))=(-n/2)(\log(2\pi {\hat {\sigma }}^{2})+1)+n(\lambda -1)\log(\operatorname {GM} (y))$ $=(-n/2)(\log(2\pi {\hat {\sigma }}^{2}/\operatorname {GM} (y)^{2(\lambda -1)})+1).$ From here, absorbing $\operatorname {GM} (y)^{2(\lambda -1)}$ into the expression for ${\hat {\sigma }}^{2}$ produces an expression that establishes that minimizing the sum of squares of residuals from $y_{i}^{(\lambda )}$ is equivalent to maximizing the sum of the normal log likelihood of deviations from $(y^{\lambda }-1)/\lambda$ and the log of the Jacobian of the transformation.

The value at Y = 1 for any λ is 0, and the derivative with respect to Y there is 1 for any λ. Sometimes Y is a version of some other variable scaled to give Y = 1 at some sort of average value.

The transformation is a power transformation, but done in such a way as to make it continuous with the parameter λ at λ = 0. It has proved popular in regression analysis, including econometrics.

Box and Cox also proposed a more general form of the transformation that incorporates a shift parameter.

$\tau (y_{i};\lambda ,\alpha )={\begin{cases}{\dfrac {(y_{i}+\alpha )^{\lambda }-1}{\lambda (\operatorname {GM} (y+\alpha ))^{\lambda -1}}}&{\text{if }}\lambda \neq 0,\\\\\operatorname {GM} (y+\alpha )\ln(y_{i}+\alpha )&{\text{if }}\lambda =0,\end{cases}}$ which holds if yi + α > 0 for all i. If τ(Y, λ, α) follows a truncated normal distribution, then Y is said to follow a Box–Cox distribution.

Bickel and Doksum eliminated the need to use a truncated distribution by extending the range of the transformation to all y, as follows:

$\tau (y_{i};\lambda ,\alpha )={\begin{cases}{\dfrac {\operatorname {sgn} (y_{i}+\alpha )|y_{i}+\alpha |^{\lambda }-1}{\lambda (\operatorname {GM} (y+\alpha ))^{\lambda -1}}}&{\text{if }}\lambda \neq 0,\\\\\operatorname {GM} (y+\alpha )\operatorname {sgn} (y+\alpha )\ln(y_{i}+\alpha )&{\text{if }}\lambda =0,\end{cases}}$ ,

where sgn(.) is the sign function. This change in definition has little practical import as long as $\alpha$ is less than $\operatorname {min} (y_{i})$ , which it usually is.

Bickel and Doksum also proved that the parameter estimates are consistent and asymptotically normal under appropriate regularity conditions, though the standard Cramér–Rao lower bound can substantially underestimate the variance when parameter values are small relative to the noise variance. However, this problem of underestimating the variance may not be a substantive problem in many applications.

## Box–Cox transformation

The one-parameter Box–Cox transformations are defined as

$y_{i}^{(\lambda )}={\begin{cases}{\dfrac {y_{i}^{\lambda }-1}{\lambda }}&{\text{if }}\lambda \neq 0,\\\ln y_{i}&{\text{if }}\lambda =0,\end{cases}}$ and the two-parameter Box–Cox transformations as

$y_{i}^{({\boldsymbol {\lambda }})}={\begin{cases}{\dfrac {(y_{i}+\lambda _{2})^{\lambda _{1}}-1}{\lambda _{1}}}&{\text{if }}\lambda _{1}\neq 0,\\\ln(y_{i}+\lambda _{2})&{\text{if }}\lambda _{1}=0,\end{cases}}$ as described in the original article. Moreover, the first transformations hold for $y_{i}>0$ , and the second for $y_{i}>-\lambda _{2}$ .

The parameter $\lambda$ is estimated using the profile likelihood function.

## Confidence interval

Confidence interval for the Box–Cox transformation can be asymptotically constructed using Wilks's theorem on the profile likelihood function to find all the possible values of $\lambda$ that fulfill the following restriction:

$\ln {\big (}L(\lambda ){\big )}\geq \ln {\big (}L({\hat {\lambda }}){\big )}-{\frac {1}{2}}{\chi ^{2}}_{1,1-\alpha }.$ ## Example

The BUPA liver data set contains data on liver enzymes ALT and γGT. Suppose we are interested in using log(γGT) to predict ALT. A plot of the data appears in panel (a) of the figure. There appears to be non-constant variance, and a Box–Cox transformation might help.

The log-likelihood of the power parameter appears in panel (b). The horizontal reference line is at a distance of χ12/2 from the maximum and can be used to read off an approximate 95% confidence interval for λ. It appears as though a value close to zero would be good, so we take logs.

Possibly, the transformation could be improved by adding a shift parameter to the log transformation. Panel (c) of the figure shows the log-likelihood. In this case, the maximum of the likelihood is close to zero suggesting that a shift parameter is not needed. The final panel shows the transformed data with a superimposed regression line.

Note that although Box–Cox transformations can make big improvements in model fit, there are some issues that the transformation cannot help with. In the current example, the data are rather heavy-tailed so that the assumption of normality is not realistic and a robust regression approach leads to a more precise model.

## Econometric application

Economists often characterize production relationships by some variant of the Box–Cox transformation.

Consider a common representation of production Q as dependent on services provided by a capital stock K and by labor hours N:

$\tau (Q)=\alpha \tau (K)+(1-\alpha )\tau (N).\,$ Solving for Q by inverting the Box–Cox transformation we find

$Q={\big (}\alpha K^{\lambda }+(1-\alpha )N^{\lambda }{\big )}^{1/\lambda },\,$ which is known as the constant elasticity of substitution (CES) production function.

The CES production function is a homogeneous function of degree one.

When λ = 1, this produces the linear production function:

$Q=\alpha K+(1-\alpha )N.\,$ When λ → 0 this produces the famous Cobb–Douglas production function:

$Q=K^{\alpha }N^{1-\alpha }.\,$ ## Activities and demonstrations

The SOCR resource pages contain a number of hands-on interactive activities demonstrating the Box–Cox (power) transformation using Java applets and charts. These directly illustrate the effects of this transform on Q-Q plots, X-Y scatterplots, time-series plots and histograms.

## Yeo–Johnson transformation

The Yeo–Johnson transformation  allows also for zero and negative values of $y$ . $\lambda$ can be any real number, where $\lambda =1$ produces the identity transformation. The transformation law reads:

$y_{i}^{(\lambda )}={\begin{cases}((y_{i}+1)^{\lambda }-1)/\lambda &{\text{if }}\lambda \neq 0,y\geq 0\\\log(y_{i}+1)&{\text{if }}\lambda =0,y\geq 0\\-[(-y_{i}+1)^{(2-\lambda )}-1]/(2-\lambda )&{\text{if }}\lambda \neq 2,y<0\\-\log(-y_{i}+1)&{\text{if }}\lambda =2,y<0\end{cases}}$ 