Answers are grounded in this paper and cite their sources.
We construct anytime-valid tests of independence whose log wealth per observation converges to mutual information for every joint distribution on a pair of standard Borel spaces. The same data-driven procedure works without knowledge of either marginal distribution or a common dominating measure. A conditional predictive likelihood, normalized by the maximum marginal likelihood, gives an e-process in the full observation filtration. Refining finite partitions and multiclass kernel learning yield universal attainment; arbitrary probabilistic classifiers give practical implementations that can be trained throughout the test. For two complex data types, a normalized sequential assignment rule gives an exact matching e-value with quadratic score-evaluation cost. We connect these constructions to classical fixed-sample efficiency. Experiments compare practical implementations with sequential kernelized and classifier-based tests, permutation HSIC, and held-out classifier tests.
No takes yet. Share an insight, caveat, or question.
Aaditya Ramdas (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: