English

Generalizing Correspondence Analysis for Applications in Machine Learning

Machine Learning 2020-07-01 v3 Information Theory math.IT Machine Learning

Abstract

Correspondence analysis (CA) is a multivariate statistical tool used to visualize and interpret data dependencies by finding maximally correlated embeddings of pairs of random variables. CA has found applications in fields ranging from epidemiology to social sciences; however, current methods do not scale to large, high-dimensional datasets. In this paper, we provide a novel interpretation of CA in terms of an information-theoretic quantity called the principal inertia components. We show that estimating the principal inertia components, which consists in solving a functional optimization problem over the space of finite variance functions of two random variable, is equivalent to performing CA. We then leverage this insight to design novel algorithms to perform CA at an unprecedented scale. Particularly, we demonstrate how the principal inertia components can be reliably approximated from data using deep neural networks. Finally, we show how these maximally correlated embeddings of pairs of random variables in CA further play a central role in several learning problems including visualization of classification boundary and training process, and underlying recent multi-view and multi-modal learning methods.

Keywords

Cite

@article{arxiv.1806.08449,
  title  = {Generalizing Correspondence Analysis for Applications in Machine Learning},
  author = {Hsiang Hsu and Salman Salamatian and Flavio P. Calmon},
  journal= {arXiv preprint arXiv:1806.08449},
  year   = {2020}
}

Comments

30 pages, 7 figures, 6 tables. arXiv admin note: text overlap with arXiv:1902.07828

R2 v1 2026-06-23T02:37:52.238Z