Renormalization Group-Motivated Learning
Jonathan Landy, Tsvi Tlusty, YeongKyu Lee, YongSeok Jho

TL;DR
This paper presents an RG-inspired coarse-graining method for data analysis that effectively reduces dimensionality while preserving essential features, applicable to Gaussian, Ising, and glass systems.
Contribution
It introduces a novel coarse-graining technique based on renormalization group principles, incorporating correlation and mutual information for non-spatial data.
Findings
Effective dimensionality reduction demonstrated on Gaussian and Ising data
Preserves key features while minimizing information loss
Applicable to complex systems like glasses
Abstract
We introduce an RG-inspired coarse-graining for extracting the collective features of data. The key to successful coarse-graining lies in finding appropriate pairs of data sets. We coarse-grain the two closest data in a regular real-space RG in a lattice while considers the overall information loss in momentum-space RG. Here we compromise the two measures for the non-spatial data set. For weakly correlated data close to Gaussian, we use the correlation of data as a metric for the proximity of data points, but minimize an overall projection error for optimal coarse-graining steps. It compresses the data to maximize the correlation between the two data points to be compressed while minimizing the correlation between the paired data and other data points. We show that this approach can effectively reduce the dimensionality of the data while preserving the essential features. We extend our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTheoretical and Computational Physics · Complex Network Analysis Techniques · Random Matrices and Applications
