Biologically Inspired Neural Path Finding
- URL: http://arxiv.org/abs/2206.05971v1
- Date: Mon, 13 Jun 2022 08:33:22 GMT
- Title: Biologically Inspired Neural Path Finding
- Authors: Hang Li, Qadeer Khan, Volker Tresp, Daniel Cremers
- Abstract summary: The human brain can be considered to be a graphical structure comprising of tens of billions of biological neurons connected by synapses.
We develop a computational framework to find the optimal low cost path between a source node and a destination node in a generalized graph.
- Score: 71.77273989319868
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The human brain can be considered to be a graphical structure comprising of
tens of billions of biological neurons connected by synapses. It has the
remarkable ability to automatically re-route information flow through alternate
paths in case some neurons are damaged. Moreover, the brain is capable of
retaining information and applying it to similar but completely unseen
scenarios. In this paper, we take inspiration from these attributes of the
brain, to develop a computational framework to find the optimal low cost path
between a source node and a destination node in a generalized graph. We show
that our framework is capable of handling unseen graphs at test time. Moreover,
it can find alternate optimal paths, when nodes are arbitrarily added or
removed during inference, while maintaining a fixed prediction time. Code is
available here: https://github.com/hangligit/pathfinding
Related papers
- NeuroFly: A framework for whole-brain single neuron reconstruction [17.93211301158225]
We introduce NeuroFly, a validated framework for large-scale automatic single neuron reconstruction.
NeuroFly breaks down the process into three distinct stages: segmentation, connection, and proofreading.
Our goal is to foster collaboration among researchers to address the neuron reconstruction challenge.
arXiv Detail & Related papers (2024-11-07T13:56:13Z) - Graph Neural Networks for Brain Graph Learning: A Survey [53.74244221027981]
Graph neural networks (GNNs) have demonstrated a significant advantage in mining graph-structured data.
GNNs to learn brain graph representations for brain disorder analysis has recently gained increasing attention.
In this paper, we aim to bridge this gap by reviewing brain graph learning works that utilize GNNs.
arXiv Detail & Related papers (2024-06-01T02:47:39Z) - Temporal Spiking Neural Networks with Synaptic Delay for Graph Reasoning [91.29876772547348]
Spiking neural networks (SNNs) are investigated as biologically inspired models of neural computation.
This paper reveals that SNNs, when amalgamated with synaptic delay and temporal coding, are proficient in executing (knowledge) graph reasoning.
arXiv Detail & Related papers (2024-05-27T05:53:30Z) - DBGDGM: Dynamic Brain Graph Deep Generative Model [63.23390833353625]
Graphs are a natural representation of brain activity derived from functional magnetic imaging (fMRI) data.
It is well known that clusters of anatomical brain regions, known as functional connectivity networks (FCNs), encode temporal relationships which can serve as useful biomarkers for understanding brain function and dysfunction.
Previous works, however, ignore the temporal dynamics of the brain and focus on static graphs.
We propose a dynamic brain graph deep generative model (DBGDGM) which simultaneously clusters brain regions into temporally evolving communities and learns dynamic unsupervised node embeddings.
arXiv Detail & Related papers (2023-01-26T20:45:30Z) - Learning Graph Search Heuristics [48.83557172525969]
We present PHIL (Path Heuristic with Imitation Learning), a novel neural architecture and a training algorithm for discovering graph search and navigations from data.
Our function learns graph embeddings useful for inferring node distances, runs in constant time independent of graph sizes, and can be easily incorporated in an algorithm such as A* at test time.
Experiments show that PHIL reduces the number of explored nodes compared to state-of-the-art methods on benchmark datasets by 58.5% on average.
arXiv Detail & Related papers (2022-12-07T22:28:00Z) - Can the brain use waves to solve planning problems? [62.997667081978825]
We present a neural network model which can solve such tasks.
The model is compatible with a broad range of empirical findings about the mammalian neocortex and hippocampus.
arXiv Detail & Related papers (2021-10-11T11:07:05Z) - Recurrent Brain Graph Mapper for Predicting Time-Dependent Brain Graph
Evaluation Trajectory [0.0]
Brain disorders can be detected by observing alterations in the brain's structural and functional connectivities.
Recent studies aimed to predict the evolution of brain connectivities over time by proposing machine learning models.
Here, we propose to use brain connectivities as a more efficient alternative for time-dependent brain disorder diagnosis.
arXiv Detail & Related papers (2021-10-06T09:25:55Z) - Whole Brain Vessel Graphs: A Dataset and Benchmark for Graph Learning
and Neuroscience (VesselGraph) [3.846749674808336]
We present an extendable dataset of whole-brain vessel graphs based on specific imaging protocols.
We benchmark numerous state-of-the-art graph learning algorithms on the biologically relevant tasks of vessel prediction and vessel classification.
Our work paves a path towards advancing graph learning research into the field of neuroscience.
arXiv Detail & Related papers (2021-08-30T13:40:48Z) - Graph Neural Networks in Network Neuroscience [1.6114012813668934]
graph neural network (GNN) provides a clever way of learning the deep graph structure.
GNN-based methods have been used in several applications related to brain graphs such as missing brain graph synthesis and disease classification.
We conclude by charting a path toward a better application of GNN models in network neuroscience field for neurological disorder diagnosis and population graph integration.
arXiv Detail & Related papers (2021-06-07T11:49:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.