paper-with-me

홈 › Papers

Memory as Structured Trajectories: Persistent Homology and Contextual Sheaves

2025-08-01 · Xin Li arxiv

We propose a topological framework for memory and inference grounded in the structure of spike-timing dynamics, persistent homology, and the Context-Content Uncertainty Principle (CCUP). Starting from the observation that polychronous neural groups (PNGs) encode reproducible, time-locked spike sequences shaped by axonal delays and synaptic plasticity, we construct spatiotemporal complexes whose temporally consistent transitions define chain complexes over which robust activation cycles emerge. These activation loops are abstracted into cell posets, enabling a compact and causally ordered representation of neural activity with overlapping and compositional memory traces. We introduce the delta-homology analogy, which formalizes memory as a set of sparse, topologically irreducible attractors. A Dirac delta-like memory trace is identified with a nontrivial homology generator on a latent manifold of cognitive states. Such traces are sharply localized along reproducible topological cycles and are only activated when inference trajectories complete a full cycle. They encode minimal, path-dependent memory units that cannot be synthesized from local features alone. We interpret these delta-homology generators as the low-entropy content variable, while the high-entropy context variable is represented dually as a filtration, cohomology class, or sheaf over the same latent space. Inference is recast as a dynamic alignment between content and context and coherent memory retrieval corresponds to the existence of a global section that selects and sustains a topological generator. Memory is no longer a static attractor or distributed code, but a cycle-completing, structure-aware inference process.

📄 PDF Abstract BibTeX arXiv:2508.11646

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Cubical Ripser: Software for computing persistent homology of image and volume data

2020-05-23 · Shizuo Kaji, Takeki Sudo, Kazushi Ahara

We introduce Cubical Ripser for computing persistent homology of image and volume data (more precisely, weighted cubical complexes). To our best knowledge, Cubical Ripser is currently the fastest and the most memory-effi…

VL-MemKnG: Hybrid Memory with a Spatio-Temporal Knowledge Graph for Question Answering over Long Egocentric Navigation Trajectories

2026-06-15 · Svetlana Lukina, Mohamad Al Mdfaa, Gloria Haro, Sergey Zagoruyko 외 arxiv

Answering navigation-relevant questions over long egocentric videos requires retrieving and organizing evidence distributed across distant temporal moments while maintaining spatial and contextual consistency. Although l…

Video Question AnsweringKnowledge Graphs

Quantum Persistent Homology for Time Series

2022-11-08 · Bernardo Ameneyro, George Siopsis, Vasileios Maroulas

Persistent homology, a powerful mathematical tool for data analysis, summarizes the shape of data through tracking topological features across changes in different scales. Classical algorithms for persistent homology are…

Time SeriesTime Series Analysis

Persistent Intersection Homology for the Analysis of Discrete Data

2019-07-31 · Bastian Rieck, Markus Banagl, Filip Sadlo, Heike Leitte

Topological data analysis is becoming increasingly relevant to support the analysis of unstructured data sets. A common assumption in data analysis is that the data set is a sample---not necessarily a uniform one---of so…

Topological Data Analysis

Persistent Homology for Learning Densities with Bounded Support

2012-12-01 · NeurIPS 2012 12 · Florian T. Pokorny, Hedvig Kjellström, Danica Kragic, Carl Ek

We present a novel method for learning densities with bounded support which enables us to incorporate `hard' topological constraints. In particular, we show how emerging techniques from computational algebraic topology a…

Density Estimation