Search Results for author:
Found 24 papers, 12 papers with code
Ten Challenges in Industrial Recommender Systems
Huawei's vision and mission is to build a fully connected intelligent world.
Multi-domain Recommendation with Embedding Disentangling and Domain Alignment
We propose a new MDR method named EDDA with two key components, i. e., embedding disentangling recommender and domain alignment, to tackle the two challenges respectively.
Towards Open-World Recommendation with Knowledge Augmentation from Large Language Models
In this work, we propose an Open-World Knowledge Augmented Recommendation Framework with Large Language Models, dubbed KAR, to acquire two types of external knowledge from LLMs -- the reasoning knowledge on user preferences and the factual knowledge on items.
How Can Recommender Systems Benefit from Large Language Models: A Survey
For the "WHERE" question, we discuss the roles that LLM could play in different stages of the recommendation pipeline, i. e., feature engineering, feature encoder, scoring/ranking function, and pipeline controller.
Set-to-Sequence Ranking-based Concept-aware Learning Path Recommendation
Noticing that existing approaches fail to consider the correlations of concepts in the path, we propose a novel framework named Set-to-Sequence Ranking-based Concept-aware Learning Path Recommendation (SRC), which formulates the recommendation task under a set-to-sequence paradigm.
A Survey on User Behavior Modeling in Recommender Systems
Besides, we elaborate on the industrial practices of UBM methods with the hope of providing insights into the application value of existing UBM solutions.
A Bird's-eye View of Reranking: from List Level to Page Level
Moreover, simply applying a shared network for all the lists fails to capture the commonalities and distinctions in user behaviors on different lists.
An F-shape Click Model for Information Retrieval on Multi-block Mobile Pages
However, with the development of user interface (UI) design, the layout of displayed items on a result page tends to be multi-block (i. e., multi-list) style instead of a single list, which requires different assumptions to model user behaviors more accurately.
A Graph-Enhanced Click Model for Web Search
To better exploit search logs and model users' behavior patterns, numerous click models are proposed to extract users' implicit interaction feedback.
Multi-Level Interaction Reranking with User Behavior History
MIR combines low-level cross-item interaction and high-level set-to-list interaction, where we view the candidate items to be reranked as a set and the users' behavior history in chronological order as a list.
PEAR: Personalized Re-ranking with Contextualized Transformer for Recommendation
Specifically, PEAR not only captures feature-level and item-level interactions, but also models item contexts from both the initial ranking list and the historical clicked item list.
Neural Re-ranking in Multi-stage Recommender Systems: A Review
As the final stage of the multi-stage recommender system (MRS), re-ranking directly affects user experience and satisfaction by rearranging the input ranking lists, and thereby plays a critical role in MRS. With the advances in deep learning, neural re-ranking has become a trending topic and been widely applied in industrial applications.
Context-aware Reranking with Utility Maximization for Recommendation
As a critical task for large-scale commercial recommender systems, reranking has shown the potential of improving recommendation results by uncovering mutual influence among items.
Retrieval & Interaction Machine for Tabular Data Prediction
Prediction over tabular data is an essential task in many data science applications such as recommender systems, online advertising, medical treatment, etc.
Balancing Accuracy and Fairness for Interactive Recommendation with Reinforcement Learning
Fairness in recommendation has attracted increasing attention due to bias and discrimination possibly caused by traditional recommenders.
An Adversarial Imitation Click Model for Information Retrieval
Modern information retrieval systems, including web search, ads placement, and recommender systems, typically rely on learning from user feedback.
Opportunistic Multi-aspect Fairness through Personalized Re-ranking
In this paper, we present a re-ranking approach to fairness-aware recommendation that learns individual preferences across multiple fairness dimensions and uses them to enhance provider fairness in recommendation results.
Inter-sequence Enhanced Framework for Personalized Sequential Recommendation
Then, based on the inter-sequence correlation encoder, we build GRU network and attention network in the intra-sequence correlation encoder to model the item sequential correlation within each individual sequence and temporal dynamics for predicting users' preferences over candidate items.
Consistency-Aware Recommendation for User-Generated ItemList Continuation
Complementary to methods that exploit specific content patterns (e. g., as in song-based playlists that rely on audio features), the proposed approach models the consistency of item lists based on human curation patterns, and so can be deployed across a wide range of varying item types (e. g., videos, images, books).
Contextual Combinatorial Conservative Bandits
The problem of multi-armed bandits (MAB) asks to make sequential decisions while balancing between exploitation and exploration, and have been successfully applied to a wide range of practical scenarios.
Wasserstein Collaborative Filtering for Item Cold-start Recommendation
We further adopt the idea of CF and propose Wasserstein CF (WCF) to improve the recommendation performance on cold-start items.
PMD: An Optimal Transportation-based User Distance for Recommender Systems
Collaborative filtering, a widely-used recommendation technique, predicts a user's preference by aggregating the ratings from similar users.
Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models
We introduce a new molecular dataset, named Alchemy, for developing machine learning models useful in chemistry and material science.
Utilizing Edge Features in Graph Neural Networks via Variational Information Maximization
The IGNN model is based on an elegant and fundamental idea in information theory as explained in the main text, and it could be easily generalized beyond the contexts of molecular graphs considered in this work.
