Bergsma--Dassios Sign Covariance Characterises Independence for Arbitrary Real-Valued Bivariate Laws
arXiv:2608.30331
2026
Regularization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper supplies a distribution-free, rank-based independence certificate that remains valid for arbitrary real-valued bivariate laws, including ties, mixed distributions, and singular support. Its key transferable asset is the quantitative relation \(\tau^{*}\ge 2\mathcal{B}\): driving the quartet statistic toward zero controls a Blum–Kiefer–Rosenblatt dependence functional rather than merely matching correlations or pairwise moments. A practical neural-network adaptation is a minibatch quartet regularizer computed with a differentiable soft-sign approximation, used to remove nonlinear dependence between a learned representation and a nuisance variable while preserving task information.
Ideas from this paper
Unverified
2026
Add a quartet-based dependence penalty between a learned representation and a nuisance or sensitive variable. Unlike covariance or correlation penalties, the Bergsma–Dassios construction targets arbitrary nonlinear dependence and is valid for discrete, continuous, tied, and mixed data distributions. Replace the discontinuous sign function by a temperature-controlled \(\tanh\) during backpropagation, while evaluating the exact rank statistic separately for monitoring.
Useful6/10
Difficulty5/10
Novelty7/10