Neural M3 model adapts to diverse user behaviors over short and long timeframes.
problem Adapting to diverse user behaviors over short and long timeframes.
method Neural Multi-temporal-range Mixture Model (M3) combining short-term and long-term models with a learned gating mechanism.
result M3 consistently outperforms state-of-the-art sequential recommendation methods.
New method interprets deep neural networks for better recommendation system understanding.
problem Making deep neural networks explainable for better user trust and understanding.
method Proposes a novel formulation of interpretable deep neural networks using masked weights and hidden features.
result Demonstrates models achieving close predictive performance with informative attributions.
Determinantal point processes (DPPs) are an elegant model for encoding probabilities over subsets, such as shopping baskets, of a ground set, such as an item catalog. They are useful for a number of machine learning tasks, including product recommendation. DPPs are parametrized by a positive semi-definite kernel matrix…
ContextWIN uses neural networks and reinforcement learning to optimize decisions in dynamic environments.
problem Optimizing decisions in dynamic, context-aware environments like recommendation systems.
method Integrates a mixture of experts within a reinforcement learning framework to compute context-specific weights for decision-making.
result Enhanced efficiency and accuracy in Whittle index computation for each arm in RMABs.
DSelect-k improves MoE models for multi-task learning with better performance and smoother training.
problem Smoothness and convergence issues in sparse gate selection for MoE models.
method Developed DSelect-k, a differentiable and sparse gate for MoE models.
result DSelect-k achieves statistically significant improvements in prediction and expert selection over Top-k.
MEANTIME improves sequential recommendation by using multi-temporal embeddings and attention mechanisms.
problem Limited use of timestamp information and information bottleneck in sequential recommendation models.
method MEANTIME employs multiple types of temporal embeddings and attention mechanisms to capture diverse patterns from user behavior sequences.
result MEANTIME outperforms state-of-the-art sequential recommendation methods.
Automates VI divergence selection for efficient few-shot learning.
problem Efficiently selecting divergence measures for VI to improve performance.
method Meta-learning algorithm to learn optimal divergence metric and variational parameter initialization.
result Meta-learning approach outperforms standard VI methods across various tasks.
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and (largely ad-hoc) hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recommendations…
We introduce normalized nonnegative models (NNM) for explorative data analysis. NNMs are partial convexifications of models from probability theory. We demonstrate their value at the example of item recommendation. We show that NNM-based recommender systems satisfy three criteria that all recommender systems should ide…
A new graph embedding method using Hebbian learning for improved vector representations.
problem Creating accurate vector representations for nodes in graphs.
method Hebbian learning with non-convex Gaussian mixture model for node embeddings.
result The method outperforms state-of-the-art methods on benchmark data sets and generates relevant recommendations.
Learning distributed representations of documents has pushed the state-of-the-art in several natural language processing tasks and was successfully applied to the field of recommender systems recently. In this paper, we propose a novel content-based recommender system based on learned representations and a generative m…
The paper addresses treatment recommendation problems by optimizing distributional characteristics.
problem Optimizing treatment recommendations based on distributional targets.
method Characterizes the problem's difficulty and proposes near-optimal policies.
result Characterizes the difficulty of the problem and proposes near-regret optimal policies.
Proposes HBGNN for better recommendation systems using graph neural networks.
problem Sparse structured data in recommendation systems lacking feature richness.
method Hierarchical BiGraph Neural Network (HBGNN) using bigraph framework.
result Competitive performance compared to current methods.
Paper proposes MACDAE to infer real-time O2O contexts.
problem Difficult to infer users' real-time contexts, especially implicit ones, for O2O recommendation.
method MACDAE: a model that infers implicit contexts from user-item-explicit context interactions.
result Significant improvements in click-through rate and conversion rate in real-world traffic.
MGDRec optimizes multiple objectives in recommender systems.
problem Optimizing for multiple, often conflicting objectives in recommender systems.
method Stochastic multi-gradient descent approach (MGDRec).
result MGDRec outperforms state-of-the-art methods in traditional objective mixtures.
A hybrid approach uses RNNs to recommend news articles based on context and session history.
problem Challenging news recommendation due to varying user interests and factors.
method Context-aware, hybrid, deep learning approach using RNNs with additional information types.
result Significantly higher recommendation accuracy and catalog coverage compared to other session-based algorithms.
This paper analyzes EM algorithm for softmax mixture models in high dimensions.
problem Modeling heterogeneous populations choosing from multiple attributes.
method Comprehensive analysis of the EM algorithm for softmax mixture models (SMMs), proving identifiability and convergence.
result EM algorithm recovers mixture atoms at near-parametric rate under suitable initialization.
Graph neural networks improve cold start for new items in recommender systems.
problem Cold start problem for new items in recommender systems.
method Item hierarchy graphs and bespoke graph neural network architecture.
result Our method achieves better forecasting quality than state-of-the-art with comparable computational time.
Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more general model assumes that each column of X corresponds to one of several low-rank ma…
Two neural network-based mixture models with E-M learning for efficient likelihood computation.
problem Efficiently computing likelihood in mixture models with complex structures.
method Explicit mixture models with flow-based neural networks, E-M algorithm for parameter learning.
result Demonstrated efficiency in generating samples and maximum likelihood classification.
Recommenders have become widely popular in recent years because of their broader applicability in many e-commerce applications. These applications rely on recommenders for generating advertisements for various offers or providing content recommendations. However, the quality of the generated recommendations depends on …
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.
KitcheNette predicts and recommends food ingredient pairings.
problem Limited study of food ingredient pairings despite many existing pairings.
method Siamese neural networks trained on a dataset of 300K scores.
result KitcheNette outperforms other models and discovers novel pairings.
Recommendations are broadly used in marketplaces to match users with items relevant to their interests and needs. To understand user intent and tailor recommendations to their needs, we use deep learning to explore various heterogeneous data available in marketplaces. This paper focuses on the challenge of measuring re…
Unified deep framework for personalized recommendations with uncertainty.
problem Uncertainty in user preferences in recommendation systems.
method Gaussian embeddings, Monte-Carlo sampling, convolutional neural networks.
result Superior performance in recommendation accuracy compared to state-of-the-art models.
Deep neural networks converge to Gaussian mixtures as layer width increases.
problem Understanding the distribution of outputs from deep neural networks.
method Proof and experiments with a simple model showing the convergence of neural network outputs to Gaussian mixtures.
result Neural networks converge to Gaussian mixtures as the width of the last hidden layer increases.
Two-stage recommender systems show better performance when components interact rather than operate independently.
problem Two-stage recommender systems are often treated as sums of their parts, ignoring interactions between components.
method Used synthetic and real-world data to demonstrate interactions between ranker and nominators. Derived a generalization lower bound and proposed a Mixture-of-Experts approach to learn optimal item pools.
result Independent nominator training can lead to performance on par with random recommendations, highlighting the importance of interactions.
Develops NFCF to reduce gender bias in social media recommendation systems.
problem Reduces gender bias in collaborative filtering systems on social media data.
method Pre-training and fine-tuning neural collaborative filtering with bias correction techniques.
result Achieves better performance and fairness in gender de-biased recommendations.
In many applications, multivariate samples may harbor previously unrecognized heterogeneity at the level of conditional independence or network structure. For example, in cancer biology, disease subtypes may differ with respect to subtype-specific interplay between molecular components. Then, both subtype discovery and…
System recommends workouts and predicts success rates using RNNs.
problem Promoting healthy lifestyles through personalized exercise recommendations.
method Two interconnected recurrent neural networks (RNNs) using historical workout data.
result Interconnected-RNN model predicts exercise success rates with improved accuracy.
A new model learns preferences incrementally without personal data.
problem Incremental session-based recommendation without personal data.
method Memory Augmented Neural model (MAN) that combines a neural recommender with a nonparametric memory.
result MAN consistently outperforms existing methods in incremental session-based recommendation.
Optimal transport strategy reduces gender bias in job recommendation systems.
problem Mitigating gender biases in AI-driven job recommendation systems.
method Model agnostic optimal transport strategy applied to multi-class neural networks.
result Reduced undesirable algorithmic biases in job recommendation tasks.
CHAMELEON uses RNNs to recommend news sequences better than other methods.
problem Improving news recommendation accuracy and catalog coverage.
method Hybrid meta-architecture CHAMELEON with RNNs for sequence modeling and side information.
result Significantly higher recommendation accuracy and catalog coverage.
Proposes a deep hybrid model for better recommendation systems.
problem Limited studies on hybrid recommender systems and the need for more advanced approaches.
method Integrates deep learning with ID embeddings and auxiliary features for improved recommendation.
result Improves recommendation results over deep learning models using ID embeddings.
NAS model improves social recommendation accuracy using neural attention.
problem Capturing and weighing friends' preferences in social recommendation systems.
method Proposes a Neural Attention mechanism (NAS) for Social collaborative filtering.
result NAS model outperforms state-of-the-art methods in publicly available datasets.
Develops M2 model for next-basket recommendation considering user preferences, item popularity, and transition patterns.
problem Next-basket recommendation problem considering user preferences, item popularity, and transition patterns.
method Mixed model with preferences, popularities, and transitions (M2) using ed-Trans for transition patterns among items.
result Significantly outperforms state-of-the-art methods on all datasets in all tasks, with up to 22.1% improvement.
NMDR estimates complex mixtures of distributions efficiently.
problem Estimating complex finite mixtures of distributions in high-dimensional settings.
method Flexible additive predictors, neural networks, and deep learning optimizers.
result Competitive performance in complex scenarios compared to existing approaches.
News recommender systems are aimed to personalize users experiences and help them to discover relevant articles from a large and dynamic search space. Therefore, news domain is a challenging scenario for recommendations, due to its sparse user profiling, fast growing number of items, accelerated item's value decay, and…
Traditional recommendation systems rely on past usage data in order to generate new recommendations. Those approaches fail to generate sensible recommendations for new users and items into the system due to missing information about their past interactions. In this paper, we propose a solution for successfully addressi…
FedRule uses graph neural networks to recommend rules for smart homes without centralizing data.
problem Manual rule setup for smart devices is inefficient and privacy-compromising.
method FedRule constructs user-specific graphs for rule recommendation, using federated learning to protect privacy.
result FedRule achieves comparable performance to centralized methods and outperforms others.
Recent advances in neural networks have inspired people to design hybrid recommendation algorithms that can incorporate both (1) user-item interaction information and (2) content information including image, audio, and text. Despite their promising results, neural network-based recommendation algorithms pose extensive …
Study evaluates ZSL methods for unseen hashtag predictions from tweet text.
problem Lack of labeled data for all possible hashtag labels in supervised training.
method Proposed a Zero Shot Learning (ZSL) paradigm to predict unseen hashtag labels.
result Demonstrated effectiveness and scalability of ZSL methods for unseen hashtag recommendations.
Proposes a flexible neural recommendation framework for better prediction performance.
problem Data sparsity, cold start problem, and long-tail distribution in recommendations.
method A modular neural recommendation framework that includes a neural collaborative filtering part and a text processing part as a regularizer.
result Achieves better prediction performance than state-of-the-art text-aware methods using a simple text processing approach.
This paper proposes a framework to learn explainable rules from knowledge graphs for better recommendation.
problem Combining side information with explainability in recommendation systems.
method Joint learning framework integrating rule induction from knowledge graphs with a rule-guided neural recommendation model.
result Significant improvements in item recommendation performance over baselines.
Proposes a graph neural network for personalized news recommendation.
problem Data sparsity in news recommendation systems.
method Heterogeneous graph model + Graph Neural Networks + LSTM attention mechanism.
result Significantly outperforms state-of-the-art methods on news recommendation datasets.
AdaEnsemble learns adaptive feature interactions for CTR prediction.
problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.
AI2V learns user representations by focusing on recent interests.
problem User interests and behavior change over time, affecting recommendation quality.
method Introduces AI2V, a neural attentive model that learns user representations by focusing on recent interests.
result AI2V outperforms other models on various datasets.
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…