Bayesian method for discovering hidden networks from excitatory point process data.
problem Discovering hidden networks from indirect excitatory point process data.
method Bayesian approach, Hawkes process, stochastic variational inference (SVI).
result Efficient SVI algorithm scales to long sequences of observations.
Neuromorphic column performs online unsupervised clustering.
problem Real-time clustering of streaming data.
method Localized, spike timing-dependent plasticity (STDP) neural column.
result Prototype column performs similarly to k-means clustering.
Inspired by LSTMs, a new neural network model mimics cortical microcircuits.
problem Understanding the computational principles of cortical microcircuits.
method Introducing a gated-recurrent neural network (subLSTM) based on inhibitory cells.
result SubLSTM units achieve similar performance to LSTM units in sequential tasks.
Proposes a method to explain deep neural networks by identifying representer points in the training set.
problem Explaining the predictions of deep neural networks.
method Identifying representer points in the training set to decompose neural network predictions.
result Provides a deeper understanding of neural network predictions through positive and negative representer values.
Theory reconstructs network connectivity from event timings.
problem Reconstructing network connectivity from incomplete continuous-time data.
method Linearizes event space mapping to reveal direct influences.
result Reveals synapse presence and inhibitory/activating nature.
New Hawkes processes model spatiotemporal events with triggering and clustering.
problem Modeling self-excitatory behavior in spatiotemporal data.
method Developed a new class of spatiotemporal Hawkes processes with efficient inference method.
result Efficiently modeled and inferred spatiotemporal events with triggering and clustering.
Unified framework trains spiking neural networks for various cognitive tasks.
problem Limitations of conventional neural network models in matching experimental neural dynamics.
method Modified SpikeProp learning algorithm, including biological features.
result Framework successfully trained spiking neural networks for diverse cognitive tasks.
Balanced excitation and inhibition enhance neuronal selectivity and robustness.
problem Ensuring robust neuronal responses in noisy environments.
method Investigated the conditions for balanced excitation and inhibition to enhance robustness of single neurons and network attractor states.
result Balanced excitation and inhibition are crucial for high-capacity, noise-resistant neuronal selectivity.
Estimates neuronal connectivity from spike times using flexible Hawkes processes.
problem Learning latent network structure from multivariate point process data.
method Proposes a new nonstationary Hawkes process and uses sparse least squares estimation.
result Establishes non-asymptotic error bounds and selection consistency for estimated parameters.
LM-SNNs use lattice maps to classify and cluster images.
problem Image classification and clustering.
method Lattice map spiking neural networks with cooperative and competitive interactions, inhibition strategies, and biologically motivated learning rules.
result LM-SNNs effectively classify and cluster images using self-organized filters.
Deep learning boosts mosquito detection from acoustic recordings.
problem Detecting mosquitoes from their acoustic signatures using limited data.
method Convolutional neural networks (CNNs) on wavelet-transformed audio.
result Significantly surpasses existing methods and human experts in detection performance.
Methodology for estimating marked Hawkes processes with neural networks.
problem Estimating conditional intensity of marked Hawkes processes.
method Proposes two models: Shallow Neural Hawkes with marks and Neural Network for Non-Linear Hawkes with Marks.
result Validation on synthetic datasets and real-world cryptocurrency order book data.
Paper improves neural interaction modeling using nonlinear Hawkes processes.
problem Inability of classic Hawkes process to model inhibitory interactions.
method Augmented auxiliary latent variables and EM algorithm for efficient inference.
result Demonstrates accurate and efficient estimation of neural interaction dynamics.
Novel approach constructs differential causal networks from EEG data.
problem Difficulty in modeling interactions of thousands of neurons in group comparisons.
method Hierarchical differential dynamic causal nets based on Chen-Fliess expansions.
result Evidence of network functional disruptions in epileptic brains.
Exact asymptotic solutions found for nonlinear Hawkes processes.
problem Analytical solutions for nonlinear Hawkes processes with positive and negative feedbacks.
method Field master equation approach to classify steady-state solutions.
result Explicit power law formulas for steady-state intensity distributions Pss(λ)∝λ−1−a, with a as a function of parameters. Theory of learning with weight-distribution constraints.
problem Understanding how structure influences function in neural networks.
method Statistical mechanical theory and optimal transport.
result Reduction in capacity due to constrained weight-distribution is related to Wasserstein distance.
Flexible Hawkes model with Gaussian process self-effects for time-dependent data.
problem Modeling time-dependent point processes with history dependence and self-effects.
method Extended Hawkes process with Gaussian process self-effects for both excitatory and inhibitory types, using Bayesian inference and mean-field variational approximation.
result Efficient approximate Bayesian inference achieved via data augmentation and mean-field variational approach.
New approach models brain dynamics using coupled van der Pol oscillators and LSTM.
problem Capturing nonlinear dynamics in brain calcium imaging data.
method Proposes a new approach combining van der Pol oscillators and LSTM for modeling brain activity.
result Shows improved accuracy and interpretability compared to LSTM and hybrid VDP-LSTM approach.
STNMF method uncovers neural circuit components in retinal ganglion cells.
problem Deciphering complex neuronal circuit components in the brain.
method Spike-triggered non-negative matrix factorization (STNMF) method.
result STNMF can detect various properties of upstream bipolar cells and recover synaptic connection strengths.
GraphDINO learns neuronal morphologies from unlabeled data.
problem Unsupervised learning of neuronal morphologies from unlabeled data.
method Transformer-based approach with novel attention mechanism and data augmentation.
result GraphDINO yields morphological clusterings on par with expert classification.
Survey on deep learning for social network analysis.
problem Encoding social network data into useful low-dimensional representations.
method Review of neural network models for node and subgraph embeddings in various network types.
result Advancements in deep learning for complex network analysis.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
New model reconstructs networks by identifying regular components.
problem Uncovering the complexity of network structures.
method Low-rank pursuit based self-representation network model.
result Reconstructs networks and measures their regulability.
Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
DCNs mimic neuronal networks for improved neural classification.
problem Lack of topological similarity between DNNs and biological neural networks.
method Developed DCNs with topologies inspired by real-world neuronal networks.
result High classification accuracy achieved by DCNs.
Study 986 diverse networks to reveal structural diversity across domains.
problem Understanding structural diversity in networks across various domains.
method Machine learning techniques (random forest, confusion matrix) on 986 real-world networks and 575 generated networks.
result Networks in the same partition have similar underlying functions, constraints, and generative mechanisms, regardless of their origins.
Network recasting transforms network architecture for faster inference.
problem Accelerate inference process through network transformation.
method Block-wise recasting of source blocks in a teacher network to target blocks in a student network.
result Transforms network architecture while preserving accuracy and reducing inference time.
Highly accurate classification of network categories achieved.
problem Distinguishing between different types of networks (e.g., social vs. web graphs).
method Used a random forest classifier on both real-world and synthetic networks.
result Achieved a 94.2% classification accuracy.
Network Lens identifies node behaviors in heterogeneous networks with high accuracy.
problem Identifying different behaviors in various parts of large heterogeneous networks.
method Zoom into network using different-sized lenses to capture local structure, weight signatures to predict node labels.
result Achieved a peak accuracy of ~42% on two networks with ~100,000 and ~1,000,000 nodes, significantly better than random.
DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
problem Vulnerability of capsule networks to adversarial attacks.
method Compared capsule networks to convolutional neural networks using various adversarial attacks.
result Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Deep ReLU networks can be simplified to a three-layer model.
problem Understanding the behavior of deep neural networks.
method Constructive proof and algorithm to transform deep networks into shallow ones.
result Deep ReLU networks can be represented by a simpler three-layer structure.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
Paper proposes algorithms for embedding directed networks with text associated nodes.
problem Learning embeddings for directed networks with text associated nodes.
method PCTADW-1 and PCTADW-2 neural network algorithms.
result Embeddings improve node classification quality on software package dependency networks.
Evolutionary synthesis of deep neural networks improves efficiency and performance.
problem Creating highly efficient deep neural networks.
method Evolutionary process using synaptic probability models and random mutation.
result Synthesized networks achieve state-of-the-art performance with 48-fold fewer synapses.
Network embedding helps predict speed limits on incomplete Danish road network.
problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.
New method identifies common organizational principles in networks.
problem Challenging to cluster networks of different size and density.
method Introduces a new network comparison methodology.
result Identifies common organizational principles in networks.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.
New approach learns latent motifs in networks for mesoscale structure analysis.
problem Understanding large-scale behavior in complex systems through mesoscale structures.
method Network dictionary learning (NDL) combining network sampling and nonnegative matrix factorization.
result Networks can be approximated using a small set of latent motifs.
The paper surveys network methods for understanding economic and financial systems.
problem Understanding interconnectedness among economic and financial entities.
method Survey of network theory, measures, and structures for economic and financial networks.
result Network methods provide tools to quantify structural properties of economic systems.
Researchers develop a method to count and analyze motifs in temporal networks.
problem Understanding the role of network motifs in temporal networks.
method Developed a notion of temporal network motifs and designed fast algorithms for counting them.
result Different motifs occur at different time scales, providing insights into temporal network structure and function.
Paper links network Lasso to network flow optimization.
problem Joint clustering and optimization of networked data.
method Exploration of duality between network Lasso and network flow optimization.
result nLasso is equivalent to a minimum-cost flow problem on the data network structure.
SyNGLER generates synthetic networks efficiently while preserving key structural properties.
problem Efficiently generating realistic synthetic networks with preserved structural properties.
method SyNGLER uses latent space network models to learn and reconstruct node embeddings, then generates synthetic networks.
result SyNGLER produces synthetic networks that better preserve key network characteristics than existing approaches.
Paper introduces method to make neural networks symmetrical.
problem Creating symmetrical neural networks for data with inherent symmetries.
method Introduces a method for modifying neural networks to enforce equivariance.
result Group convolutional neural networks are a special case of the introduced framework.
Deep networks better approximate functions with compositional structure.
problem Approximating functions with complex structures.
method Design deep networks with compositional structure, leveraging the blessing of compositionality.
result Deep networks can approximate functions better than shallow networks when the function has a compositional structure.
Secret neural networks hidden within trained models.
problem Excess capacity in neural networks allows embedding secret models.
method Novel framework for hiding secret neural networks within carrier networks.
result Detection of hidden networks is computationally infeasible.