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,657 papers · 148 categories

Trend · papers per month

306089119 · Jun 202019922001200920172026
48 results for time-ordered 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.

We develop a new method to price SOFR futures contracts considering convexity, skew, and smile.

problem Analyzing and pricing SOFR futures contracts with convexity, skew, and smile adjustments.
method A perturbative formalism based on a time-ordered exponential series to solve the backward-Kolmogorov diffusion PDE.
result An analytic pricing formula for SOFR futures contracts that incorporates convexity, skew, and smile adjustments.

We argue that an important contributing factor into market inefficiency is the lack of a robust mechanism for the stock price to rise if a company has good earnings, e.g., via buybacks/dividends. Instead, the stock price is prone to volatility due to rather random perception/interpretation of earnings announcements (am…

2015-11-04abs ↗pdf ↗

Modern health data science applications leverage abundant molecular and electronic health data, providing opportunities for machine learning to build statistical models to support clinical practice. Time-to-event analysis, also called survival analysis, stands as one of the most representative examples of such statisti…

2018-04-09abs ↗pdf ↗

In recent years, several methods have been proposed for the discovery of causal structure from non-experimental data (Spirtes et al. 2000; Pearl 2000). Such methods make various assumptions on the data generating process to facilitate its identification from purely observational data. Continuing this line of research, …

2012-07-04abs ↗pdf ↗

Paper uses bipartite graph to forecast cross-market returns, revealing asymmetry.

problem Cross-market return predictability and asymmetry between U.S. and Chinese markets.
method Directed bipartite graph capturing time-ordered linkages, hypothesis testing for edge selection, regularized and ensemble machine learning models.
result U.S. returns predict Chinese intraday returns, but not vice versa, revealing asymmetry.

fastml guards against data leakage in automated machine learning.

problem Data leakage during preprocessing before resampling inflates apparent performance.
method fastml uses guarded resampling to re-estimate preprocessing inside each resample.
result Guarded resampling reduces apparent performance compared to global preprocessing.

Continuous-time Kyle model shows privacy subsidy from noise-perturbed order flow.

problem Quantifying break-even fees for committed-AMM exchanges under privacy-aggregated information.
method Extended Nakamura's (2026) single-period result to continuous-time, observing order flow perturbed by Brownian noise.
result Cumulative privacy subsidy is identified as equivalent to Loss-Versus-Rebalancing in price observation gap.

Unfair stock trading strategies have been shown to be one of the most negative perceptions that customers can have concerning trading and may result in long-term losses for a company. Investment banks usually place trading orders for multiple clients with the same target assets but different order sizes and diverse req…

2019-12-14abs ↗pdf ↗

New method uses models from regularity structures as features in machine learning.

problem Learning solutions to PDEs with low regularity.
method Developed a flexible definition of model feature vectors and two algorithms for combining them with linear regression.
result Advantage in learning solutions to PDEs compared to alternative methods.

Paper proposes BOCPD for real-time order flow and market impact prediction.

problem Persistent order flow patterns in financial markets.
method Bayesian online change-point detection (BOCPD) with score-driven approach.
result Model outperforms existing models in predicting order flow and market impact.

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.

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 ↗

A semigroup of annuli integrates a central extension of vector fields on S^1.

problem No Lie group exists for complexified vector fields on S^1.
method Introduced an enlargement of the semigroup of annuli and proved it integrates a central extension of vector fields.
result Every partially thin annulus is the time-ordered exponential of a path in the cone of inward pointing complexified vector fields.

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 ↗

Recommender systems, medical diagnosis, network security, etc., require on-going learning and decision-making in real time. These -- and many others -- represent perfect examples of the opportunities and difficulties presented by Big Data: the available information often arrives from a variety of sources and has divers…

2015-02-05abs ↗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.