Unverified 2026

Relative-Noise Loss for Covariance Ratios

Implementation & benchmark of arXiv:2608.20223 — Self-Normalizing Denominators in Rational Causal Estimation

Usefulness5/10
Difficulty4/10
Novelty7/10

Source paper: Self-Normalizing Denominators in Rational Causal Estimation arXiv:2608.20223 ⓘ · analyzed Sep 1, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

For a neural module that forms causal or statistical ratios from minibatch covariances, replace raw denominator penalties and raw-scale uncertainty weights with a log-denominator or relative-error objective. The front-door covariance minor has variance proportional to its squared magnitude, so a small denominator is not intrinsically evidence of poor estimation under the Gaussian model. This should prevent the network from spuriously avoiding valid representations merely because their covariance determinant is numerically small.

Formulas

$$D_{\mathrm{fd}}(\Sigma)=\sigma_{XX}(\sigma_{XX}\sigma_{MM}-\sigma_{XM}^{2})$$
$$\operatorname{avar}\!\left(n^{1/2}\{D_{\mathrm{fd}}(\hat{\Sigma})-D_{\mathrm{fd}}(\Sigma)\}\right)=10D_{\mathrm{fd}}(\Sigma)^{2}$$
$$\frac{nD_{\mathrm{fd}}(\hat{\Sigma})^{2}}{10D_{\mathrm{fd}}(\hat{\Sigma})^{2}}=\frac n{10}$$
$$\mathcal L_{\mathrm{rel}}=\frac{n}{10}\left[\log(\hat D+\varepsilon)-\log(D_\theta+\varepsilon)\right]^2,\qquad D_\theta=\sigma_{XX,\theta}\left(\sigma_{XX,\theta}\sigma_{MM,\theta}-\sigma_{XM,\theta}^{2}\right)$$

Mathematical statement

Let \(\Sigma\in\mathbb S_{++}^d\) be the population covariance of a centered Gaussian observed vector and \(\hat\Sigma\) the covariance from \(n\) independent samples. For front-door variables \((X,M,Y)^\top\), define the positive denominator \(D=\sigma_{XX}(\sigma_{XX}\sigma_{MM}-\sigma_{XM}^2)\), where \(\sigma_{UV}=\operatorname{cov}(U,V)\). The paper gives \(\operatorname{avar}(\sqrt n(\hat D-D))=10D^2\). Therefore the relative fluctuation \(\sqrt n(\hat D-D)/D\) has asymptotic variance \(10\), and the delta method gives \(\operatorname{avar}(\sqrt n(\log\hat D-\log D))=10\). The plug-in denominator diagnostic is exactly constant: \(n\hat D^2/(10\hat D^2)=n/10\). Use these identities to weight denominator errors by \(D^{-2}\), or equivalently train on \(\log D\), rather than on raw \(D\). Assume the learned covariance is positive definite; enforce this with a Cholesky parameterization.

Implementation notes

Integrate this into a neural causal estimator or representation-learning model whose encoder produces samples \(z_X,z_M,z_Y\), and whose prediction head computes a front-door-style ratio \(r_\theta=N_\theta/D_\theta\) from minibatch covariances. Do not regularize \(D_\theta\) toward a fixed absolute magnitude. First compute centered minibatch covariance entries \(\hat\sigma_{UV}=B^{-1}\sum_{i=1}^B(z_{U,i}-\bar z_U)(z_{V,i}-\bar z_V)\). Parameterize any predicted population covariance as \(\Sigma_\theta=L_\theta L_\theta^\top+\delta I\), with positive diagonal entries in \(L_\theta\), then form \(D_\theta=\sigma_{XX,\theta}(\sigma_{XX,\theta}\sigma_{MM,\theta}-\sigma_{XM,\theta}^2)\). For each batch, compute \(\hat D\) from the empirical covariance and add the paper-derived relative loss \(\mathcal L_{rel}=(B/10)[\log(\hat D+\varepsilon)-\log(D_\theta+\varepsilon)]^2\) to the ordinary outcome loss. If a ratio target \(r\) is available, use the same scale principle for its denominator-related uncertainty: multiply denominator residuals by \(1/(D_\theta+\varepsilon)\), not by a fixed raw-scale coefficient. The factor 10 and the \(B\)-scaling come from the Gaussian asymptotic result; covariance entries, \(D_\theta\), and the empirical loss are estimated by minibatch statistics. Start with a three-layer MLP on synthetic linear front-door data generated from Gaussian structural equations, comparing ordinary MSE plus raw-denominator penalty against the proposed loss. Sweep mediator residual variance over several orders of magnitude while keeping the treatment–mediator coefficient nonzero. Success means stable ratio predictions and nominal bootstrap coverage or lower test MSE when the denominator is numerically small, without systematic rejection of valid low-variance representations; also verify that gradient norms and training loss do not explode as \(D\) shrinks.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.