Preprint
Article

This version is not peer-reviewed.

Affine Invisibility and Weak Identification in Correlation-Based Transformation Selection

Submitted:

06 October 2026

Posted:

09 October 2026

You are already at the latest version

Abstract
Correlation-based criteria are often used to select transformations that improve linear association on a transformed scale. This paper studies a structural limitation of such criteria in general parametric transformation families. We show that Pearson correlation is locally insensitive to the affine component of any infinitesimal perturbation of a transformed variable: the local derivative depends only on the residual component after projection onto the span of the constant function and the current transformed variable. We call this phenomenon affine invisibility. It provides a general mechanism for weak local discrimination and, when low visibility persists over parameter regions, for weak identification under correlation-based selection. The theory is developed for general smooth transformation paths and specialized to log-polynomial transformation classes. The Box–Cox transformation is reinterpreted as a one-dimensional path in function space whose tangent directions are combinations of log-polynomial components. Analytical illustrations quantify scale-free local visibility for log-polynomial directions and along the Box–Cox path, providing a concrete instance of the broader geometric framework. The results suggest that correlation maximization should be accompanied by local-visibility and near-optimality diagnostics before selected transformation parameters are interpreted as well identified.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

Parametric transformations are widely used to reduce skewness, stabilize variance, improve approximate normality, or linearize relationships between variables. Classical examples include logarithmic and power transformations, the Box–Cox family, and related transformation classes [1,2,3]. In exploratory analysis and model building, transformation parameters may also be selected by maximizing Pearson correlation, the coefficient of determination, or another criterion based on linear association [4,5]. A direct example is the Box–Cox linearity plot, which selects the transformation parameter by maximizing the correlation between a response and a transformed predictor [6]. Correlation maximization also underlies probability-plot correlation coefficient methods [7]; in a Box–Cox flood-frequency application, Lye [8] proposed selecting λ by maximizing the corresponding probability-plot correlation. This paper studies the identification properties of such correlation-based selection. The question is not whether correlation maximization should replace likelihood-based estimation when a well-specified likelihood is available. Rather, we ask how informative Pearson correlation is as a functional for distinguishing among transformation parameters. Distinct parameter values may produce nearly identical correlation values, so a maximizing parameter need not be strongly identified by the criterion.
The mechanism is geometric and follows from the local invariance of Pearson correlation under additive shifts and positive rescalings. Let
U θ = T θ ( X ) , V η = S η ( Y ) ,
and consider a parameter-space direction inducing the functional tangent T ˙ θ , a ( X ) . If
T ˙ θ , a ( X ) = α a + β a U θ + R a , R a ⊥ span { 1 , U θ } ,
then the affine component is locally invisible to Pearson correlation and the directional derivative depends only on the residual component:
D a ρ ( θ , η ) = Cov ( R a , V η ) σ U θ σ V η .
We refer to this property as affine invisibility. It provides a direct mechanism for weak local discrimination: if admissible perturbations are nearly affine in the current transformed scale, or if their non-affine residuals have little alignment with the other transformed variable, the correlation criterion has little first-order ability to discriminate among nearby parameter values. When such low visibility persists over a nontrivial parameter region, it can contribute to weak identification in the criterion-specific sense developed below.
The general result is then examined through log-polynomial directions. Their role is motivated by the Box–Cox family, whose expansion around the logarithmic case is
x λ − 1 λ = log x + λ 2 ( log x ) 2 + λ 2 6 ( log x ) 3 + λ 3 24 ( log x ) 4 + … .
Thus, the Box–Cox path generates successive powers of log x as its natural local functional directions. This representation allows the general geometric result to be studied componentwise and along the full Box–Cox path, without treating the Box–Cox family as an isolated special case.
The paper makes three contributions. First, it derives the directional sensitivity of Pearson correlation for general smooth transformation paths. Second, it identifies the non-affine residual of the induced functional tangent as the only component contributing to first-order correlation sensitivity. Third, it develops complementary local-visibility and near-optimality diagnostics, illustrating the former for log-polynomial directions and along the Box–Cox path, where scale-free visibility is maximal at the logarithmic case λ = 0 and decreases as | λ | increases over the range considered. Together, these diagnostics distinguish local insensitivity from global flatness of the correlation objective and provide a practical way to assess whether a correlation-selected transformation parameter is strongly or weakly identified.
The remainder of the paper develops the general correlation-based framework, derives the affine-invisibility result, discusses its implications for weak identification, specializes the analysis to log-polynomial and Box–Cox transformations, and presents analytical illustrations.

