atlas

Research map / Graph learning / Graph algorithms and clustering

Cover learning for large-scale topology representation

ICML 2025 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes cover learning, optimizing fuzzy covers via a loss combining measure, boundary, and 0-dimensional persistence terms, and implements it as ShapeDiscover for large-scale topology representation.

Problem

Representing the large-scale topology of geometric datasets with simplicial complexes that are small, geometrically regular, and topologically faithful, where geometric complexes scale poorly and Mapper graphs are hard to tune and only capture low-dimensional information.

Approach

Formulates cover learning as optimization over fuzzy covers (functions into Gamma^{k-1}), with a loss on expected cover measure, boundary measure, and homology-goodness, relaxed to 0-dimensional persistence; the parametric model is a softmax-normalized matrix initialized by spectral clustering, and thresholding the fuzzy cover yields a filtered nerve.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ShapeDiscover instead of Vietoris–RipsTopological representation of grid-cell population activity · Grid-cell population activityvertices: 5000 -> 15Helped
Use ShapeDiscover instead of standard topological inference approachesTopological inference · Synthetic 2-sphere, synthetic 3-sphere, human surface, and dynamical-system video datavertices needed for homology recoveryHelped
Use ShapeDiscover instead of 1D Mapper or Differentiable MapperLarge-scale topology visualization · Human and octopus datasetstopological information representedHelped
Use ShapeDiscover instead of Ball MapperLarge-scale topology visualization · Human and octopus datasetstopology recoveryHelped
Remove the geometry loss (ablation)ShapeDiscover · Experiments reported in the paperexperimental resultsNo clear effect

Surprising findings

Limitations

Experimental setup

Datasets: synthetic 2-sphere synthetic 3-sphere human surface point cloud dynamical system video data (2-torus) grid cell population activity human and octopus datasets small handwritten digits MNIST C. elegans gene expression

Benchmarks: synthetic 2-sphere synthetic 3-sphere human surface torus video data MNIST small digits C. elegans

Metrics: homology recovery quotient number of vertices needed total number of simplices

Baselines: 1D Mapper Ball Mapper Differentiable Mapper Vietoris-Rips complex Witness complex UMAP

Builds on: Mapper Ball Mapper Differentiable Mapper UMAP topological persistence optimization with big steps

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy