Search arXiv⌕ Search

arXiv · 2611.09790

Box-Cox Transformations of Correlation Matrices

Abstract

We consider Box-Cox transformations of correlation matrices, $Φ_α(C)=\mathrm{vecl}\{(C^α-I)/α\}$, with Jacobian $J_α$. The family nests the raw correlations at $α=1$, the generalised Fisher transformation (GFT), $C\mapsto\mathrm{vecl}(\log C)$, at $α=0$, and the negated off-diagonal concentration coordinates at $α=-1$. The inverse problem is a strictly convex program for every $α$, so every member is injective. The map is onto $\mathbb{R}^{d}$, $d=n(n-1)/2$, if and only if $α\le0$, such that $α=0$ defines the boundary for unrestricted parametrizations. For $α>0$ the image is bounded. The conditioning obeys the bound $κ(J_α)\leκ(C)^{|1-α|}$, where $κ(C)=λ_{\max}(C)/λ_{\min}(C)$, and on the surjective range the exponent is smallest at $α=0$. Under Gaussian sampling with $n\geq3$, the asymptotic covariance of the transformed sample correlations is the identity at independence for every member, but only $α=0$ retains the identity to first order in the correlations, whereas the leading joint third cumulant at independence vanishes only at $α=1/3$. Finally, applying the transformation to the diagonal rescaling of $C$ that makes the result hollow adds a new family to the existing correlation parametrizations. For every $α$ the rescaling solves a strictly convex problem and the inverse is explicit, and the scaled coordinates are unrestricted exactly when $α=0$, where they recover the known global normal coordinates, centred at independence, for the efficient information metric of the correlations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilya Archakov, Peter Reinhard Hansen. 2026-11-06. Box-Cox Transformations of Correlation Matrices. https://arxiv.org/abs/2611.09790

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Inference in clustered IV models with many and weak instruments

This paper studies inference in instrumental variable models with many, weak instruments and clustered data. It first examines how clustering affects identification strength, showing how to adapt the concentration parameter to account for within-cluster dependence. The adapted concentration parameter may be smaller and may grow more slowly asymptotically than the concentration parameter that ignores the dependence, thereby weakening identification. Next, the paper extends the identification-robust jackknife Anderson--Rubin and jackknife score statistics for independent data to clustered data by removing clusters rather than individual observations from the statistics. These statistics converge jointly to a normal distribution under many-instrument asymptotics, such that scaling with cluster cross-fit variance estimators yields identification-robust tests. Simulations show that the cluster jackknife tests achieve close to nominal size and have good power. A reanalysis of a study on the effect of queenly reign on war shows the empirical relevance of the new tests.

econ.EM↗

Partially identified heteroskedastic SVARs

This paper studies the identification of Structural Vector Autoregressions (SVARs) exploiting a break in the variances of the structural shocks. Point-identification for this class of models relies on an eigen-decomposition involving the covariance matrices of reduced-form errors and requires that all the eigenvalues are distinct. This point-identification, however, fails in the presence of multiplicity of eigenvalues. This occurs in an empirically relevant scenario where, for instance, only a subset of structural shocks had the break in their variances, or where a group of variables shows a variance shift of the same amount. Together with zero or sign restrictions on the structural parameters and impulse responses, we derive the identified sets for impulse responses and show how to compute them. We perform inference on the impulse response functions, building on the robust Bayesian approach developed for set identified SVARs. To illustrate our proposal, we present an empirical example based on the literature on the global crude oil market where the identification is expected to fail due to multiplicity of eigenvalues.

econ.EM↗

Learning Where to Look: Delaunay Matching for Discovery and Data Collection

A researcher observes a population in the status quo and wants to learn from a small, possibly selected sample exposed to an intervention its effect on the rest of the population. How should they combine these sources of information? And who should receive the intervention next to improve on estimation the most? I focus on convex matching estimators and answer both questions by adopting a statistical decision theoretic perspective and drawing new connections with results from computational geometry. First, I show that interpolation over the Delaunay simplex containing a target point minimizes worst-case bias. Second, I provide robust confidence intervals and show that inference-optimal weighting rules lay on a frontier that connects the proposed estimator to Synthetic Controls. Finally, I characterize the minimax refinement problem and show that the Delaunay triangulation of the existing data provides sufficient information to solve it numerically and restricts the space \textit{where to look} for optimal additions. In a semi-synthetic application in development economics, I show that Delaunay matching achieves a lower worst-case bias compared to commonly used estimators in practice (e.g. around 7 times smaller than synthetic controls) and that the minimax collection plan decreases it by around 90% within 20 additions.

econ.EM↗