Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4386129172 · Jun 202019922001200920172026
48 results for neuron interaction

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.

Improved NiNo networks accelerate Adam training by up to 50%.

problem Accelerating neural network training with stable and efficient methods.
method Proposed NiNo networks that leverage neuron connectivity and graph neural networks to nowcast parameters periodically during Adam training.
result Accelerates Adam training by up to 50% in vision and language tasks.

Neural networks learn to mimic brain neurons with two-input activation functions, improving performance and robustness.

problem Training neural networks to mimic the complex interactions of brain neurons.
method Developed a network-in-network architecture with two-input activation functions, optimized hyperparameters, and compared to conventional ReLU networks.
result Two-input activation functions can learn soft XOR functions, improving network performance and robustness.

In this study, we analyzed the activity of monkey V1 neurons responding to grating stimuli of different orientations using inference methods for a time-dependent Ising model. The method provides optimal estimation of time-dependent neural interactions with credible intervals according to the sequential Bayes estimation…

2018-07-24abs ↗pdf ↗

Neuron Shapley identifies key neurons in deep networks, improving model accuracy and fairness.

problem Identifying responsible neurons in deep networks for better model performance and fairness.
method Neuron Shapley framework quantifies neuron contributions, accounting for interactions.
result Removing just 30 critical filters can destroy model accuracy, revealing network function.

This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is to provide statistical tools for detecting changes in firing patterns with changing stimuli. Our framework is not restricted to the well-under…

2013-02-13abs ↗pdf ↗

New method for online learning in interacting particle systems.

problem Parameter estimation in stochastic interacting particle systems.
method Stochastic approximation of gradient of asymptotic log likelihood using continuous observations.
result Convergence to stationary points of asymptotic log-likelihood under suitable assumptions.

Recent developments in high throughput profiling of individual neurons have spurred data driven exploration of the idea that there exist natural groupings of neurons referred to as cell types. The promise of this idea is that the immense complexity of brain circuits can be reduced, and effectively studied by means of i…

2019-11-06abs ↗pdf ↗

This study explains how adversarial interaction creates non-homogeneous patterns using a pseudo-Reaction-Diffusion model.

problem Understanding how adversarial interaction leads to non-homogeneous patterns in systems.
method Developed a pseudo-Reaction-Diffusion model to explain the mechanism.
result Turing instability is involved in creating non-homogeneous patterns.

A dynamical neural network consists of a set of interconnected neurons that interact over time continuously. It can exhibit computational properties in the sense that the dynamical system's evolution and/or limit points in the associated state space can correspond to numerical solutions to certain mathematical optimiza…

2018-05-23abs ↗pdf ↗

Gradient descent slows significantly in over-parameterized single neuron learning.

problem Learning a single neuron with over-parameterization and square loss.
method Analysis of gradient descent dynamics, proving convergence rates and lower bounds.
result Over-parameterization can exponentially slow down the convergence rate of gradient descent.

CREIMBO models diverse brain activity by identifying hidden neural sub-circuits and their non-stationary interactions.

problem Lack of alignment in neural recordings limits analysis of brain-wide dynamics.
method CREIMBO learns a unified model of neural dynamics by assuming multiple hidden global sub-circuits representing ensemble interactions.
result CREIMBO discovers session-specific neural ensembles and their non-stationary interactions, revealing cross-subject neural mechanisms.

Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…

2018-11-02abs ↗pdf ↗

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.

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.

Paper introduces supervised and unsupervised TAM models for binary neurons.

problem Learning and retrieval of structured triplets of patterns in neural networks.
method Extends Hebbian paradigm to supervised and unsupervised protocols, using glassy statistical mechanical techniques.
result Obtained self-consistency equations for critical dataset sizes and retrieval performance.

Improves neural network verification by merging abstract domains and Lagrangian methods.

problem Prove provable bounds for neural network outputs given input ranges.
method Uses zonotopes within a Lagrangian decomposition to verify deep neural networks.
result Yields bounds that improve upon existing techniques in both time and tightness.

Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.

problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.

