paper-with-me

홈 › Papers

Neural ring homomorphisms and maps between neural codes

2019-02-13

Neural codes are binary codes that are used for information processing and representation in the brain. In previous work, we have shown how an algebraic structure, called the {\it neural ring}, can be used to efficiently encode geometric and combinatorial properties of a neural code [1]. In this work, we consider maps between neural codes and the associated homomorphisms of their neural rings. In order to ensure that these maps are meaningful and preserve relevant structure, we find that we need additional constraints on the ring homomorphisms. This motivates us to define {\it neural ring homomorphisms}. Our main results characterize all code maps corresponding to neural ring homomorphisms as compositions of 5 elementary code maps. As an application, we find that neural ring homomorphisms behave nicely with respect to convexity. In particular, if $\mathcal{C}$ and $\mathcal{D}$ are convex codes, the existence of a surjective code map $\mathcal{C}\rightarrow \mathcal{D}$ with a corresponding neural ring homomorphism implies that the minimal embedding dimensions satisfy $d(\mathcal{D}) \leq d(\mathcal{C})$.

📄 PDF Abstract BibTeX arXiv:1511.00255

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Digital homotopy relations and digital homology theories

2021-06-02 · P. Christopher Staecker

In this paper we prove results relating to two homotopy relations and four homology theories developed in the topology of digital images. We introduce a new type of homotopy relation for digitally continuous functions wh…

Bounding Performance Loss in Approximate MDP Homomorphisms

2008-12-01 · NeurIPS 2008 12 · Jonathan Taylor, Doina Precup, Prakash Panagaden

We define a metric for measuring behavior similarity between states in a Markov decision process (MDP), in which action similarity is taken into account. We show that the kernel of our metric corresponds exactly to the c…

Structural Preservation and the Logical Expressiveness of Graph Neural Networks

2026-06-16 · Przemysław Andrzej Wałęga, Bernardo Cuenca Grau arxiv

Bridges between graph neural networks (GNNs) and logical formalisms have been established by fixing architectural choices, such as the types of aggregation, combination, and activation functions. These choices define res…

A Note on Categories about Rough Sets

2022-05-19 · Y. R. Syau, E. B. Lin, C. J. Liau

Using the concepts of category and functor, we provide some insights and prove an intrinsic property of the category ${\bf AprS}$ of approximation spaces and relation-preserving functions, the category ${\bf RCls}$ of ro…

Attribute

Strong homotopy of digitally continuous functions

2019-03-02 · P. Christopher Staecker

We introduce a new type of homotopy relation for digitally continuous functions which we call ``strong homotopy.'' Both digital homotopy and strong homotopy are natural digitizations of classical topological homotopy: th…