Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 7 min ago
PreprintCC BY 4.0arXiv

Towards Diverse and Comprehensive Benchmarks for Mutual Information Estimation

Abstract

Mutual information (MI) estimation is a central problem in machine learning and statistics; however, existing benchmarks typically evaluate estimators on simplified, low-dimensional distributions, leaving their performance on complex, realistic data largely unexplored. We address this gap with a comprehensive benchmarking framework grounded in a unified copula-theoretic perspective that subsumes existing benchmarks as special cases. Within this framework, we propose two complementary families of tests: a copula-first family that systematically varies ground-truth MI, dimensionality, and marginal complexity using synthetic and flow-based transformations; and a marginals-first family that couples real-world image data with controlled dependency structures, extending the classic same-class-pairing paradigm. We use this suite to extensively evaluate three classes of estimators: non-parametric, discriminative, and generative. Contrary to prevailing assumptions, our results indicate that there is no universal winner: each category can systematically outperform all other estimators under specific setups. By analyzing these cases, we identify fundamental estimation barriers and propose new tests that more effectively stress these specific limitations. We share the open source code at https://github.com/VanessB/mutinfo.

Related

  1. Mutual Information Estimation via Triangular Transport Maps: Finite Sample Guarantees and Sample Allocation
    Fengyi Li
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. A Poisson Transition and Bias Law for KSG Mutual-Information Estimation
    Abhiram Gorle, Tsachy Weissman
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. A Sharp Mutual Information Bound for Binary Pairs
    Qianmian Guo
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Exploiting Mutual Coupling Structure for Channel Estimation of Active RIS-Assisted Links
    Simon Tarboush, Pinjun Zheng, Hadi Sarieddeen +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Interchanging limits in the mutual information of two intervals separated by one site
    Carlo Bellavita, Jani A. Virtanen
    arXivPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{foresti2026towards,
  title = {{Towards Diverse and Comprehensive Benchmarks for Mutual Information Estimation}},
  author = {Alberto Foresti and Ivan Butakov and Alexander Tolmachev and Giulio Franzese and Alexey Frolov and Pietro Michiardi},
  howpublished = {arXiv},
  year = {2026},
  month = jul,
  doi = {10.48550/arxiv.2607.03487},
  eprint = {2607.03487},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.03487},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Towards Diverse and Comprehensive Benchmarks for Mutual Information Estimation
AU  - Alberto Foresti
AU  - Ivan Butakov
AU  - Alexander Tolmachev
AU  - Giulio Franzese
AU  - Alexey Frolov
AU  - Pietro Michiardi
PY  - 2026
DA  - 2026/07/03
PB  - arXiv
DO  - 10.48550/arxiv.2607.03487
UR  - https://arxiv.org/abs/2607.03487
AB  - Mutual information (MI) estimation is a central problem in machine learning and statistics; however, existing benchmarks typically evaluate estimators on simplified, low-dimensional distributions, leaving their performance on complex, realistic data largely unexplored. We address this gap with a comprehensive benchmarking framework grounded in a unified copula-theoretic perspective that subsumes existing benchmarks as special cases. Within this framework, we propose two complementary families of tests: a copula-first family that systematically varies ground-truth MI, dimensionality, and marginal complexity using synthetic and flow-based transformations; and a marginals-first family that couples real-world image data with controlled dependency structures, extending the classic same-class-pairing paradigm. We use this suite to extensively evaluate three classes of estimators: non-parametric, discriminative, and generative. Contrary to prevailing assumptions, our results indicate that there is no universal winner: each category can systematically outperform all other estimators under specific setups. By analyzing these cases, we identify fundamental estimation barriers and propose new tests that more effectively stress these specific limitations. We share the open source code at https://github.com/VanessB/mutinfo.
ER  -