Challenge: Existing news recommendation methods learn a single user embedding for each user from their previous behaviors to represent their overall interest. Existing methods only learn 'one' embeddable representation vectors to model user interest.
Approach: They propose a news recommendation method with hierarchical user interest modeling that captures user interest in news rather than a single user embedding.
Outcome: The proposed method can better capture multi-grained user interest in news.

Similar Papers

MINER: Multi-Interest Matching Network for News Recommendation (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods learn a single user embedding from user’s historical behaviors to represent the reading interest.
Approach: They propose a poly attention scheme to learn multiple interest vectors for each user, which encodes the different aspects of user interest.
Outcome: The proposed approach significantly outperforms existing state-of-the-art methods on the MIND news recommendation benchmark.
Fine-grained Interest Matching for Neural News Recommendation (2020.acl-main)

Copied to clipboard

Challenge: Existing studies represent each user as a single vector and then match the candidate news vector, which may lose fine-grained information for recommendation.
Approach: They propose a Fine-grained interest matching method for neural news recommendation based on multi-level representations and fine-grain matching between segment pairs of each browsed news and the candidate news at each semantic level.
Outcome: The proposed model can capture more fine-grained interest matching signals by performing interactions between each pair of news at multi-level semantic granularities.
PP-Rec: News Recommendation with Personalized User Interest and Time-aware News Popularity (2021.acl-long)

Copied to clipboard

Challenge: Existing personalized news recommendation methods have difficulties in making accurate recommendations to cold-start users.
Approach: They propose to incorporate news popularity information to improve cold-start recommendations . they propose to use a popularity-aware user encoder to eliminate popularity bias .
Outcome: The proposed method improves accuracy and diversity of personalized news recommendation on two real-world datasets.
Neural News Recommendation with Heterogeneous User Behavior (D19-1)

Copied to clipboard

Challenge: Existing news recommendation methods rely on news click history to model user interest, but data sparsity is a problem . other kinds of user behaviors such as webpage browsing and search queries can provide useful clues of users’ news reading interest.
Approach: They propose to exploit heterogeneous user behaviors to learn news representations from their titles via CNN networks and apply attention networks to select important words.
Outcome: The proposed approach exploits heterogeneous user behaviors on a real-world dataset.
Two Birds with One Stone: Unified Model Learning for Both Recall and Ranking in News Recommendation (2022.findings-acl)

Copied to clipboard

Challenge: Existing news recommender systems conduct news recall and ranking separately with different models, but maintaining multiple models leads to high computational cost and high latency.
Approach: They propose a unified method for recall and ranking in news recommendation that uses historical news click behaviors to extract user embeddings for ranking from the user's attention query.
Outcome: The proposed method improves recall and ranking efficiency and effectiveness on a benchmark dataset.
Uni-FedRec: A Unified Privacy-Preserving News Recommendation Framework for Model Training and Online Serving (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing news recommendation methods rely on user behavior data to model user interests and user interests.
Approach: They propose a unified news recommendation framework that uses user data locally stored in user clients to train models and serve users in a privacy-preserving way.
Outcome: The proposed framework outperforms baseline methods and effectively protects user privacy.
Hierarchical Modeling for User Personality Prediction: The Role of Message-Level Attention (2020.acl-main)

Copied to clipboard

Challenge: Language processing is increasingly finding use as a supplement for questionnaires to assess psychological attributes of consenting individuals, but most approaches neglect to consider whether all documents of an individual are equally informative.
Approach: They propose a model that uses message-level attention to learn the relative weight of users’ social media posts for assessing their five factor personality traits.
Outcome: The proposed model outperforms models with word-level attention and yields state-of-the-art accuracies for all five personality traits.
Hierarchical User and Item Representation with Three-Tier Attention for Recommendation (N19-1)

Copied to clipboard

Challenge: Existing methods to learn user and item representations from reviews are limited . existing methods learn user representations based on ratings given by users .
Approach: They propose a hierarchical user and item representation model with three-tier attention to learn user and items from reviews for recommendation.
Outcome: The proposed model can learn user and item representations from reviews on four benchmark datasets.
HutCRS: Hierarchical User-Interest Tracking for Conversational Recommender System (2023.emnlp-main)

Copied to clipboard

Challenge: Existing CRSs assume that users like all attributes of the target item and dislike those unrelated to it, which can introduce bias in attribute-level feedback and impede the system’s ability to accurately identify the target items.
Approach: They propose a framework that allows users to explicitly acquire user preferences through natural language conversations by providing explicit answers (yes/no) for each attribute they require.
Outcome: The proposed framework portrays the conversation as a hierarchical interest tree that consists of two stages.
Adaptive and Representative Multi-Interest Modeling for Recommendation with Large Language Model (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for multi-interest analysis of users rely on heuristic assumptions . however, the granularity of raw generation of LLMs is agnostic, leading to overly fine or coarse interest grouping.
Approach: They propose an LLM-driven adaptive and representative multi-interest modeling framework that exploits the agnostic granularity of LLMs for multi-interest analysis.
Outcome: The proposed model outperforms baselines on real-world datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations