Incidence Networks for Geometric Deep Learning
Sparse incidence tensors can represent a variety of structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent simplicial complexes and polytopes. In this paper, we formalize incidence tensors, analyze their structure, and present the family of equivariant networks that operate on them. We show that any incidence tensor decomposes into invariant subsets. This decomposition, in turn, leads to a decomposition of the corresponding equivariant linear maps, for which we prove an efficient pooling-and-broadcasting implementation.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep LearningDrug DiscoveryMolecular Property PredictionRepresentation LearningSimilar Papers 제목 키워드 기반
Do Large Language Models Truly Understand Geometric Structures?
Geometric ability is a significant challenge for large language models (LLMs) due to the need for advanced spatial comprehension and abstract thinking. Existing datasets primarily evaluate LLMs on their final answers, bu…
Geometric and Spectral Alignment for Deep Neural Network II
This paper develops the angular and static-channel component of Geometric and Spectral Alignment for residual Jacobian chains. Starting from Cartan-coordinate rigidity and fitted effective-rank windows, we study how domi…
An Incidence Geometry approach to Dictionary Learning
We study the Dictionary Learning (aka Sparse Coding) problem of obtaining a sparse representation of data points, by learning \emph{dictionary vectors} upon which the data points can be written as sparse linear combinati…
Dictionary LearningUnifying incidence and prevalence under a time-varying general branching process
Renewal equations are a popular approach used in modelling the number of new infections, i.e., incidence, in an outbreak. We develop a stochastic model of an outbreak based on a time-varying variant of the Crump-Mode-Jag…
EpidemiologyProbabilistic ProgrammingCommon Complexes of Decompositions and Complex Balanced Equilibria of Chemical Reaction Networks
A decomposition of a chemical reaction network (CRN) is produced by partitioning its set of reactions. The partition induces networks, called subnetworks, that are "smaller" than the given CRN which, at this point, can b…