Fuzzy simplicial sets and their application to geometric data analysis
Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克数理科学研究所);Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)(可扩展数据分析与人工智能中心);Santa Fe Institute for the Sciences of Complexity(圣塔菲复杂科学研究所);Max Planck Institute for Human Cognitive and Brain Sciences(马克斯·普朗克人类认知与脑科学研究所);University of Copenhagen(哥本哈根大学)
Lukas Silvester Barth, Hannaneh Fahimi, Parvaneh Joharinad, Jürgen Jost, Janis Keck, Thomas Jan Mikhail
In this article, we expand upon the concepts introduced by David Spivak about the relationship between the category $\mathbf{UM}$ of uber metric spaces and the category $\mathbf{sFuz}$ of fuzzy simplicial sets. We show that fuzzy simplicial sets can be regarded as natural combinatorial generalizations of metric relations. Furthermore, we take inspiration from UMAP to apply the theory to manifold learning, dimension reduction and data visualization, while refining some of their constructions. We generalize the adjunction between $\mathbf{UM}$ and $\mathbf{sFuz}$, derive an explicit description of colimits in $\mathbf{UM}$, and show that $\mathbf{UM}$ can be embedded into $\mathbf{sFuz}$. Furthermore, we prove analogous results for the category of extended-pseudo metric spaces $\mathbf{EPMet}$. We also provide rigorous definitions of functors that make it possible to recursively merge sets of fuzzy simplicial sets and provide a description of the adjunctions between the category of truncated fuzzy simplicial sets and $\mathbf{sFuz}$, which we relate to persistent homology.
Combining those constructions, we can show a surprising connection between the well-known dimension reduction methods UMAP and Isomap and derive an alternative algorithm, which we call IsUMap, that combines some of the strengths of both methods (source code on github). Additionally, we developed a new embedding method that allows to preserve clusters detected in the original metric space that we construct from the data. The visualization of the optimization process gives the user information both about the inner-cluster distributions in the original metric space and their inter-cluster relations. We compare our new method with UMAP, Isomap and t-SNE on a series of low- and high-dimensional datasets, demonstrate how our method improves upon them and provide explanations for observed differences.
Probabilistic Foundations of Fuzzy Simplicial Sets for Nonlinear Dimensionality Reduction
Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克数学科学研究所);Max Planck Institute for Human Cognitive and Brain Sciences(马克斯·普朗克人类认知与脑科学研究所);Max Planck School of Cognition(马克斯·普朗克认知学校);ScaDS.AI (Center for Scalable Data Analytics and AI)(ScaDS.AI(可扩展数据与人工智能中心));Santa Fe Institute for the Sciences of Complexity(复杂性科学圣菲研究所)
Simplicial Representation Learning with Neural $k$-Forms
École Polytechnique Fédérale de Lausanne (EPFL)(洛桑联邦理工学院);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克数学科学研究所);Helmholtz Munich(慕尼黑亥姆霍兹中心);Technical University of Munich (TUM)(慕尼黑工业大学)
Santa Clara University(圣克拉拉大学);University of South Florida(南佛罗里达大学);The University of Manchester(曼彻斯特大学);University of Tennessee(田纳西大学);Facebook Inc(脸书公司)