arXiv Machine Learning

Non-Parametric Mutual Information Estimation with Vine Copulas

arXiv AI
Jul 7

Towards Diverse and Comprehensive Benchmarks for Mutual Information Estimation

arXiv:2607. 03487v1 Announce Type: cross 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.

By Alberto Foresti, Ivan Butakov, Alexander Tolmachev, Giulio Franzese, Alexey Frolov, Pietro Michiardi
arXiv Machine Learning
Sep 30

ALICE: In-context, Zero-shot, Mutual Information Estimation

ALICE is a foundation model that estimates mutual information (MI) without per‑distribution training. Trained only on synthetic distributions, it acts as an in‑context estimator of rectified‑flow velocity fields, producing MI via a fixed identity that integrates squared differences between joint and conditional fields. The authors validate ALICE on a challenging benchmark and demonstrate its applicability to unseen data in biology, genetics, and neuroscience, achieving performance comparable to neural estimators trained separately for each distribution.

By Giulio Franzese, Simone Rossi, Pietro Michiardi
arXiv Machine Learning
Oct 8

Controlling Dependence in Implicit Generative Models via Spread Mutual Information

The paper introduces Spread Mutual Information (SMI), a new metric that integrates mutual information over noise levels using a spreading kernel. By applying Gaussian spreading, SMI ensures smooth, strictly positive conditional and marginal densities, enabling gradient estimation even for originally singular distributions. Experiments show that SMI consistently outperforms other MI-based methods for controlling dependence in implicit generative models and competes well with task‑specific approaches.

By Jiahao Yu, Song Liu, Jos\'{e} Miguel Hern\'{a}ndez-Lobato, RuiKang OuYang
arXiv Machine Learning
Oct 23

Nonparametric autoregressive estimation of probability distributions with parallel gradient boosting

The paper addresses the challenge of estimating joint probability distributions in high-dimensional settings by factorizing them autoregressively and using nonparametric conditional estimators. It establishes theoretical convergence bounds that link the difficulty of joint estimation to the hardest factor in the factorization, especially when conditional estimators adapt to sparsity in an undirected dependence graph. Empirical results show that an autoregressive estimator built with parallel gradient boosting achieves competitive performance on simulated and real datasets, even without optimizing factorization order.

By R\'emy Chapelle (CB, EVDG, CESP)
Hugging Face Trending Papers
Jul 27

Localized Anomaly Detection via Differentiable D-vine Copulas

Vine copulas provide a flexible framework for modeling complex multivariate distributions through a hierarchical decomposition into bivariate pair-copulas. Fitting a D-vine requires selecting a copula family and parameter configuration for each pair-copula from a set of candidates encoding different dependence patterns.