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

306089119 · Jun 202019922001200920172026
48 results for inhibitory interactions

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.

Cortical circuits exhibit intricate recurrent architectures that are remarkably similar across different brain areas. Such stereotyped structure suggests the existence of common computational principles. However, such principles have remained largely elusive. Inspired by gated-memory networks, namely long short-term me…

2017-11-07abs ↗pdf ↗

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(λ)λ1aP_{\mathrm{ss}}(λ)\propto λ^{-1-a}, with aa as a function of parameters.

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.

Many real-world data sets, especially in biology, are produced by complex nonlinear dynamical systems. In this paper, we focus on brain calcium imaging (CaI) of different organisms (zebrafish and rat), aiming to build a model of joint activation dynamics in large neuronal populations, including the whole brain of zebra…

2018-05-24abs ↗pdf ↗

We propose to explain the predictions of a deep neural network, by pointing to the set of what we call representer points in the training set, for a given test point prediction. Specifically, we show that we can decompose the pre-activation prediction of a neural network into a linear combination of activations of trai…

2018-11-23abs ↗pdf ↗

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.

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.

A novel Hawkes Process model captures order sizes in LOBs, improving fit quality and market impact studies.

problem Capturing the variability in order sizes in Limit Order Books (LOBs).
method Compound Hawkes Process with time-varying parameters and non-parametric calibration.
result Improved fit quality and empirical market impact function replication.

SNNs enhance high-frequency price spike forecasting in HFT environments.

problem Conventional financial models fail to capture fine temporal structure in high-frequency price spikes.
method Application of Spiking Neural Networks (SNNs) with hyperparameter tuning via Bayesian Optimization (BO).
result SNN models optimized with PSA achieve significantly higher cumulative returns in backtesting.

Factorization Machine (FM) is a widely used supervised learning approach by effectively modeling of feature interactions. Despite the successful application of FM and its many deep learning variants, treating every feature interaction fairly may degrade the performance. For example, the interactions of a useless featur…

2019-02-26abs ↗pdf ↗

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

iKF method uncovers complex variable interactions for scientific discovery.

problem Limited interpretability of existing models in decision-making applications.
method Iterative Kings' Forests (iKF) method to uncover multi-order interactions.
result iKF provides strong interpretive power for explainable modeling.

A graph neural network detects beneficial feature interactions for recommender systems.

problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

Dropout regularizes against high-order interactions by canceling interaction rates.

problem Overfitting to high-order interactions in neural networks.
method Analyzes Dropout through the lens of interaction effects, showing how it effectively cancels out the probability of surviving interactions of different orders.
result Dropout regularizes against high-order interactions by effectively canceling out the probability of surviving interactions of different orders.

Understanding how features interact with each other is of paramount importance in many scientific discoveries and contemporary applications. Yet interaction identification becomes challenging even for a moderate number of covariates. In this paper, we suggest an efficient and flexible procedure, called the interaction …

2016-05-28abs ↗pdf ↗

Multitask Gaussian process (MTGP) is powerful for joint learning of multiple tasks with complicated correlation patterns. However, due to the assembling of additive independent latent functions, all current MTGPs including the salient linear model of coregionalization (LMC) and convolution frameworks cannot effectively…

2018-08-03abs ↗pdf ↗

SocialInteractionGAN generates realistic human interactions from low-dimensional data.

problem Generating realistic human interactions from limited data.
method Adversarial architecture with a recurrent encoder-decoder generator and dual-stream discriminator.
result SocialInteractionGAN produces high-quality action sequences of interacting people.

A new method detects interactions in machine learning models.

problem Interpreting non-linear and interaction effects in machine learning models.
method Regional effect plots with implicit interaction detection.
result The method quantifies and interprets feature effects reliably, less confounded by interactions.

xDeepInt learns both vector-wise and bit-wise feature interactions.

problem Learning feature interactions for CTR prediction and recommendation.
method Polynomial Interaction Network (PIN) architecture with subspace-crossing mechanism.
result xDeepInt outperforms state-of-the-art models in CTR prediction and recommendation.

This study explores how feature graphs enhance GNNs' performance in modeling interactions.

problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.

Interpreting neural networks is a crucial and challenging task in machine learning. In this paper, we develop a novel framework for detecting statistical interactions captured by a feedforward multilayer neural network by directly interpreting its learned weights. Depending on the desired interactions, our method can a…

2017-05-14abs ↗pdf ↗

We introduce interactive structure discovery, a generic framework that encompasses many interactive learning settings, including active learning, top-k item identification, interactive drug discovery, and others. We adapt a recently developed active learning algorithm of Tosh and Dasgupta (2017) for interactive structu…

2019-06-05abs ↗pdf ↗

This paper uses Gaussian mixtures to mimic interactions in large language models.

problem Simulating interactions in large language models (LLMs) is computationally expensive.
method Developed an interacting Gaussian mixture model (GMM) system to mimic LLM interactions.
result The interacting Gaussian mixture model system can generate, exchange, and update data and parameters efficiently.

Study reveals self-attention's role in learning and generalizing interactions.

problem Understanding self-attention's theoretical role in neural architectures.
method Interacting entities analysis, including multi-agent RL and genetic sequences.
result Self-attention efficiently represents, learns, and generalizes pairwise interactions.

Archipelago provides interpretable explanations of feature interactions in machine learning models.

problem Interpreting the impact of feature interactions on predictions in machine learning models.
method Archipelago is a novel framework for extracting and attributing feature interactions in a scalable and interpretable manner.
result Archipelago provides significantly more interpretable explanations of feature interactions than comparable methods.

Automated tests detect interactions in unstructured data.

problem Detecting interactions between latent variables in low-dimensional systems.
method Derive two interaction tests based on pairwise interventions and integrate them into an active learning pipeline.
result Tests can identify more known biological interactions than random search and standard active learning baselines.

We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially interactive protocols may query users adaptively in sequence, but they cannot return to previously queried users. The vast majority of exist…

2019-04-07abs ↗pdf ↗

PIN models feature interactions using a neural network that mimics decision trees.

problem Modeling feature interactions in tabular data for predictive modeling.
method Tree-like Pairwise Interaction Network (PIN) architecture that captures pairwise feature interactions through a shared feed-forward neural network.
result PIN outperforms traditional and modern neural networks benchmarks in predictive accuracy.

The paper explains DNNs by quantifying interactions among input variables.

problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.

MEI model improves knowledge graph completion by efficiently modeling interactions between embeddings.

problem Efficiently modeling interactions between knowledge graph embeddings to predict missing links.
method MEI divides embeddings into partitions and uses Tucker and block term formats to model interactions efficiently.
result Achieves state-of-the-art performance on link prediction tasks.