Proposes HMHP for joint modeling of user-topic interactions.
problem Complex interactions between users, topics and time on social media.
method Hidden Markov Hawkes Process (HMHP) incorporating topical Markov Chains.
result HMHP outperforms state-of-the-art models in generalization and accuracy.
Recommender systems play a central role in providing individualized access to information and services. This paper focuses on collaborative filtering, an approach that exploits the shared structure among mind-liked users and similar items. In particular, we focus on a formal probabilistic framework known as Markov rand…
DBRec discovers latent groups to improve recommendation.
problem Sparse user-item interaction data in recommender systems.
method Simultaneously discovers latent user/item groups and interacts them with users/items for bridging preferences.
result DBRec outperforms state-of-the-art models on real datasets.
New model improves recommendation systems by analyzing user-item interactions.
problem Improving recommendation systems for better user-item interactions.
method Sliced Anti-symmetric Decomposition (SAD) model using tensor decomposition.
result SAD produces the most consistent personalized preferences compared to SOTA models.
JODIE learns dynamic user-item embeddings from interactions, outperforming existing methods.
problem Modeling dynamic user-item interactions for accurate future predictions.
method JODIE uses coupled recurrent models with update, projection, and prediction components, and a novel t-Batch algorithm.
result JODIE outperforms state-of-the-art methods by up to 22.4% on future interaction and state change prediction tasks.
We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. Each user may be recommended a given item at most once. A latent variable model specifies the user preferences: both users and items are clustered into types. Al…
There is much empirical evidence that item-item collaborative filtering works well in practice. Motivated to understand this, we provide a framework to design and analyze various recommendation algorithms. The setup amounts to online binary matrix completion, where at each time a random user requests a recommendation a…
Matrix factorization is a simple and effective solution to the recommendation problem. It has been extensively employed in the industry and has attracted much attention from the academia. However, it is unclear what the low-dimensional matrices represent. We show that matrix factorization can actually be seen as simult…
Optimal recommendation system using user and item clustering.
problem Maximizing recommendation accuracy with limited feedback.
method Latent variable model with user and item clustering, exploiting i.i.d. structure.
result Near-optimal algorithm that combines item and user structures.
Repository tackles fake health news in cancer research.
problem Spread of fake health news over the internet.
method Developed comprehensive FakeHealth repository with rich features and detailed explanations.
result Repository helps in understanding and validating health fake news datasets.
JoVA combines two VAEs to learn user and item representations for better recommendation.
problem Collaborative filtering with implicit feedback.
method Joint Variational Autoencoders (JoVA) with a hinge-based pairwise loss function (JoVA-Hinge).
result JoVA-Hinge outperforms state-of-the-art methods in top-k recommendation.
Fashion preference is a fuzzy concept that depends on customer taste, prevailing norms in fashion product/style, henceforth used interchangeably, and a customer's perception of utility or fashionability, yet fashion e-retail relies on algorithmically generated search and recommendation systems that process structured d…
Paper proposes a hybrid system to address bias in recommender systems.
problem Bias in recommender systems exacerbates existing societal inequalities.
method Hybrid approach combining multiple similarity measures, content, and demographic info.
result Our model provides more accurate and fairer recommendations.
Proposes a semi-supervised approach to predict user-level sentiments in social media.
problem Detect and analyze sentiment in social media, especially user-level sentiments.
method Semi-supervised approach using a heterogeneous graph built from social networks, incorporating user influences and multiple types of links.
result Predicts user-level sentiments for specific topics more effectively than previous supervised learning approaches.
IFM improves recommender systems by learning flexible feature interactions.
problem Dealing with feature interactions in recommender systems can degrade performance.
method Introduces Interaction-Aware Mechanism (IAM) to learn feature and field interactions.
result Improves performance on two well-known datasets compared to state-of-the-art methods.
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 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.
Interactive learning framework for various settings.
problem Various interactive learning settings.
method Adapted active learning algorithm for interactive structure discovery.
result Noise-tolerant algorithm with favorable query complexity.
InteractE improves link prediction in KGs by increasing feature interactions.
problem Improving link prediction in knowledge graphs by inferring missing links.
method Feature permutation, novel feature reshaping, circular convolution.
result InteractE outperforms ConvE on multiple KG datasets.
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.
Improved neural model for social recommendation by integrating social and interest networks.
problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.
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.
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 …
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…
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.
Robot learns to imitate human interactions through deep learning.
problem Teaching robots to coordinate actions with human partners.
method Deep learning framework for motion embedding, prediction, and trajectory generation.
result Importance of predictive and adaptive components for successful imitation.
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.
Bayesian neural networks detect complex interactions with uncertainty.
problem Estimating global pairwise interaction effects with uncertainty.
method Bayesian neural network for modeling interactions, GEH for estimating interaction effects.
result The method empirically outperforms alternatives and detects interpretable interactions.
This paper explores how interactive protocols enhance local differential privacy.
problem The power of interactive protocols in local differential privacy.
method Classification of locally private protocols by compositionality and transformation of fully interactive protocols into sequentially interactive ones.
result Fully interactive protocols can solve problems that sequentially interactive protocols cannot without a significant increase in sample complexity.
Mahé provides hierarchical explanations for complex interactions in machine learning models.
problem Capturing and explaining complex interactions in machine learning models.
method Model-agnostic hierarchical explanations through local interpretation and context-free generalization.
result Improved local interaction interpretations and successful explanation of context-free interactions.
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…
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.
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.
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.
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.
Graphs model traffic interactions, reducing prediction error by 30%.
problem Traffic prediction accuracy with complex interactions.
method Graph Neural Networks (GNN) for modeling vehicle interactions.
result Prediction error decreases by 30% with GNNs compared to non-interaction models.
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.
EpiRL learns to detect gene-gene interactions.
problem Computational challenges in epistasis detection.
method Modeling epistasis as a Markov Decision Process and using reinforcement learning.
result EpiRL discovers highly interacted genes.
Modeling continuous movement of entities in latent space for interaction timing.
problem Analyzing timing and frequency of instantaneous interactions.
method Latent position model with continuous trajectories.
result Individual trajectories estimated from interaction data.
The paper improves dropout's utility by reducing interactions in deep neural networks.
problem Over-fitting problem in deep learning.
method Game-theoretic interactions analysis and interaction loss.
result Interaction loss improves dropout's utility and boosts DNN performance.
New model quantifies interactions' role in real-world phenomena.
problem Understanding the role of interactions in real-world phenomena.
method Interactive Mixed Membership Stochastic Block Model (IMMSBM).
result Interactions significantly improve model predictive power.