Beyond Coordinates: Meta-Equivariance in Statistical Inference
William Cook
TL;DR
This work investigates whether coordinate choices influence the optimal decision when combining two asymptotically normal estimators. It shows that under strictly convex, differentiable objectives, the unique optimiser in the weight space transforms covariantly under any invertible affine reparameterisation, while the resulting optimal estimator remains invariant in the estimator space. The key results are Theorem 1 (estimator invariance under direct reparameterisation) and Theorem 2 (meta-equivariance: covariant transformation of the optimum under affine maps), validated both analytically and numerically. This establishes a coordinate-free notion of optimality in convex inference, connected to information geometry and convex geometry, and underscores the robustness of optimal decisions to how the problem is parameterised. The findings offer a geometric perspective on statistical decision-making, suggesting broader applicability to penalised estimation and model averaging where convexity and affine structure prevail.
Abstract
Optimal statistical decisions should transcend the language used to describe them. Yet, how do we guarantee that the choice of coordinates - the parameterisation of an optimisation problem - does not subtly dictate the solution? This paper reveals a fundamental geometric invariance principle. We first analyse the optimal combination of two asymptotically normal estimators under a strictly convex trace-AMSE risk. While methods for finding optimal weights are known, we prove that the resulting optimal estimator is invariant under direct affine reparameterisations of the weighting scheme. This exemplifies a broader principle we term meta-equivariance: the unique minimiser of any strictly convex, differentiable scalar objective over a matrix space transforms covariantly under any invertible affine reparameterisation of that space. Distinct from classical statistical equivariance tied to data symmetries, meta-equivariance arises from the immutable geometry of convex optimisation itself. It guarantees that optimality, in these settings, is not an artefact of representation but an intrinsic, coordinate-free truth.
