This paper establishes near-optimal sample complexity bounds for mutual information testing and new upper and lower bounds for conditional mutual information testing.
Near-optimal learning of tree-structured distributions by chow and liu
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Testing (Conditional) Mutual Information
This paper establishes near-optimal sample complexity bounds for mutual information testing and new upper and lower bounds for conditional mutual information testing.