2. Correlation-Based Transformation Selection

Let X and Y be real-valued random variables defined on a common probability space ( Ω , F , P ) , and let
U θ = T θ ( X ) , V η = S η ( Y ) ,
where θ ∈ Θ ⊆ R p and η ∈ E ⊆ R q . Throughout the paper, transformed variables and functional perturbations are regarded as elements of the common Hilbert space L 2 ( P ) . Functions depending only on X or only on Y may be identified with the corresponding closed subspaces of L 2 ( P ) . The inner product is
〈 A , B 〉 L 2 ( P ) = E ( A B ) .
For centered elements, the L 2 inner product coincides with covariance. Orthogonality and projection are understood with respect to this L 2 geometry. We assume that the transformed variables have finite, non-zero variances over the parameter region under study. A correlation-based transformation rule selects parameters by maximizing
( θ ^ , η ^ ) ∈ arg max θ ∈ Θ , η ∈ E ρ 2 ( θ , η ) ,
where
ρ ( θ , η ) = Corr { T θ ( X ) , S η ( Y ) } .
Empirically, ρ is replaced by sample correlation and the criterion is evaluated over a parameter grid or by numerical optimization.
The criterion is attractive when transformations are chosen to improve a linear representation of dependence [2,5], but it uses only a standardized measure of linear association. It is therefore not equivalent to likelihood-based estimation and need not identify transformation parameters sharply. A high maximizing correlation may coexist with many alternative parameter values producing nearly the same objective value.
For ε > 0 , define the near-optimal set
N ε = ( θ , η ) ∈ Θ × E : ρ max 2 − ρ 2 ( θ , η ) ≤ ε ,
with
ρ max 2 = sup θ ∈ Θ , η ∈ E ρ 2 ( θ , η ) .
A broad or elongated N ε indicates that the criterion provides weak discrimination among competing transformation parameters. Accordingly, we use the following criterion-specific notion.
Definition 1
(Weak identification under correlation-based selection). A transformation parameter is weakly identified by the correlation criterion when substantially different parameter values yield nearly indistinguishable values of ρ 2 ( θ , η ) , producing broad near-optimal regions of the objective surface.
This notion concerns identification by the correlation criterion itself, not intrinsic identification in a fully specified statistical model. It is therefore distinct from the formal weak-identification asymptotics developed, for example, for instrumental-variable and generalized-method-of-moments settings [9,10]. Here the term refers specifically to weak discrimination among transformation parameters by the correlation objective. The next section shows that such weak discrimination has a simple local geometric source: Pearson correlation is insensitive to the affine component of an induced functional perturbation, so only its non-affine residual can affect the criterion to first order.

3. Affine Invisibility of Pearson Correlation

