Metraipolis › archive › dc_7ee23608964d
Learning the information contained in the microstructure of data distributions — arXiv:2610.22283
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22283
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:49:44.550Z
- SHA-256 of the archived text
e9c77fe43407c43f04d2ed46e7dbca302145a15176b653a930e8651262e61bd1- Stable URL of this page
https://metraipolis.com/documento/dc_7ee23608964d
How to cite
Learning the information contained in the microstructure of data distributions — arXiv:2610.22283 — arXiv (en), https://arxiv.org/abs/2610.22283 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ee23608964d (Metraipolis archive dc_7ee23608964d, sha256 e9c77fe43407c43f04d2ed46e7dbca302145a15176b653a930e8651262e61bd1)
BibTeX
@misc{dc7ee23608964d,
title = {Learning the information contained in the microstructure of data distributions — arXiv:2610.22283},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22283},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ee23608964d; sha256 e9c77fe43407c43f04d2ed46e7dbca302145a15176b653a930e8651262e61bd1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22283. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Understanding how much and where information is nested in sets of data obtained using different parameters and metrics is a typical problem in the analysis of high-dimensional datasets. Approaches based on relative data-driven metrics may be poorly quantitative and difficult to interpret, while accurate methods may be computationally expensive and impractical for large datasets. Here, we report an efficient, quantitative, and transferable method useful to this end, which we call "Micro-Information Analysis". Its foundation is based on the tight relationship that exists between the microscopic features of data distributions and the information they contain. The method performs preliminary unsupervised clustering, capturing microstructural features of data distributions such as the dominant Gaussian microdomains (microstates) present in them, their population, separation, and their residual non-Gaussian fraction. Leveraging the principle of clustering-and-minimization of Shannon entropy, this allows quantifying in bit (that is, in absolute metric) the information contained in the microstructure of the data, and how much information is nested in each Gaussian and non-Gaussian microdomain. The output of the analysis is a set of easily interpretable Information-Microstructure plots that allow to readily compare and rank data based on their information content and to graphically map the information breakdown among their various microenvironments in diagrams that are easy to interpret. We prove the efficiency of our method by analyzing and ranking data generated synthetically or from molecular simulations, demonstrating how "Micro-Information Analysis" is a physically-grounded quantitative tool useful for the study of physical systems from their data and for data science in general. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv physics.data-an, nuovi lavori del giorno). Categorie arXiv: Chemical Physics (physics.chem-ph) ; Data Analysis, Statistics and Probability (physics.data-an). Pagina del lavoro: https://arxiv.org/abs/2610.22283 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:56:37.192Z dalla pagina https://arxiv.org/list/physics.data-an/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).