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.
Relief based algorithms have often been claimed to uncover feature interactions. However, it is still unclear whether and how interaction terms will be differentiated from marginal effects. In this paper, we propose IMMIGRATE algorithm by including and training weights for interaction terms. Besides applying the large …
Surrogate-based analysis of interactions via local effect smooths
problem Detecting and characterizing feature interactions in machine learning models
method Surrogate-based analysis using generalized additive models
result Empirical validation of effectiveness for pairwise interactions
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.
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.
ICU mortality scoring systems attempt to predict patient mortality using predictive models with various clinical predictors. Examples of such systems are APACHE, SAPS and MPM. However, most such scoring systems do not actively look for and include interaction terms, despite physicians intuitively taking such interactio…
Recommender systems objectives can be broadly characterized as modeling user preferences over short-or long-term time horizon. A large body of previous research studied long-term recommendation through dimensionality reduction techniques applied to the historical user-item interactions. A recently introduced session-ba…
Modeling interacting objects with latent Gaussian process ODEs.
problem Time uncertainty-aware modeling of continuous-time dynamics of interacting objects.
method A new model using latent Gaussian process ordinary differential equations to infer independent dynamics and interactions.
result Our model improves long-term predictions and successfully encapsulates independent dynamics and interactions.
New method aggregates GDS analyses of randomly selected interaction models to identify important factors in screening experiments.
problem Erroneous conclusions from main-effects models in screening experiments.
method Gauss-Dantzig Selector Aggregation over Random Models (GDS-ARM).
result Identifies important factors by aggregating GDS analyses of randomly selected interaction models.
Deep Rule Forests identifies drug-drug and drug-disease interactions causing AKI.
problem Identifying drug-drug and drug-disease interactions leading to AKI.
method Deep Rule Forests (DRF) algorithm discovering rules from multilayer tree models.
result DRF model outperforms other algorithms in prediction accuracy and interpretability.
Genetic algorithms are a well-known method for tackling the problem of variable selection. As they are non-parametric and can use a large variety of fitness functions, they are well-suited as a variable selection wrapper that can be applied to many different models. In almost all cases, the chromosome formulation used …
Quantum mechanics applied to option pricing with a time-dependent bubble.
problem Option pricing with a time-dependent arbitrage bubble.
method Application of Dirac's interaction picture to the Black-Scholes equation.
result Exact and approximate solutions for option pricing with a square bubble.
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.
In this work, we aim to predict the future motion of vehicles in a traffic scene by explicitly modeling their pairwise interactions. Specifically, we propose a graph neural network that jointly predicts the discrete interaction modes and 5-second future trajectories for all agents in the scene. Our model infers an inte…
LSTM improves cross-network recommendations by capturing user preference changes and irregular time intervals.
problem Offline cross-network recommender solutions fail to capture user preference changes and dynamic environments.
method Proposes a multi-layered LSTM network with attention mechanisms, higher order interactions, and time-aware gates.
result The model consistently outperforms state-of-the-art in accuracy, diversity, and novelty.
Study robust learning without knowing perturbation sets, using interactions with attackers.
problem Learning robust predictors against unknown adversarial perturbations.
method Examined different interaction models with adversarial attackers, derived bounds on sample complexity and interactions.
result Upper bounds on sample complexity and lower bounds on interactions in various models.
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…
Motivated by the pursuit of a systematic computational and algorithmic understanding of Generative Adversarial Networks (GANs), we present a simple yet unified non-asymptotic local convergence theory for smooth two-player games, which subsumes several discrete-time gradient-based saddle point dynamics. The analysis rev…
WayDCM predicts trajectories considering long-term goals, improving accuracy.
problem Predicting future trajectories of dynamic agents in complex environments.
method WayDCM combines DCM and NN to predict intermediate goals and trajectories, considering long-term goals.
result WayDCM outperforms previous methods on the Waymo Open dataset.
Study on capillarity minimizers with nonlocal repulsion and gravity, proving existence and nonexistence.
problem Minimizing an energy functional with capillarity, nonlocal repulsion, and gravity.
method Quantitative isoperimetric inequalities applied to capillarity problem in a half-space.
result Existence and nonexistence of minimizers for various nonlocal kernels and masses.
KGRL uses reinforcement learning with knowledge graphs for better interactive recommendation.
problem Achieving responsiveness and accuracy in dynamic user-item interactions.
method KGRL combines reinforcement learning and knowledge graphs, using a local knowledge network and attention mechanism.
result KGRL outperforms state-of-the-art methods in simulated and real-world environments.
Improved estimation of interaction effects in regression models.
problem Estimation of interaction effects in high-dimensional regression models.
method Developed a local shrinkage model linking main effects and interactions.
result Strong improvement in estimation of regression coefficients.
Study finds conditions for global minimizers on curved manifolds with fast diffusion and nonlocal interactions.
problem Existence of global minimizers for a free energy functional on negatively curved manifolds.
method Investigation of Carlson-Levin type inequalities for Cartan-Hadamard manifolds.
result Establishes necessary and sufficient conditions for the existence of global energy minimizers.
The search for higher-order feature interactions that are statistically significantly associated with a class variable is of high relevance in fields such as Genetics or Healthcare, but the combinatorial explosion of the candidate space makes this problem extremely challenging in terms of computational efficiency and p…
Study infers interaction kernels from multiple particle trajectories.
problem Inferring interaction kernels from multiple particle trajectories in stochastic systems.
method Nonparametric inference approach based on regularized maximum likelihood estimator.
result Consistent estimator with near-optimal learning rate independent of state space dimension.
A first-order formulation of gravity is developed in which the fundamental fields consist of an SL(2,C) connection and two spinor-valued 1-forms. It is shown that the first term of an expansion of the Einstein-Hilbert action leads to an action for these fields which consists of dynamic L2 inner products of their covari…
TSLANet improves time series models by capturing long-term and short-term interactions.
problem Noise sensitivity, computational efficiency, and overfitting in Transformer-based models for time series data.
method Adaptive Spectral Block and Interactive Convolution Block for robust feature representation and noise mitigation.
result TSLANet outperforms state-of-the-art models in various time series tasks.
This paper is concerned with the problems of interaction screening and nonlinear classification in a high-dimensional setting. We propose a two-step procedure, IIS-SQDA, where in the first step an innovated interaction screening (IIS) approach based on transforming the original p-dimensional feature vector is propose…
In this paper, we propose a hybrid bankcard response model, which integrates decision tree based chi-square automatic interaction detection (CHAID) into logistic regression. In the first stage of the hybrid model, CHAID analysis is used to detect the possibly potential variable interactions. Then in the second stage, t…
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.
SLIM model tackles graph classification by resolving part-interaction dilemmas.
problem Difficulty in modeling graph parts and their interactions in graph classification.
method SLIM model, which solves resolution dilemmas and leverages explicit interactions.
result SLIM offers improved interpretability, accuracy, and new insights in graph representation learning.
The collective phenomena of a liquid market is characterized in terms of a particle system scenario. This physical analogy enables us to disentangle intrinsic features from purely stochastic ones. The latter are the result of environmental changes due to a `heat bath' acting on the many-asset system, quantitatively des…
Graphs can model interactions between vertices, but how well depends on graph structure.
problem Lack of formal characterization of GNNs' ability to model interactions between vertices.
method Formalized interaction strength using separation rank and quantified it for different partitions of vertices.
result GNNs' ability to model interactions is primarily determined by the partition's walk index.
With the information explosion of news articles, personalized news recommendation has become important for users to quickly find news that they are interested in. Existing methods on news recommendation mainly include collaborative filtering methods which rely on direct user-item interactions and content based methods …
Trial-and-error based reinforcement learning (RL) has seen rapid advancements in recent times, especially with the advent of deep neural networks. However, the majority of autonomous RL algorithms require a large number of interactions with the environment. A large number of interactions may be impractical in many real…
XGL uses global explanations to guide human supervision in machine learning.
problem Improving model quality through human-machine interaction.
method XGL employs global explanations to guide human selection of informative examples.
result XGL avoids overselling the model's quality and performs comparably to other strategies.
Develops a new algorithm for estimating model parameters using interacting particle systems.
problem Estimating parameters of latent variable models.
method Interacting Particle Langevin Algorithm (IPLA) based on Langevin diffusion.
result Nonasymptotic optimisation error bounds for the estimator.
Paper introduces IC-index to evaluate interaction prediction methods.
problem Evaluate interaction prediction methods using IC-index.
method IC-index measures interaction direction prediction performance.
result IC-index complements existing prediction performance estimators.
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.
AutoFIS automatically selects important feature interactions for CTR prediction models.
problem Manual feature interaction design is inefficient and prone to noise.
method Two-stage algorithm: search stage relaxes feature interactions to continuous parameters, re-train stage refines model performance.
result AutoFIS significantly improves CTR and CVR of FM-based models.
Reasoning about graphs evolving over time is a challenging concept in many domains, such as bioinformatics, physics, and social networks. We consider a common case in which edges can be short term interactions (e.g., messaging) or long term structural connections (e.g., friendship). In practice, long term edges are oft…
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.
BGNN improves GNN by modeling interactions between neighbor nodes.
problem Existing GNN models fail to capture interactions between neighbor nodes, leading to suboptimal performance.
method Proposes a new graph convolution operator that augments the weighted sum with pairwise interactions of neighbor nodes.
result Empirical results show BGNN models outperform traditional GNN models in node classification accuracy.
BaGGLS models biological interactions using Bayesian shrinkage for interpretability.
problem Interpreting complex interactions in high-dimensional biological data.
method Bayesian group global-local shrinkage prior with variational approximation.
result BaGGLS outperforms other methods in interaction detection and scalability.
Study estimates long-term effects of online advertising mechanisms on user behavior and revenue.
problem Estimating long-term treatment effects in online advertising systems.
method Modeling treatment effects as a stopped random walk, using experimental design, and statistical methods.
result Confidence intervals for long-term treatment effects constructed using statistical techniques.
Most common navigation tasks in human environments require auxiliary arm interactions, e.g. opening doors, pressing buttons and pushing obstacles away. This type of navigation tasks, which we call Interactive Navigation, requires the use of mobile manipulators: mobile bases with manipulation capabilities. Interactive N…
Quadratic regression involves modeling the response as a (generalized) linear function of not only the features xj1 but also of quadratic terms xj1xj2. The inclusion of such higher-order "interaction terms" in regression often provides an easy way to increase accuracy in already-high-dimensional problem…
Traffic actors' future motion predicted using a hybrid graph model.
problem Predicting long-term behaviors of traffic actors in complex scenes.
method A hybrid graph model with nodes for actors and traffic elements, and edges for interaction types.
result TrafficGraphNet achieves state-of-the-art trajectory prediction accuracy.