Let
U θ = T θ ( X ) , V η = S η ( Y ) , ρ ( θ , η ) = Corr ( U θ , V η ) ,
and consider a perturbation of T θ , with S η fixed. For a parameter-space direction a ∈ R p , define the induced functional tangent
T ˙ θ , a ( X ) = d d t T θ + t a ( X ) t = 0 ,
assuming existence in L 2 ( P ) .
Project this tangent onto the subspace generated by the constant function and the current transformed variable. Thus,
T ˙ θ , a ( X ) = α θ , a + β θ , a U θ + R θ , a ( X ) ,
where
E { R θ , a ( X ) } = 0 , Cov { R θ , a ( X ) , U θ } = 0 .
The first two terms form the affine component of the perturbation; the residual R θ , a is its component orthogonal to span { 1 , U θ } .
It is useful to make explicit the functional-analytic structure behind this decomposition. For fixed V η , define the Pearson-correlation functional
R V η ( U ) = Corr ( U , V η ) ,
on the subset of L 2 ( P ) consisting of non-degenerate U. This functional is not linear, because its normalization depends on σ U . However, at a fixed U θ , its derivative is a linear functional of the perturbation direction H ∈ L 2 ( P ) , defined by
D R V η ( U θ ) [ H ] = d d t Corr ( U θ + t H , V η ) t = 0 .
A direct calculation gives
D R V η ( U θ ) [ H ] = Cov ( H , V η ) σ U θ σ V η − ρ ( θ , η ) Cov ( H , U θ ) σ U θ 2 .
Thus the directional derivative induced by the parameter-space direction a can be written as the composition
D a ρ ( θ , η ) = D R V η ( U θ ) T ˙ θ , a ( X ) .
Moreover, every affine perturbation H = α + β U θ belongs to the kernel of this derivative:
D R V η ( U θ ) [ H ] = 0 .
Equivalently,
span { 1 , U θ } ⊆ ker D R V η ( U θ ) .
The proposition below expresses the same fact through the orthogonal residual of the induced functional tangent.
Proposition 1
(Affine invisibility of Pearson correlation). Assume that U θ and V η have finite, non-zero variances and that differentiation under the expectation sign is justified. Then
D a ρ ( θ , η ) = Cov { R θ , a ( X ) , V η } σ U θ σ V η ,
where σ U θ 2 = Var ( U θ ) and σ V η 2 = Var ( V η ) . Consequently,
D a ρ 2 ( θ , η ) = 2 ρ ( θ , η ) Cov { R θ , a ( X ) , V η } σ U θ σ V η .
Proof. 
Write U = U θ , V = V η , and U ˙ = T ˙ θ , a ( X ) . Differentiation of ρ = Cov ( U , V ) / ( σ U σ V ) with respect to the perturbation of U gives
D a ρ = Cov ( U ˙ , V ) σ U σ V − ρ Cov ( U ˙ , U ) σ U 2 .
Using (4) and the orthogonality of R θ , a ,
Cov ( U ˙ , V ) = β θ , a Cov ( U , V ) + Cov ( R θ , a , V ) , Cov ( U ˙ , U ) = β θ , a σ U 2 .
The terms involving β θ , a cancel, yielding (6); the expression for ρ 2 follows from the chain rule. □
Equation (6) is the key structural result: the affine part of an induced perturbation is locally invisible to Pearson correlation. In particular, if T ˙ θ , a ( X ) = α θ , a + β θ , a U θ , then R θ , a = 0 and hence D a ρ ( θ , η ) = 0 .
The same argument applies when the second transformation is perturbed. If b ∈ R q and
S ˙ η , b ( Y ) = γ η , b + δ η , b V η + Q η , b ( Y ) , Q η , b ⊥ span { 1 , V η } ,
then
D b ρ ( θ , η ) = Cov { U θ , Q η , b ( Y ) } σ U θ σ V η .
Thus affine invisibility is intrinsic to Pearson correlation and does not depend on which variable is transformed.
Corollary 1
(A sharpened local sensitivity bound). Under the assumptions of Proposition 1,
| D a ρ ( θ , η ) | ≤ 1 − ρ 2 ( θ , η ) ∥ R θ , a ( X ) ∥ 2 σ U θ ,
and therefore
| D a ρ 2 ( θ , η ) | ≤ 2 | ρ ( θ , η ) | 1 − ρ 2 ( θ , η ) ∥ R θ , a ( X ) ∥ 2 σ U θ ≤ ∥ R θ , a ( X ) ∥ 2 σ U θ .
Proof. 
Let U = U θ , V = V η , and define the component of the centered response orthogonal to the centered transformed predictor by
V ⊥ = V − E V − Cov ( U , V ) Var ( U ) U − E U .
Because R θ , a is centered and orthogonal to U,
Cov ( R θ , a , V ) = Cov ( R θ , a , V ⊥ ) .
Moreover,
∥ V ⊥ ∥ 2 = σ V 1 − ρ 2 ( θ , η ) .
Applying Cauchy–Schwarz in (6) gives (9). The first inequality in (10) follows from the chain rule, and the second uses 2 r 1 − r 2 ≤ 1 for 0 ≤ r ≤ 1 . □
The corollary quantifies the local discrimination mechanism: if the residual component R θ , a is small in L 2 ( P ) , the correlation criterion can vary only weakly in direction a, even when the transformation itself changes appreciably. First-order insensitivity at a single parameter value is not, by itself, evidence of weak identification: at any differentiable interior maximum, all first-order directional derivatives vanish. What matters for weak discrimination over a parameter region is whether low visibility persists away from a single stationary point. The next section makes this distinction explicit and gives a pathwise bound linking persistent local invisibility to global variation of the criterion.

