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

3106209291,239 · Jun 202019922001200920172026
48 results for interactive method

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 ↗

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.

GTDL methods fail to accurately model feature interactions in tabular data.

problem Accurate modeling of feature interactions in tabular data.
method Graph-based tabular deep learning methods using attention mechanisms and message-passing schemes.
result Current GTDL methods fail to recover meaningful feature interactions due to poor edge recovery.

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.

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.

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 ↗

Unified framework for lower bounds in interactive decision making.

problem Challenges in interactive decision making, especially bandits and reinforcement learning.
method Interactive Fano method and Fractional Covering Number.
result Unified characterization of learnability for stochastic bandit problems and tight lower bounds for interactive decision making.

Method detects interactions for better CTR prediction.

problem Predicting click-through rate with high-dimensional categorical features and time-varying interactions.
method Online Random Intersection Chains (ORIC) for detecting informative interactions.
result ORIC detects high-interpretability interactions that improve CTR prediction.

Diamond method controls FDR for trustworthy feature interaction discovery in ML models.

problem Limited interpretability of ML models due to black box nature.
method Diamond method integrates model-X knockoffs framework to control FDR for non-additive interactions.
result Diamond method ensures accurate discovery of feature interactions with FDR control.

We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improv…

2016-02-16abs ↗pdf ↗

Interactive DR framework for comparing datasets.

problem Limited flexibility in existing DR methods for comparative analysis.
method Unified linear comparative analysis (ULCA) with interactive optimization and visualization.
result ULCA and optimization algorithm improve comparative analysis efficiency and flexibility.

FIVES generates high-order interactive features efficiently and effectively.

problem Automating the generation of high-order interactive features in tabular data.
method Formulates interactive feature generation as edge search on a feature graph, using a GNN and adjacency tensor.
result FIVES outperforms state-of-the-art methods in various datasets and real-world applications.

In this work we present the novel ASTRID method for investigating which attribute interactions classifiers exploit when making predictions. Attribute interactions in classification tasks mean that two or more attributes together provide stronger evidence for a particular class label. Knowledge of such interactions make…

2017-07-24abs ↗pdf ↗

Estimating global pairwise interaction effects, i.e., the difference between the joint effect and the sum of marginal effects of two input features, with uncertainty properly quantified, is centrally important in science applications. We propose a non-parametric probabilistic method for detecting interaction effects of…

2019-01-24abs ↗pdf ↗

We propose a Bayesian regression method that accounts for multi-way interactions of arbitrary orders among the predictor variables. Our model makes use of a factorization mechanism for representing the regression coefficients of interactions among the predictors, while the interaction selection is guided by a prior dis…

2017-09-27abs ↗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.

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.

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.

Graph neural network predicts vehicle interactions and trajectories for autonomous driving.

problem Predicting future motion of vehicles in traffic scenes.
method Graph neural network that jointly predicts interaction modes and 5-second future trajectories.
result Jointly predicting trajectories and interaction modes leads to lower trajectory error.

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 ↗

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.

New method identifies important features and interactions in RF models.

problem Limited theoretical understanding of local feature and interaction importance in RF models.
method Combines global and local analysis to identify frequent feature co-occurrences.
result Proves consistent recovery of true local signal features and interactions.

New method finds significant high-order interactions efficiently.

problem Finding statistically significant high-order interactions in high-dimensional data.
method Extends selective inference to high-order interaction models with pruning strategy.
result Demonstrated efficient and powerful method for high-order interactions.

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.

Bi-GNN models drug interactions using a bi-level graph approach.

problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.

Develop a variational framework for statistical inference on cyclic interactions.

problem Estimating and comparing large-scale recurrent organization in directed interactions.
method Represent directed interactions as edge flows on a simplicial complex and evolve under an energy-minimizing dynamical system.
result Separate transient interaction components from persistent harmonic flows, yielding a low-dimensional cycle space.

Perfect clustering achieved in hypergraphs with enough interactions.

problem Complexity and lack of tractable models for analyzing hypergraphs.
method Introduced an interaction hypergraph model for analyzing hypergraphs, defined latent embeddings, and analyzed spectral estimators.
result A spectral estimate of interaction latent positions can achieve perfect clustering with enough interactions.

GADGET framework decomposes global feature effects using recursive partitioning.

problem Misleading global feature effects when feature interactions are present.
method Generalized additive decomposition of global effects (GADGET) based on recursive partitioning.
result Minimizes interaction-related heterogeneity of local feature effects.

New regularization scheme for FMs improves feature interaction selection.

problem Feature selection in FMs leads to loss of feature interactions.
method Proposes a new regularization scheme for FMs with upper bound of 1\ell_1 regularizer.
result Improves feature interaction selection without restricting sparsity patterns.

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

SIAN bridges simple models to neural networks by identifying necessary feature combinations.

problem The gap between simple models and powerful neural networks in performance.
method Feature interaction detection and sparse selection algorithm.
result Competitive performance across multiple tabular datasets with optimal tradeoff.

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.

To date, testing interactions in high dimensions has been a challenging task. Existing methods often have issues with sensitivity to modeling assumptions and heavily asymptotic nominal p-values. To help alleviate these issues, we propose a permutation-based method for testing marginal interactions with a binary respons…

2012-06-27abs ↗pdf ↗

New method quantifies feature interactions in machine learning models.

problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.