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

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for variable interactions

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.

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.

PliableBVS extends Bayesian lasso for modeling interactions with modifying variables.

problem Modeling interactions between large and small sets of variables, especially in omics studies.
method Bayesian variable selection with spike-and-slab priors and hierarchical structure.
result PliableBVS outperforms pliable lasso in identifying active main and interaction effects.

Ising models describe the joint probability distribution of a vector of binary feature variables. Typically, not all the variables interact with each other and one is interested in learning the presumably sparse network structure of the interacting variables. However, in the presence of latent variables, the convention…

2019-01-28abs ↗pdf ↗

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.

A new method quickly identifies key variables and interactions.

problem Identifying key variables and interactions in high-dimensional data.
method Kernel trick for sparse orthogonal decomposition in O(# covariates) time.
result Outperforms existing methods for large, high-dimensional data sets.

TimeCNN improves forecasting by refining cross-variable interactions over time.

problem Multivariate time series forecasting struggles with dynamic and multifaceted cross-variable correlations.
method TimeCNN uses timepoint-independent convolution kernels to capture evolving relationships among variables.
result TimeCNN outperforms state-of-the-art models in real-world datasets with significant computational and speed advantages.

Variable selection for optimal treatment regime in a clinical trial or an observational study is getting more attention. Most existing variable selection techniques focused on selecting variables that are important for prediction, therefore some variables that are poor in prediction but are critical for decision-making…

2014-05-20abs ↗pdf ↗

Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked. Here, we propos…

2013-03-25abs ↗pdf ↗

RBMs model binary interactions with hidden node activation effects.

problem Understanding how RBM hidden node activation affects binary variable distributions.
method Investigated RBM marginal distributions with different hidden node activation functions.
result Found exact expressions for RBM marginals as interacting binary variables.

Proposes a new variable grouping approach to improve Bayesian additive regression tree (BART) performance.

problem Improving the predictive performance of BART by reducing nonlinear interactions.
method Variable grouping to identify and separate variables into groups with no nonlinear interactions.
result The proposed GBART method significantly outperforms classical approaches in synthetic and real data experiments.

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.

iCITRIS learns causal variables from interactive systems with instantaneous effects.

problem Identifying causal variables from temporal sequences with instantaneous effects.
method iCITRIS method for causal representation learning that handles instantaneous effects in intervened temporal sequences.
result iCITRIS accurately identifies causal variables and their causal graph from three interactive system datasets.

New framework for detecting complex interactions in multivariate data.

problem Insufficient pairwise measures fail to capture multivariate data complexities.
method Lattice theory and operator functions to derive higher-order information-theoretic measures.
result Streitberg Information fully characterizes all interactions among dd variables.

New method handles correlated responses and interaction effects in multi-response regression.

problem Handling correlated responses and interaction effects in multi-response regression.
method MADMMplasso, an ADMM-based approach for multi-response regression with overlapping groups and interaction effects.
result The proposed method outperforms in prediction and variable selection for correlated responses and interaction effects.

We introduce kernel nonparametric tests for Lancaster three-variable interaction and for total independence, using embeddings of signed measures into a reproducing kernel Hilbert space. The resulting test statistics are straightforward to compute, and are used in powerful interaction tests, which are consistent against…

2013-06-10abs ↗pdf ↗

Proposes ICE-based metric for better understanding interactions in black-box models.

problem Misleading global sensitivity metrics in black-box models due to interaction effects.
method Individual Conditional Expectation (ICE) curves to compute feature importance and interactions.
result ICE-based metric provides richer insights into feature importance and interactions.

In many data exploration tasks it is meaningful to identify groups of attribute interactions that are specific to a variable of interest. For instance, in a dataset where the attributes are medical markers and the variable of interest (class variable) is binary indicating presence/absence of disease, we would like to k…

2016-12-22abs ↗pdf ↗

A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Detecting hidden variables poses two problems: determining the relations to other variables in the model and determining the number of states of …

2013-01-10abs ↗pdf ↗

Method identifies causal interactions between time series using extreme eigenvalue variability.

problem Detecting causal interactions between time series.
method Largest eigenvalue of lagged correlation matrices, measuring causal interactions through variability.
result The method outperforms traditional Granger causality tests in detecting structural changes.

Proposes a two-stage method for testing variable interactions with FDR control.

problem Testing pairwise interactions in high-dimensional data with dependence.
method Two-stage testing procedure with FDR control using Cramér type moderate deviation technique.
result The proposed method controls FDR and has comparable or improved statistical power.

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.

Study of local optima in neural networks for feature interactions.

problem NNs struggle with local optima in feature interactions for small datasets.
method Proposed a node pruning and feature selection algorithm to improve NN performance.
result NNs have many non-equivalent local optima in XOR-like data with irrelevant variables.

When performing regression on a dataset with pp variables, it is often of interest to go beyond using main linear effects and include interactions as products between individual variables. For small-scale problems, these interactions can be computed explicitly but this leads to a computational complexity of at least $…

2016-10-17abs ↗pdf ↗

KIPLMC methods improve statistical inference in latent variable models.

problem Statistical inference in latent variable models.
method Joint diffusion process in parameter and latent variable spaces, with two explicit discretizations.
result KIPLMC methods achieve accelerated convergence rates in Wasserstein-2 distance.

CIB compresses variables causally, preserving key causal interactions.

problem Constructing causal variable abstractions in complex systems.
method Causal Information Bottleneck (CIB) method, extending IB to include causal structures.
result CIB produces causally interpretable abstractions that accurately capture causal relations.

Identification of informative variables in an information system is often performed using simple one-dimensional filtering procedures that discard information about interactions between variables. Such approach may result in removing some relevant variables from consideration. Here we present an R package MDFS (MultiDi…

2018-10-31abs ↗pdf ↗

A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of interacting entities. This formulation jointly estimates non-linearities in the…

2018-06-28abs ↗pdf ↗

In life sciences, the experts generally use empirical knowledge to recode variables, choose interactions and perform selection by classical approach. The aim of this work is to perform automatic learning algorithm for variables selection which can lead to know if experts can be help in they decision or simply replaced …

2015-11-04abs ↗pdf ↗

SDAMI enhances interpretable high-dimensional regression with sparse deep learning and footprint principle.

problem Personalized models for small samples and high-dimensional features with interpretability.
method Sparse Deep Additive Model with Interactions (SDAMI) combining sparsity-driven feature selection and deep subnetworks.
result SDAMI successfully identifies pure interactions with near-zero false positive rates.

Additive nonparametric regression models provide an attractive tool for variable selection in high dimensions when the relationship between the response and predictors is complex. They offer greater flexibility compared to parametric non-linear regression models and better interpretability and scalability than the non-…

2016-07-09abs ↗pdf ↗

LIT-LVM improves linear predictors by estimating interaction terms with latent vectors.

problem Accurately estimating coefficients for interaction terms in linear predictors.
method Structured regularization using latent vectors to represent features.
result LIT-LVM achieves superior prediction accuracy compared to other methods.

We apply a wild bootstrap method to the Lancaster three-variable interaction measure in order to detect factorisation of the joint distribution on three variables forming a stationary random process, for which the existing permutation bootstrap method fails. As in the i.i.d. case, the Lancaster test is found to outperf…

2016-03-02abs ↗pdf ↗

Two ANOVA-based algorithms boost random Fourier feature models for function approximation.

problem Approximating high-dimensional functions with low-order interactions.
method Utilizes ANOVA decomposition to learn low-order functions and index sets of important variables.
result Significantly reduces approximation error compared to existing methods.