SearcharxivSearch

arXiv subjects

Parvaneh Joharinad

Publications and source records attributed to Parvaneh Joharinad.

10 recordsLinked to original sources

Fuzzy simplicial sets and their application to geometric data analysis

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.

math.AT

Geometry and Dress groups with non-symmetric cost functions

A metric relation by definition is symmetric. Since many data sets are non-symmetric, in this paper we develop a systematic theory of non-symmetric cost functions. Betweenness relations play an important role. We also introduce the notion of a Dress group in the non-symmetric setting and indicate a notion of curvature.

math.MG

Probabilistic Foundations of Fuzzy Simplicial Sets for Nonlinear Dimensionality Reduction

Fuzzy simplicial sets have become an object of interest in dimensionality reduction and manifold learning, most prominently through their role in UMAP. However, their definition through tools from algebraic topology without a clear probabilistic interpretation detaches them from commonly used theoretical frameworks in those areas. In this work we introduce a framework that explains fuzzy simplicial sets as marginals of probability measures on simplicial sets. In particular, this perspective shows that the fuzzy weights of UMAP arise from a generative model that samples Vietoris-Rips filtrations at random scales, yielding cumulative distribution functions of pairwise distances. More generally, the framework connects fuzzy simplicial sets to probabilistic models on the face poset, clarifies the relation between Kullback-Leibler divergence and fuzzy cross-entropy in this setting, and recovers standard t-norms and t-conorms via Boolean operations on the underlying simplicial sets. We then show how new embedding methods may be derived from this framework and illustrate this on an example where we generalize UMAP using Čech filtrations with triplet sampling. In summary, this probabilistic viewpoint provides a unified probabilistic theoretical foundation for fuzzy simplicial sets, clarifies the role of UMAP within this framework, and enables the systematic derivation of new dimensionality reduction methods.

cs.LG

Curvature as a tool for evaluating dimensionality reduction and estimating intrinsic dimension

Utilizing recently developed abstract notions of sectional curvature, we introduce a method for constructing a curvature-based geometric profile of discrete metric spaces. The curvature concept that we use here captures the metric relations between triples of points and other points. More significantly, based on this curvature profile, we introduce a quantitative measure to evaluate the effectiveness of data representations, such as those produced by dimensionality reduction techniques. Furthermore, Our experiments demonstrate that this curvature-based analysis can be employed to estimate the intrinsic dimensionality of datasets. We use this to explore the large-scale geometry of empirical networks and to evaluate the effectiveness of dimensionality reduction techniques.

cs.CV

Merging Hazy Sets with m-Schemes: A Geometric Approach to Data Visualization

Many machine learning algorithms try to visualize high dimensional metric data in 2D in such a way that the essential geometric and topological features of the data are highlighted. In this paper, we introduce a framework for aggregating dissimilarity functions that arise from locally adjusting a metric through density-aware normalization, as employed in the IsUMap method. We formalize these approaches as m-schemes, a class of methods closely related to t-norms and t-conorms in probabilistic metrics, as well as to composition laws in information theory. These m-schemes provide a flexible and theoretically grounded approach to refining distance-based embeddings.

cs.LG

IsUMap: Manifold Learning and Data Visualization leveraging Vietoris-Rips filtrations

This work introduces IsUMap, a novel manifold learning technique that enhances data representation by integrating aspects of UMAP and Isomap with Vietoris-Rips filtrations. We present a systematic and detailed construction of a metric representation for locally distorted metric spaces that captures complex data structures more accurately than the previous schemes. Our approach addresses limitations in existing methods by accommodating non-uniform data distributions and intricate local geometries. We validate its performance through extensive experiments on examples of various geometric objects and benchmark real-world datasets, demonstrating significant improvements in representation quality.

cs.LG

Reverse Bernstein Inequality on the Circle

The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein inequality, that we prove in this note, says that the reverse inequality holds for functions in the orthogonal complement of the space of polynomials of fixed degree. In fact, we derived a more general result for the lower bounds on higher derivatives. These bounds are better then those obtained by applying bound for the first derivative successively several times.

math.CA

Geometry of Data

Topological data analysis asks when balls in a metric space $(X,d)$ intersect. Geometric data analysis asks how much balls have to be enlarged to intersect. We connect this principle to the traditional core geometric concept of curvature. This enables us, on one hand, to reconceptualize curvature and link it to the geometric notion of hyperconvexity. On the other hand, we can then also understand methods of topological data analysis from a geometric perspective.

math.MG

Topological representation of the geometry of metric spaces

Inspired by the concept of hyperconvexity and its relation to curvature, we translate geometric properties of a metric space encoded by the curvature inequalities into the persistent homology induced by the Čech filtration of that space.

math.GT

Topology and curvature of metric spaces

We develop a new concept of non-positive curvature for metric spaces, based on intersection patterns of closed balls. In contrast to the synthetic approaches of Alexandrov and Buesemann, our concept also applies to metric spaces that might be discrete. The natural comparison spaces that emerge from our discussion are no longer Euclidean spaces, but rather tripod spaces. These tripod spaces include the hyperconvex spaces which have trivial Cech homology. This suggests a link of our geometrical method to the topological method of persistent homology in topological data analysis. We also investigate the geometry of general tripod spaces.

math.MG