Search Results for author:
Found 70 papers, 47 papers with code
Learning to Imagine: Integrating Counterfactual Thinking in Neural Discrete Reasoning
Neural discrete reasoning (NDR) has shown remarkable progress in combining deep models with discrete reasoning.
RecAD: Towards A Unified Library for Recommender Attack and Defense
Despite significant research progress in recommender attack and defense, there is a lack of a widely-recognized benchmarking standard in the field, leading to unfair performance comparison and limited credibility of experiments.
Label Denoising through Cross-Model Agreement
We employ the proposed DeCA on both the binary label scenario and the multiple label scenario.
A Bi-Step Grounding Paradigm for Large Language Models in Recommendation Systems
As the focus on Large Language Models (LLMs) in the field of recommendation intensifies, the optimization of LLMs for recommendation purposes (referred to as LLM4Rec) assumes a crucial role in augmenting their effectiveness in providing recommendations.
ADRNet: A Generalized Collaborative Filtering Framework Combining Clinical and Non-Clinical Data for Adverse Drug Reaction Prediction
Adverse drug reaction (ADR) prediction plays a crucial role in both health care and drug discovery for reducing patient mortality and enhancing drug safety.
Information Retrieval Meets Large Language Models: A Strategic Report from Chinese IR Community
The research field of Information Retrieval (IR) has evolved significantly, expanding beyond traditional search to meet diverse user information needs.
Recommendation Unlearning via Influence Function
In this work, we propose an Influence Function-based Recommendation Unlearning (IFRU) framework, which efficiently updates the model without retraining by estimating the influence of the unusable data on the model via the influence function.
Leveraging Watch-time Feedback for Short-Video Recommendations: A Causal Labeling Framework
With the proliferation of short video applications, the significance of short video recommendations has vastly increased.
Robust Instruction Optimization for Large Language Models with Distribution Shifts
Large Language Models have demonstrated significant ability in accomplishing a wide range of Natural Language Processing (NLP) tasks.
Is ChatGPT Fair for Recommendation? Evaluating Fairness in Large Language Model Recommendation
The remarkable achievements of Large Language Models (LLMs) have led to the emergence of a novel recommendation paradigm -- Recommendation via LLM (RecLLM).
Doc2SoarGraph: Discrete Reasoning over Visually-Rich Table-Text Documents with Semantic-Oriented Hierarchical Graphs
Discrete reasoning over table-text documents (e. g., financial reports) gains increasing attention in recent two years.
TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendation
We have demonstrated that the proposed TALLRec framework can significantly enhance the recommendation capabilities of LLMs in the movie and book domains, even with a limited dataset of fewer than 100 samples.
Prediction then Correction: An Abductive Prediction Correction Method for Sequential Recommendation
To improve the accuracy of these models, some researchers have attempted to simulate human analogical reasoning to correct predictions for testing data by drawing analogies with the prediction errors of similar training data.
Reformulating CTR Prediction: Learning Invariant Feature Interactions for Recommendation
However, such a manner inevitably learns unstable feature interactions, i. e., the ones that exhibit strong correlations in historical data but generalize poorly for future serving.
Diffusion Recommender Model
In light of the impressive advantages of Diffusion Models (DMs) over traditional generative models in image synthesis, we propose a novel Diffusion Recommender Model (named DiffRec) to learn the generative process in a denoising manner.
Generative Recommendation: Towards Next-generation Recommender Paradigm
However, such a retrieval-based recommender paradigm faces two limitations: 1) the human-generated items in the corpus might fail to satisfy the users' diverse information needs, and 2) users usually adjust the recommendations via passive and inefficient feedback such as clicks.
Causal Disentangled Recommendation Against User Preference Shifts
Inspired by the causal graph, our key considerations to handle preference shifts lie in modeling the interaction generation procedure by: 1) capturing the preference shifts across environments for accurate preference prediction, and 2) disentangling the sparse influence from user preference to interactions for accurate effect estimation of preference.
On the Theories Behind Hard Negative Sampling for Recommendation
Secondly, we prove that OPAUC has a stronger connection with Top-K evaluation metrics than AUC and verify it with simulation experiments.
Mitigating Spurious Correlations for Self-supervised Recommendation
To address the problems, we aim to automatically mitigate the effect of spurious correlations.
Unbiased Knowledge Distillation for Recommendation
Traditional solutions first train a full teacher model from the training data, and then transfer its knowledge (\ie \textit{soft labels}) to supervise the learning of a compact student model.
Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendation
A standard choice is treating the missing data as negative training samples and estimating interaction likelihood between user-item pairs along with the observed interactions.
Causal Intervention for Fairness in Multi-behavior Recommendation
Specifically, we find that: 1) item popularity is a confounder between the exposed items and users' post-click interactions, leading to the first unfairness; and 2) some hidden confounders (e. g., the reputation of item producers) affect both item popularity and quality, resulting in the second unfairness.
Causal Inference in Recommender Systems: A Survey and Future Directions
Afterward, we comprehensively review the existing work of causal inference-based recommendation, based on a taxonomy of what kind of problem causal inference addresses.
Re4: Learning to Re-contrast, Re-attend, Re-construct for Multi-interest Recommendation
Specifically, Re4 encapsulates three backward flows, i. e., 1) Re-contrast, which drives each interest embedding to be distinct from other interests using contrastive learning; 2) Re-attend, which ensures the interest-item correlation estimation in the forward flow to be consistent with the criterion used in final recommendation; and 3) Re-construct, which ensures that each interest embedding can semantically reflect the information of representative items that relate to the corresponding interest.
CCL4Rec: Contrast over Contrastive Learning for Micro-video Recommendation
Micro-video recommender systems suffer from the ubiquitous noises in users' behaviors, which might render the learned user representation indiscriminating, and lead to trivial recommendations (e. g., popular items) or even weird ones that are far beyond users' interests.
Towards Complex Document Understanding By Discrete Reasoning
Document Visual Question Answering (VQA) aims to understand visually-rich documents to answer questions in natural language, which is an emerging research topic for both Natural Language Processing and Computer Vision.
Explainable Sparse Knowledge Graph Completion via High-order Graph Reasoning Network
On the one hand, their performance will dramatically degrade along with the increasing sparsity of KGs.
Structured and Natural Responses Co-generation for Conversational Search
Existing approaches either 1) predict structured dialog acts first and then generate natural response; or 2) map conversation context to natural responses directly in an end-to-end manner.
GL-RG: Global-Local Representation Granularity for Video Captioning
Video captioning is a challenging task as it needs to accurately transform visual understanding into natural language description.
Mitigating Hidden Confounding Effects for Causal Recommendation
Towards this goal, we propose a Hidden Confounder Removal (HCR) framework that leverages front-door adjustment to decompose the causal effect into two partial effects, according to the mediators between item features and user feedback.
Addressing Confounding Feature Issue for Causal Recommendation
We demonstrate DCR on the backbone model of neural factorization machine (NFM), showing that DCR leads to more accurate prediction of user preference with small inference time cost.
Copy Motion From One to Another: Fake Motion Video Generation
3) To enhance texture details, we encode facial features with geometric guidance and employ local GANs to refine the face, feet, and hands.
Reinforced Causal Explainer for Graph Neural Networks
Such reward accounts for the dependency of the newly-added edge and the previously-added edges, thus reflecting whether they collaborate together and form a coalition to pursue better explanations.
Graph Neural Network with Curriculum Learning for Imbalanced Node Classification
Graph Neural Network (GNN) is an emerging technique for graph-based learning tasks such as node classification.
WebFormer: The Web-page Transformer for Structure Information Extraction
Structure information extraction refers to the task of extracting structured text fields from web pages, such as extracting a product offer from a shopping page including product title, description, brand and price.
Deconfounding to Explanation Evaluation in Graph Neural Networks
In this work, we propose Deconfounded Subgraph Evaluation (DSE) which assesses the causal effect of an explanatory subgraph on the model prediction.
Training Free Graph Neural Networks for Graph Matching
We present a framework of Training Free Graph Matching (TFGM) to boost the performance of Graph Neural Networks (GNNs) based graph matching, providing a fast promising solution without training (training-free).
Learning Robust Recommender from Noisy Implicit Feedback
Inspired by this observation, we propose a new training strategy named Adaptive Denoising Training (ADT), which adaptively prunes the noisy interactions by two paradigms (i. e., Truncated Loss and Reweighted Loss).
Decoupling Strategy and Surface Realization for Task-oriented Dialogues
The core is to construct a latent content space for strategy optimization and disentangle the surface style from it.
Causal Incremental Graph Convolution for Recommender System Retraining
Towards the goal, we propose a \textit{Causal Incremental Graph Convolution} approach, which consists of two new operators named \textit{Incremental Graph Convolution} (IGC) and \textit{Colliding Effect Distillation} (CED) to estimate the output of full graph convolution.
Counterfactual Inference for Text Classification Debiasing
In inference, given a factual input document, Corsair imagines its two counterfactual counterparts to distill and mitigate the two biases captured by the poisonous model.
Empowering Language Understanding with Counterfactual Reasoning
Present language understanding methods have demonstrated extraordinary ability of recognizing patterns in texts via machine learning.
Deconfounded Video Moment Retrieval with Causal Intervention
To fill the research gap, we propose a causality-inspired VMR framework that builds structural causal model to capture the true effect of query and video content on the prediction.
Deconfounded Recommendation for Alleviating Bias Amplification
In this work, we scrutinize the cause-effect factors for bias amplification, identifying the main reason lies in the confounder effect of imbalanced item distribution on user representation and prediction score.
Learning Robust Recommenders through Cross-Model Agreement
A noisy negative example which is uninteracted because of unawareness of the user could also denote potential positive user preference.
TAT-QA: A Question Answering Benchmark on a Hybrid of Tabular and Textual Content in Finance
In this work, we extract samples from real financial reports to build a new large-scale QA dataset containing both Tabular And Textual data, named TAT-QA, where numerical reasoning is usually required to infer the answer, such as addition, subtraction, multiplication, division, counting, comparison/sorting, and the compositions.
Ranked #1 on
Question Answering
on TAT-QA
Causal Intervention for Leveraging Popularity Bias in Recommendation
This work studies an unexplored problem in recommendation -- how to leverage popularity bias to improve the recommendation accuracy.
Structure-Enhanced Meta-Learning For Few-Shot Graph Classification
Graph classification is a highly impactful task that plays a crucial role in a myriad of real-world applications such as molecular property prediction and protein function prediction. Aiming to handle the new classes with limited labeled graphs, few-shot graph classification has become a bridge of existing graph classification solutions and practical usage. This work explores the potential of metric-based meta-learning for solving few-shot graph classification. We highlight the importance of considering structural characteristics in the solution and propose a novel framework which explicitly considers global structure and local structure of the input graph.
DyHCN: Dynamic Hypergraph Convolutional Networks
In general, DyHCN consists of a Hypergraph Convolution (HC) to encode the hypergraph structure at a time point and a Temporal Evolution module (TE) to capture the varying of the relations.
Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System
Existing work addresses this issue with Inverse Propensity Weighting (IPW), which decreases the impact of popular items on the training and increases the impact of long-tail items.
On the Equivalence of Decoupled Graph Convolution Network and Label Propagation
The original design of Graph Convolution Network (GCN) couples feature transformation and neighborhood aggregation for node representation learning.
Should Graph Convolution Trust Neighbors? A Simple Causal Inference Method
To this end, we analyze the working mechanism of GCN with causal graph, estimating the causal effect of a node's local structure for the prediction.
Self-supervised Graph Learning for Recommendation
In this work, we explore self-supervised learning on user-item graph, so as to improve the accuracy and robustness of GCNs for recommendation.
Bias and Debias in Recommender System: A Survey and Future Directions
This motivates us to provide a systematic survey of existing work on RS biases.
Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issue
However, we argue that there is a significant gap between clicks and user satisfaction -- it is common that a user is "cheated" to click an item by the attractive title/cover of the item.
CatGCN: Graph Convolutional Networks with Categorical Node Features
In this paper, we propose a new GCN model named CatGCN, which is tailored for graph learning when the node features are categorical.
Data Augmentation View on Graph Convolutional Network and the Proposal of Monte Carlo Graph Learning
In this work, we introduce a new understanding for it -- data augmentation, which is more transparent than the previous understandings.
Denoising Implicit Feedback for Recommendation
In this work, we explore the central theme of denoising implicit feedback for recommender training.
How to Retrain Recommender System? A Sequential Meta-Learning Method
Nevertheless, normal training on new data only may easily cause overfitting and forgetting issues, since the new data is of a smaller scale and contains fewer information on long-term user preference.
Cross-GCN: Enhancing Graph Convolutional Network with $k$-Order Feature Interactions
Graph Convolutional Network (GCN) is an emerging technique that performs learning and reasoning on graph data.
Bilinear Graph Neural Network with Neighbor Interactions
We term this framework as Bilinear Graph Neural Network (BGNN), which improves GNN representation ability with bilinear interactions between neighbor nodes.
Neural Graph Collaborative Filtering
Further analysis verifies the importance of embedding propagation for learning better user and item representations, justifying the rationality and effectiveness of NGCF.
Ranked #6 on
Link Prediction
on MovieLens 25M
Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure
Adversarial Training (AT), a dynamic regularization technique, can resist the worst-case perturbations on input features and is a promising choice to improve model robustness and generalization.
Ranked #3 on
Node Classification
on NELL
Explicit Interaction Model towards Text Classification
To address this problem, we introduce the interaction mechanism to incorporate word-level matching signals into the text classification task.
Ranked #4 on
Text Classification
on Yahoo! Answers
Enhancing Stock Movement Prediction with Adversarial Training
The key novelty is that we propose to employ adversarial training to improve the generalization of a neural network prediction model.
Temporal Relational Ranking for Stock Prediction
Our RSR method advances existing solutions in two major aspects: 1) tailoring the deep learning models for stock ranking, and 2) capturing the stock relations in a time-sensitive manner.
Learning to Recommend with Multiple Cascading Behaviors
To fully exploit the signal in the data of multiple types of behaviors, we perform a joint optimization based on the multi-task learning framework, where the optimization on a behavior is treated as a task.
Discrete Factorization Machines for Fast Feature-based Recommendation
In this paper, we develop a generic feature-based recommendation model, called Discrete Factorization Machine (DFM), for fast and accurate recommendation.
Neural Compatibility Modeling with Attentive Knowledge Distillation
Nevertheless, existing studies overlook the rich valuable knowledge (rules) accumulated in fashion domain, especially the rules regarding clothing matching.