4. Weak Identification in Parametric Transformation Families

The affine invisibility result yields a direct local mechanism for weak discrimination. Let
C ( θ , η ) = ρ 2 ( θ , η ) = Corr 2 { T θ ( X ) , S η ( Y ) } .
For a perturbation of θ in a unit direction a, with η fixed, Proposition 1 gives
D a C ( θ , η ) = 2 ρ ( θ , η ) Cov { R θ , a ( X ) , V η } σ U θ σ V η .
Hence the squared-correlation criterion is locally insensitive in direction a whenever the non-affine residual R θ , a is small, or when it is nearly orthogonal to V η . The first mechanism concerns the geometry of the transformation path; the second concerns its alignment with the transformed response.
A useful direction-specific diagnostic is
V θ ( a ) = ∥ R θ , a ( X ) ∥ 2 σ U θ .
By Corollary 1,
| D a C ( θ , η ) | ≤ 2 | ρ ( θ , η ) | 1 − ρ 2 ( θ , η ) V θ ( a ) ≤ V θ ( a ) .
Thus V θ ( a ) = 0 corresponds to a purely affine tangent and therefore complete first-order invisibility, while small values indicate weak local visibility of the corresponding parameter-space direction. The same construction applies symmetrically to perturbations of the second transformation.
Corollary 2
(Pathwise discrimination bound). Let t ↦ θ ( t ) , t ∈ [ t 0 , t 1 ] , be a continuously differentiable parameter path, with η fixed, and suppose the assumptions of Proposition 1 hold along the path. Then
C { θ ( t 1 ) , η } − C { θ ( t 0 ) , η } ≤ ∫ t 0 t 1 V θ ( t ) θ ˙ ( t ) d t .
Proof. 
By the chain rule and (13),
d d t C { θ ( t ) , η } ≤ V θ ( t ) θ ˙ ( t ) .
Integration over [ t 0 , t 1 ] gives (14). □
Corollary 2 provides the desired bridge from local geometry to discrimination over a finite parameter region. Let a ( t ) = θ ˙ ( t ) / ∥ θ ˙ ( t ) ∥ whenever θ ˙ ( t ) ≠ 0 , and suppose that, for some δ ≥ 0 ,
V θ ( t ) a ( t ) ≤ δ
at every point where the unit tangent is defined. By homogeneity of V θ in the direction argument, the change in C between t 0 and any t ∈ [ t 0 , t 1 ] is at most δ L ( t ) , where L ( t ) = ∫ t 0 t ∥ θ ˙ ( s ) ∥ d s is the Euclidean length of that path segment. More specifically, if the starting point satisfies ρ max 2 − C { θ ( t 0 ) , η } ≤ ε 0 for some ε 0 ≥ 0 , then
ρ max 2 − C { θ ( t ) , η } ≤ ε 0 + δ L ( t ) , t ∈ [ t 0 , t 1 ] .
Hence ( θ ( t ) , η ) ∈ N ε for every ε > 0 such that ε ≥ ε 0 + δ L ( t ) . In particular, the whole path belongs to N ε whenever ε ≥ ε 0 + δ L ( t 1 ) . This explicitly links persistent low visibility along a path starting near the global maximum to an extended near-optimal region.
For comparisons across tangent directions with different magnitudes, it is useful to remove the scale of the tangent itself. Whenever T ˙ θ , a ( X ) is non-constant, define the scale-free local visibility
V ˜ θ ( a ) = ∥ R θ , a ( X ) ∥ 2 ∥ T ˙ θ , a ( X ) − E [ T ˙ θ , a ( X ) ] ∥ 2 .
Because R θ , a is an orthogonal projection residual, 0 ≤ V ˜ θ ( a ) ≤ 1 . This normalized quantity measures the fraction of the L 2 -norm of the centered tangent that remains outside its best affine approximation in the current transformed scale, and is invariant to non-zero rescaling of the tangent direction. It is related to V θ ( a ) by
V θ ( a ) = V ˜ θ ( a ) ∥ T ˙ θ , a ( X ) − E [ T ˙ θ , a ( X ) ] ∥ 2 σ U θ .
Two transformation parameters can yield nearly identical values of C ( θ , η ) while producing structurally different nonlinear mappings, so correlation-based equivalence is weaker than transformation equivalence. A parameter weakly identified by correlation may also be better identified by a likelihood criterion, which can exploit distributional shape, Jacobian terms, tail behaviour, and other information discarded by Pearson correlation.

