Visualizing probabilistic models: Intensive Principal Component Analysis

Abstract

Unsupervised learning makes manifest the underlying structure of data without curated training and specific problem definitions. However, the inference of relationships between data points is frustrated by the `curse of dimensionality' in high-dimensions. Inspired by replica theory from statistical mechanics, we consider replicas of the system to tune the dimensionality and take the limit as the number of replicas goes to zero. The result is the intensive embedding, which is not only isometric (preserving local distances) but allows global structure to be more transparently visualized. We develop the Intensive Principal Component Analysis (InPCA) and demonstrate clear improvements in visualizations of the Ising model of magnetic spins, a neural network, and the dark energy cold dark matter (ΛCDM) model as applied to the Cosmic Microwave Background.

6 pages, 5 figures

References in corpus (2)

• TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
• UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction

Cited by in corpus (8)

• Bayesian, frequentist, and information geometric approaches to parametric uncertainty quantification of classical empirical interatomic potentials
• Visualizing probabilistic models in Minkowski space with intensive symmetrized Kullback-Leibler embedding
• The Training Process of Many Deep Networks Explores the Same Low-Dimensional Manifold
• Detection of the onset of yielding and creep failure from digital image correlation
• Learning from learning machines: a new generation of AI technology to meet the needs of science
• Applications of information geometry to spiking neural network behavior
• Simmering: Sufficient is better than optimal for training neural networks
• Geometric Foundation of Nonequilibrium Transport: A Minkowski Embedding of Markov Dynamics