SearcharxivSearch

arXiv subjects

Melvin Vaupel

Publications and source records attributed to Melvin Vaupel.

6 recordsLinked to original sources

Learning Coherent Representations: A Topological Approach to Interpretability

Deep neural networks learn representations where individual features often lack interpretable meaning; a single neuron may activate for scattered, unrelated inputs. We introduce coherence, a geometric property inspired by neural coding in the brain, where neurons like grid cells and head direction cells respond to contiguous regions of state space. A non-negative matrix is coherent if each row (sample) attends to geometrically clustered columns (features) and vice versa, and in addition every sample is well described by some feature and every feature is needed by some sample. We prove that coherent matrices induce a bounded interleaving between the Vietoris-Rips filtrations of samples and features, guaranteeing that both spaces share compatible topological structure. This geometric constraint facilitates interpretability. For example, if data lies on a circle, coherent features must tile that circle into contiguous arcs. We introduce Coh, a differentiable objective function based on Fréchet variance that enforces coherence during training. Unlike sparsity, which bounds how many samples a feature activates on, coherence bounds which samples, requiring geometric connectivity rather than only rarity. This yields not just interpretable features but an interpretable feature space. We validate Coh in an auto-encoder using synthetic and rotated MNIST datasets and in a token embedding of BERT using language data.

cs.LG

Dowker's theorem for higher-order relations

Given a relation $R \subseteq I \times J$ between two sets, Dowker's Theorem (1952) states that the homology groups of two associated simplicial complexes, now known as Dowker complexes, are isomorphic. In its modern form, the full result asserts a functorial homotopy equivalence between the two Dowker complexes. What can be said about relations defined on three or more sets? We present a simple generalization to multiway relations of the form $R \subseteq I_1 \times I_2 \times \cdots \times I_m$. The theorem asserts functorial homotopy equivalences between $m$ multiway Dowker complexes and a variant of the rectangle complex of Brun and Salbu from their recent short proof of Dowker's Theorem. Our proof uses Smale's homotopy mapping theorem and factors through a cellular Dowker lemma that expresses the main idea in more general form. To make the geometry more transparent, we work with a class of spaces called prod-complexes then transfer the results to simplicial complexes through a simplexification process. We conclude with a detailed study of ternary relations, identifying seven functorially defined homotopy types and twelve natural transformations between them.

math.AT

The bifiltration of a relation and extended Dowker duality

We explain how homotopical information of two composeable relations can be organized in two simplicial categories that augment the relations row and column complexes. We show that both of these categories realize to weakly equivalent spaces, thereby extending Dowker's duality theorem. We also prove a functorial version of this result. Specializing the above construction a bifiltration of Dowker complexes that coherently incorporates the total weights of a relation's row and column complex into one single object is introduced. This construction is motivated by challenges in data analysis that necessitate the simultaneous study of a data matrix rows and columns. To illustrate the applicability of our constructions for solving those challenges we give an appropriate reconstruction result.

math.AT

ICLR 2022 Challenge for Computational Geometry and Topology: Design and Results

This paper presents the computational challenge on differential geometry and topology that was hosted within the ICLR 2022 workshop ``Geometric and Topological Representation Learning". The competition asked participants to provide implementations of machine learning algorithms on manifolds that would respect the API of the open-source software Geomstats (manifold part) and Scikit-Learn (machine learning part) or PyTorch. The challenge attracted seven teams in its two month duration. This paper describes the design of the challenge and summarizes its main findings.

cs.CG

Section complexes of simplicial height functions

A theory of sections of simplicial height functions is developed. At the core of this theory lies the section complex, which is assembled from higher section spaces. The latter encode flow lines along the height, as well as their homotopies, in a combinatorial way. The section complex has an associated spectral sequence, which computes the homology of the height functions domain. We extract Reeb complexes from the spectral sequence. These provide a first order approximation of how homology generators flow along height levels. Our theory in particular models topological section spaces of piecewise linear functions in a completely combinatorial way.

math.AT

Reeb complexes and topological persistence

We introduce Reeb complexes in order to capture how generators of homology flow along sections of a real valued continuous function. This intuition suggests a close relation of Reeb complexes to established methods in topological data analysis such as levelset zigzags and persistent homology. We make this relation precise and in particular explain how Reeb complexes and levelset zigzags can be extracted from the first pages of respective spectral sequences with the same termination.

math.AT