5. Log-Polynomial Transformations and the Box–Cox Path

We now specialize the general affine-invisibility framework to log-polynomial transformations, which provide a natural representation of the Box–Cox family around the logarithmic scale. For x > 0 , let z = log x and consider
T a ( x ) = ∑ k = 0 p a k ( log x ) k , a ∈ R p + 1 .
For a coefficient-space direction u = ( u 0 , … , u p ) ⊤ , the path a ( t ) = a + t u induces the functional tangent
T ˙ a , u ( x ) = ∑ k = 0 p u k ( log x ) k .
In particular, the coordinate directions are themselves tangent directions, since
∂ T a ( x ) ∂ a k = ( log x ) k .
Thus the log-polynomial family is genuinely multiparametric: at a fixed parameter value a, its tangent space is generated by the coordinate directions
1 , log x , ( log x ) 2 , … , ( log x ) p ,
and a general parameter-space direction produces a linear combination of them. At the logarithmic baseline, the directions associated with the constant and linear terms are affine in U = log X and are therefore invisible to correlation to first order; this is why the analytical illustration below focuses on the directions k ≥ 2 .
The Box–Cox family,
g λ ( x ) = x λ − 1 λ , λ ≠ 0 , log x , λ = 0 ,
is naturally embedded in this representation. Since x λ = exp { λ log x } ,
g λ ( x ) = log x + λ 2 ( log x ) 2 + λ 2 6 ( log x ) 3 + λ 3 24 ( log x ) 4 + O ( λ 4 ) ,
and, more generally,
g λ ( x ) = ∑ r = 1 ∞ λ r − 1 r ! ( log x ) r .
Thus the Box–Cox family is a one-dimensional path in the log-polynomial function space: the powers of log x are not independent Box–Cox parameter directions, but enter in the particular combination imposed by λ . Near λ = 0 , the first-order departure from the logarithmic transformation is in the direction ( log x ) 2 / 2 ; higher-order terms enter with progressively smaller Taylor coefficients, although their effective contribution remains distribution-dependent through the magnitude of | log X | .
At the logarithmic case,
∂ g λ ( x ) ∂ λ λ = 0 = 1 2 ( log x ) 2 .
Therefore the first-order sensitivity of a correlation criterion to the Box–Cox parameter at λ = 0 is determined by the residual of ( log X ) 2 / 2 after projection onto span { 1 , log X } .
For λ ≠ 0 ,
∂ g λ ( x ) ∂ λ = λ x λ log x − x λ + 1 λ 2 .
Accordingly, the local sensitivity of
Corr { g λ X ( X ) , g λ Y ( Y ) }
with respect to λ X depends only on the residual component of ∂ g λ X ( X ) / ∂ λ X after projection onto span { 1 , g λ X ( X ) } , with the analogous statement holding for λ Y . Hence affine invisibility provides a direct local mechanism that can contribute to weak identification of Box–Cox parameters under correlation-based selection; it is not a peculiarity of the Box–Cox formula itself.

