Log-optimal independence testing by betting

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.

Authors

Institutions

Publication Details

Journal
Stanford Digital Repository
Published
2026-11-14
DOI
https://doi.org/10.25740/pg979gk9581
Primary Topic
Statistical Methods and Inference
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Log-optimal independence testing by betting

Aaditya Ramdas
Stanford Digital Repository
Statistical Methods and Inference
article

Log-optimal independence testing by betting

Aaditya Ramdas
article en

Abstract

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.

Stanford Digital Repository
Stanford University (US)
Statistical Methods and Inference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon