mlsanityData to 14 Oct 2026

The Normalized Cross Density Functional: A Framework to Quantify Statistical Dependence for Random Processes

arXiv 2212.04631 ↗First posted 9 Dec 2022cs.LG cs.AI cs.ITcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper presents a novel approach to measuring statistical dependence between two random processes (r.p.) using a positive-definite function called the Normalized Cross Density (NCD). NCD is derived directly from the probability density functions of two r.p. and constructs a data-dependent Hilbert space, the Normalized Cross-Density Hilbert Space (NCD-HS). By Mercer's Theorem, the NCD norm can be decomposed into its eigenspectrum, which we name the Multivariate Statistical Dependence (MSD) measure, and their sum, the Total Dependence Measure (TSD). Hence, the NCD-HS eigenfunctions serve as a novel embedded feature space, suitable for quantifying r.p. statistical dependence. In order to apply NCD directly to r.p. realizations, we introduce an architecture with two multiple-output neural networks, a cost function, and an algorithm named the Functional Maximal Correlation Algorithm (FMCA). With FMCA, the two networks learn concurrently by approximating each other's outputs, extending the Alternating Conditional Expectation (ACE) for multivariate functions. We mathematically prove that FMCA learns the dominant eigenvalues and eigenfunctions of NCD directly from realizations. Preliminary results with synthetic data and medium-sized image datasets corroborate the theory. Different strategies for applying NCD are proposed and discussed, demonstrating the method's versatility and stability beyond supervised learning. Specifically, when the two r.p. are high-dimensional real-world images and a white uniform noise process, FMCA learns factorial codes, i.e., the occurrence of a code guarantees that a specific training set image was present, which is important for feature learning.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 7 of its 45 references that are in the map. First posted on arXiv 9 Dec 2022.

Builds on

7 of 45 references.

References · 7

  1. 2018MINE: Mutual Information Neural Estimationcited by 683
  2. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 364
  3. 2018Learning unknown ODE models with Gaussian processescited by 54
  4. 2015Non-Stationary Gaussian Process Regression with Hamiltonian Monte Carlocited by 29
  5. 2018State Aggregation Learning from Markov Transition Datacited by 20
  6. 2019On Universal Features for High-Dimensional Learning and Inferencecited by 20
  7. 2018Spectral State Compression of Markov Processescited by 18

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.