6. Analytical Illustrations

We illustrate the scale-free local-visibility diagnostic introduced in (16). The benchmark design is
Z = log X ∼ N ( 0 , 1 ) , X = exp ( Z ) .
This benchmark is sufficient for studying the geometry of transformation tangents because local visibility depends only on the marginal distribution of X and the transformation path. By contrast, near-optimal regions also depend on the joint law of X and Y, the transformation applied to Y, and the parameter grid. We therefore keep near-optimality as the global diagnostic defined in Section 2, while the present analytical section focuses on the marginally defined visibility measure.

6.1. Log-Polynomial Directions

At the logarithmic baseline
a 0 = ( 0 , 1 , 0 , … , 0 ) , T a 0 ( X ) = log X = : U ,
consider the coordinate tangent directions
ϕ k ( X ) = ∂ T a ( X ) ∂ a k a = a 0 = ( log X ) k , k = 2 , … , 6 .
Thus the quantities below measure the visibility of individual coordinate tangent directions at the logarithmic baseline; they are not visibility measures for the whole log-polynomial family away from that baseline. Writing
ϕ k ( X ) = α k + β k U + R k ( X ) , R k ⊥ span { 1 , U } ,
we use the scale-free normalized local visibility from (16),
ν k = ∥ R k ( X ) ∥ 2 ∥ ϕ k ( X ) − E ϕ k ( X ) ∥ 2 = 1 − Corr ( ϕ k ( X ) , U ) 2 .
Under Z ∼ N ( 0 , 1 ) , these quantities can be evaluated exactly from Gaussian moments. For even k, symmetry gives Corr ( Z k , Z ) = 0 , hence ν k = 1 . For odd k,
ν k 2 = 1 − { E ( Z k + 1 ) } 2 E ( Z 2 ) E ( Z 2 k ) ,
because E ( Z k ) = 0 . Table 1 reports the exact population values for k = 2 , … , 6 .
Visibility is therefore strongly direction-dependent. In this benchmark, at the logarithmic baseline, the even-degree coordinate directions are fully non-affine relative to the logarithmic scale, whereas the degree-three direction is substantially less visible. These values are distribution-dependent and should not be regarded as universal constants.

6.2. The Box–Cox Path

