AuriSRec: Adversarial User Intention Learning in Sequential Recommendation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work focuses on capturing user implicit preferences from historical interactions and matching them with the next behavior, instead of predicting user explicit intentions. |
| Approach: | They propose an adversarial user intention learning approach for sequential recommendaiton . the approach explicitly predicts user current intentions by taking historical reviews as inputs . |
| Outcome: | The proposed approach explicitly predicts user intentions by inferring their decision-making process as explained in target reviews. |
Similar Papers
UCGRec: User-Centric Graph Learning for LLM-based Sequential Recommendation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for sequential recommendation rely primarily on item descriptions or utilize user preferences independently. |
| Approach: | They propose a method that integrates diverse user-relevant preference signals into a unified user-centric graph and injects the graph-based knowledge into the LLM through end-to-end training with graph neural networks. |
| Outcome: | The proposed method outperforms conventional and state-of-the-art methods on four widely used sequential real-world recommendation datasets. |
Intent Contrastive Learning Based on Multi-view Augmentation for Sequential Recommendation (2025.coling-main)
Copied to clipboard
Bo Pei, Yingzheng Zhu, Guangjin Wang, Huajuan Duan, Wenya Wu, Fuyong Xu, Yizhao Zhu, Peiyu Liu, Ran Lu
| Challenge: | Existing work on intent-related models fails to capture long-term dependencies in user behavior and fails to effectively utilize item relevance. |
| Approach: | They propose a sequential recommendation framework that combine temporal variability with position encoding that has extrapolation properties to encode sequences, thereby expanding the model’s view of user behavior. |
| Outcome: | The proposed model improves on three real datasets by 0.8% to 14.7% compared to baselines. |
AGRec: Adapting Autoregressive Decoders with Graph Reasoning for LLM-based Sequential Recommendation (2025.findings-acl)
Copied to clipboard
| Challenge: | Autoregressive decoders in large language models excel at capturing sequential behaviors for generative recommendations, but they lack graph-structured user-item interactions, which are widely recognized as beneficial. |
| Approach: | They propose a novel algorithm that adapts LLMs’ decoders with graph reasoning for recommendation by augmenting the decoding logits with an auxiliary GNN model to optimize token generation. |
| Outcome: | The proposed model outperforms state-of-the-art models in sequential recommendations. |
Self-regulation: Employing a Generative Adversarial Network to Improve Event Detection (P18-1)
Copied to clipboard
| Challenge: | Recent studies show that neural networks can be used for event detection but can be contaminated by spurious features. |
| Approach: | They propose a self-regulated learning approach by utilizing a generative adversarial network to generate spurious features. |
| Outcome: | The proposed method is highly effective and adaptable on the ACE 2005 and TAC-KBP 2015 corpora. |
Intention Knowledge Graph Construction for User Intention Relation Modeling (2026.eacl-long)
Copied to clipboard
Jiaxin Bai, Zhaobo Wang, Junfei Cheng, Dan Yu, Zerui Huang, Weiqi Wang, Xin Liu, Chen Luo, Yanming Zhu, Bo Li, Yangqiu Song
| Challenge: | Existing knowledge graphs focus on connecting intentions but lacks the ability to model the relationships between different intentions. |
| Approach: | They propose a framework to automatically generate an intention knowledge graph, capturing connections between user intentions. |
| Outcome: | The proposed model outperforms state-of-the-art methods and shows its utility. |
CESRec: Constructing Pseudo Interactions for Sequential Recommendation via Conversational Feedback (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing Sequential Recommendation Systems (SRS) rely on collaborative filtering signals and fail to capture real-time user preferences. |
| Approach: | They propose a framework that integrates the long-term preference modeling of SRS with the real-time preference elicitation of CRS. |
| Outcome: | The proposed framework integrates the long-term preference modeling of SRS with the real-time preference elicitation of CRS. |
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. |
LOHRec: Leveraging Order and Hierarchy in Generative Sequential Recommendation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | generative recommenders focus on maximizing the prediction probability of the next item in the temporal sequence, ignoring diverse potential items. |
| Approach: | They propose a learning framework that leverages order and hierarchy in generative recommendation using quantized identifiers to further explore performance ceiling of lightweight generative recommenders. |
| Outcome: | The proposed learning framework outperforms strong prior baselines across multiple datasets. |
DebiasGAN: Eliminating Position Bias in News Recommendation with Adversarial Learning (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing news recommendation methods use click behaviors for interest inference and model training, but position biases can be inaccurate in targeting user interest. |
| Approach: | They propose a news recommendation method that eliminates position biases by adversarial learning by a candidate-aware click model and a bias-invariant click model. |
| Outcome: | The proposed method can effectively alleviate position biases on click behaviors and capture unbiased user interest. |
Deep Adversarial Learning for NLP (N19-5)
Copied to clipboard
| Challenge: | Adversarial learning is a game-theoretic learning paradigm that has achieved huge successes in the field of Computer Vision recently. |
| Approach: | This tutorial introduces the foundations of deep adversarial learning and some practical problems and solutions in NLP. |
| Outcome: | This tutorial introduces the foundations of deep adversarial learning and some practical problems and solutions in NLP. |