REPAIR mitigates variance collapse to enable linear interpolation between SGD solutions.

problem Linear interpolation between SGD solutions is difficult due to variance collapse in permuted activations.
method REPAIR rescales preactivations of interpolated networks to mitigate variance collapse.
result 60%-100% relative barrier reduction across various architectures and tasks.

Estimates nonlinear Hawkes processes using RKHSs with ReLU rectification.

problem Nonlinear multivariate Hawkes processes with complex interaction functions.
method Nonparametric estimation using RKHSs with approximations for ReLU and integral operators.
result Proposes an estimation method with bounds on approximation errors.

Accurate statistical models of neural spike responses can characterize the information carried by neural populations. But the limited samples of spike counts during recording usually result in model overfitting. Besides, current models assume spike counts to be Poisson-distributed, which ignores the fact that many neur…

2016-05-10abs ↗pdf ↗

New method improves graph neural networks by considering different types of relations in sampling.

problem Current graph neural networks ignore relation types in biomedical graphs, leading to suboptimal performance.
method Proposes relation-dependent sampling for multi-relational graphs to balance relation frequency and importance.
result State-of-the-art graph neural networks achieve better accuracy and efficiency with relation-dependent sampling.

Estimates log-likelihood of interacting particle systems using virtual particles.

problem Inconsistent estimation of finite-particle log-likelihood in large particle systems.
method Stochastic gradient estimate using continuous trajectory and virtual particle systems.
result Convergence to stationary points of limiting mean-field system's log-likelihood.

A new method uncovers discrete and continuous factors in gene expression data.

problem Jointly identifying discrete and continuous factors of variability without supervision.
method cpl-mixVAE framework using multiple interacting networks.
result The method successfully uncovers discrete and continuous factors in gene expression data.

Study shows how SGD in large neural networks behaves as neurons increase.

problem Understanding SGD behavior in overparameterized neural networks.
method Probabilistic approach to continuous-time dynamics of SGD, focusing on particle interactions.
result Particles' interactions asymptotically vanish, leading to a mean-field limit.

This work analyzes how different forms of compressibility affect adversarial robustness in neural networks.

problem Understanding the interaction between compressibility and adversarial robustness in neural networks.
method Developed a principled framework to analyze the effects of neuron-level sparsity and spectral compressibility on adversarial robustness.
result Identified that different forms of compression can induce highly sensitive directions in the representation space that adversaries can exploit.

Proposes a new method to better understand complex system interactions.

problem Current methods like Granger causality and transfer entropy fail to capture higher-order interactions.
method Introduces a generalized approach to capture multivariate causal interactions.
result The method can distinguish causal roles in synergetic interactions.

Much of studies on neural computation are based on network models of static neurons that produce analog output, despite the fact that information processing in the brain is predominantly carried out by dynamic neurons that produce discrete pulses called spikes. Research in spike-based computation has been impeded by th…

2017-06-14abs ↗pdf ↗

3-layer NTK models generalize better than 2-layer models, especially with large input dimensions.

problem Understanding the generalization of overparameterized neural networks.
method Analyzing the 3-layer NTK model's test error and comparing it to 2-layer NTK models.
result 3-layer NTK models have a faster descent in test error with respect to the number of neurons in the second hidden layer.

Describes explaining neurons in deep representations using compositional logical concepts.

problem Interpreting neuron behavior in deep neural networks.
method Identifying compositional logical concepts that closely approximate neuron behavior.
result Compositional explanations provide insights into model performance and allow for adversarial example creation.

SeReNe prunes neurons with low sensitivity to reduce network size.

problem Large neural networks consume too many resources on resource-constrained devices.
method Exploits neural sensitivity as a regularizer to prune neurons with low sensitivity.
result Pruning neurons with low sensitivity achieves competitive compression ratios.

Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.

problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.

In this paper we provide a comprehensive analysis of a structural model for the dynamics of prices of assets traded in a market originally proposed in [1]. The model takes the form of an interacting generalization of the geometric Brownian motion model. It is formally equivalent to a model describing the stochastic dyn…

2017-09-29abs ↗pdf ↗