Along the Box–Cox path, the single tangent ∂ g λ ( X ) / ∂ λ changes its representation in log-polynomial powers with λ . Its local visibility is therefore evaluated relative to the current transformed variable g λ ( X ) . The scale-free normalized visibility is
ν BC ( λ ) = I − Π span { 1 , g λ ( X ) } ∂ g λ ( X ) ∂ λ 2 ∂ g λ ( X ) ∂ λ − E ∂ g λ ( X ) ∂ λ 2 .
Under the benchmark Z = log X ∼ N ( 0 , 1 ) , this profile can also be computed exactly. For λ ≠ 0 , write the Box–Cox transform and its tangent, up to irrelevant affine rescaling, as
A λ = e λ Z , B λ = e λ Z ( λ Z − 1 ) .
Indeed,
g λ ( X ) = e λ Z − 1 λ = A λ − 1 λ ,
while
∂ g λ ( X ) ∂ λ = λ e λ Z Z − e λ Z + 1 λ 2 = B λ + 1 λ 2 .
Thus g λ ( X ) and its tangent differ from A λ and B λ , respectively, only by affine transformations, which do not affect squared correlation. Hence
ν BC ( λ ) = 1 − Corr 2 ( A λ , B λ ) .
Let t = λ 2 . The required moments follow from the Gaussian moment-generating function:
Var ( A λ ) = e 2 t − e t , Cov ( A λ , B λ ) = ( 2 t − 1 ) e 2 t − ( t − 1 ) e t , Var ( B λ ) = ( 4 t 2 − 3 t + 1 ) e 2 t − ( t − 1 ) 2 e t .
Hence the visibility profile is an exact even function of λ . At λ = 0 , continuity gives g 0 ( X ) = Z and ∂ g λ ( X ) / ∂ λ | λ = 0 = Z 2 / 2 , so that ν BC ( 0 ) = 1 .
For the Box–Cox family, scale-free local visibility is maximal at λ = 0 , corresponding to the logarithmic transformation, and decreases as | λ | increases over the range considered. Thus, the Box–Cox tangent becomes progressively more aligned with its best affine approximation in the current transformed scale. This provides a concrete illustration of how the geometric composition of a transformation tangent can vary along a parametric path.
Table 2. Exact scale-free local visibility along the Box–Cox path under log X ∼ N ( 0 , 1 ) .
Table 2. Exact scale-free local visibility along the Box–Cox path under log X ∼ N ( 0 , 1 ) .
| λ | ν BC ( λ )
0.0 1.000000
0.5 0.695443
1.0 0.457178
1.5 0.339629
2.0 0.264683
Figure 1. Exact scale-free local visibility of the Box–Cox tangent under log X ∼ N ( 0 , 1 ) . The profile is symmetric about λ = 0 , reaches its maximum value 1 at the logarithmic case, and decreases as | λ | increases over the interval [ − 2 , 2 ] .
Figure 1. Exact scale-free local visibility of the Box–Cox tangent under log X ∼ N ( 0 , 1 ) . The profile is symmetric about λ = 0 , reaches its maximum value 1 at the logarithmic case, and decreases as | λ | increases over the interval [ − 2 , 2 ] .
Preprints 236907 g001
The profile is symmetric by construction because the closed-form expression depends on λ only through t = λ 2 . Over [ − 2 , 2 ] , the scale-free visibility decreases from 1 at λ = 0 to approximately 0.2647 at | λ | = 2 . Thus, at | λ | = 2 , the residual norm is approximately 26.5 % of the norm of the centered tangent. Equivalently, since ν BC ( 2 ) 2 ≈ 0.0701 , about 7 % of the centered tangent variance remains outside its best affine approximation in the current Box–Cox scale.
Taken together, the analytical results show that local visibility depends strongly on both the functional direction and the position along the transformation path. These are local geometric properties of the criterion and do not, by themselves, imply global weak identification. Global weak identification depends on the geometry of the full correlation surface, in particular on the extent of its near-optimal region, and should therefore be assessed under a fully specified joint model or empirical design.

7. Discussion and Conclusions

