Supervised Quadratic Feature Analysis: Information Geometry Approach for Dimensionality Reduction

Supervised dimensionality reduction maps labeled data into a low-dimensional feature space while preserving class separation.

A common strategy is to learn features that maximize a measure of statistical dissimilarity between the class-conditional probability distributions.

Information geometry, which is rooted in Riemannian geometry, provides an alternative framework for measuring class dissimilarity.

It treats probability distributions as points in a statistical manifold and uses the Fisher information metric to define a geodesic distance--the Fisher-Rao distance--between distributions The Fisher-Rao distance is an appealing candidate for measuring class separation because the Fisher information metric is a local measure of discriminability, and because it allows a geometric interpretation.

Here, we present Supervised Quadratic Feature Analysis (SQFA), a supervised dimensionality reduction method which learns linear features that maximize Fisher-Rao distances between class-conditional distributions, under Gaussian assumptions.

In multiple real world datasets, we find that SQFA features support classification accuracy that is competitive with features that maximize more popular measures of dissimilarity, or that are learned by other state-of-the-art dimensionality reduction methods.

Notably, the best classification accuracy is achieved by SQFA-H features, a variant of SQFA that maximizes the Hellinger distance, a rarely used objective for dimensionality reduction.

These results demonstrate the potential of information geometry as a tool for supervised dimensionality reduction.

We provide a Python implementation of SQFA at this https URL.