The results clarify a structural limitation of correlation-based transformation selection. A high maximizing correlation value does not by itself imply sharp identification of the maximizing transformation parameter. The local sensitivity of Pearson correlation depends only on the component of the induced functional tangent that remains after projection onto span { 1 , U θ } . Affine components are invisible to the criterion, so transformations that differ substantially as functions may still be difficult to distinguish through standardized linear association alone.
This distinction is relevant in practice because correlation-based equivalence is weaker than transformation equivalence. Competing transformations may yield similar correlations while producing different marginal shapes, inverse-scale interpretations, or tail behaviour. Correlation maximization can therefore be a useful exploratory device, but selected parameters should be interpreted together with diagnostics of criterion stability, such as local visibility and near-optimal regions.
The analysis is general, but log-polynomial directions provide a natural local representation for the Box–Cox family through its expansion in powers of log x . The analytical illustrations show that visibility can vary markedly across these directions and along the Box–Cox path. Under the benchmark design, visibility is maximal at the logarithmic case and decreases substantially as | λ | increases. This local information should not be conflated with global flatness of the objective: local sensitivity and global discrimination, as summarized for example by near-optimal regions, are complementary aspects of identification.
The paper does not propose correlation maximization as a substitute for likelihood-based inference. A correctly specified likelihood generally uses more information than Pearson correlation and may identify transformation parameters more strongly. The contribution here is instead to characterize what a correlation-based criterion can detect: to first order, it responds only to the non-affine component of transformation perturbations. This provides a geometric explanation for weak local discrimination whenever admissible parameter directions are nearly affine in the current transformed scale, and the pathwise bound shows how persistent low visibility can translate into weak discrimination over finite parameter regions.
Future work may extend the same projection-based framework to other location–scale invariant criteria, multivariate transformation families, and finite-sample versions of the visibility diagnostics.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

No external datasets were used. The analytical illustrations are based on exact calculations under the benchmark distribution specified in the manuscript.

Acknowledgments

During the preparation of this manuscript, the author used ChatGPT, an AI-assisted language model developed by OpenAI, for language editing, improving clarity of presentation, and assisting with manuscript organization. The author reviewed and edited the output as needed and takes full responsibility for the content of this publication.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Box, G.E.P.; Cox, D.R. An Analysis of Transformations. J. R. Stat. Soc. Ser. B (Methodological) 1964, 26, 211–243. [Google Scholar] [CrossRef]
  2. Tukey, J.W. Exploratory Data Analysis; Addison-Wesley: Reading, MA, 1977. [Google Scholar]
  3. Yeo, I.K.; Johnson, R.A. A New Family of Power Transformations to Improve Normality or Symmetry. Biometrika 2000, 87, 954–959. [Google Scholar] [CrossRef]
  4. Rényi, A. On Measures of Dependence. Acta Math. Acad. Sci. Hung. 1959, 10, 441–451. [Google Scholar] [CrossRef]
  5. Breiman, L.; Friedman, J.H. Estimating Optimal Transformations for Multiple Regression and Correlation. J. Am. Stat. Assoc. 1985, 80, 580–598. [Google Scholar] [CrossRef]
  6. NIST/SEMATECH. Box–Cox Linearity Plot. E-Handb. Stat. Methods. Accessed. (accessed on 18 September 2026). [CrossRef]
  7. Filliben, J.J. The Probability Plot Correlation Coefficient Test for Normality. Technometrics 1975, 17, 111–117. [Google Scholar] [CrossRef]
  8. Lye, L.M. A Technique for Selecting the Box–Cox Transformation in Flood Frequency Analysis. Can. J. Civ. Eng. 1993, 20, 760–766. [Google Scholar] [CrossRef]
  9. Stock, J.H.; Wright, J.H.; Yogo, M. A Survey of Weak Instruments and Weak Identification in Generalized Method of Moments. J. Bus. Econ. Stat. 2002, 20, 518–529. [Google Scholar] [CrossRef]
  10. Andrews, D.W.K.; Cheng, X. Estimation and Inference With Weak, Semi-Strong, and Strong Identification. Econometrica 2012, 80, 2153–2211. [Google Scholar] [CrossRef]
Table 1. Exact scale-free local visibility of log-polynomial directions under log X ∼ N ( 0 , 1 ) .
Table 1. Exact scale-free local visibility of log-polynomial directions under log X ∼ N ( 0 , 1 ) .
Degree k Visibility ν k
2 1.000000
3 0.632456
4 1.000000
5 0.872872
6 1.000000
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.