Adversarial Collaborative Filtering for Free

Abstract

Collaborative Filtering (CF) has been successfully used to help users discover the items of interest. Nevertheless, existing CF methods suffer from noisy data issue, which negatively impacts the quality of recommendation. To tackle this problem, many prior studies leverage adversarial learning to regularize the representations of users/items, which improves both generalizability and robustness. Those methods often learn adversarial perturbations and model parameters under min-max optimization framework. However, there still have two major drawbacks: 1) Existing methods lack theoretical guarantees of why adding perturbations improve the model generalizability and robustness; 2) Solving min-max optimization is time-consuming. In addition to updating the model parameters, each iteration requires additional computations to update the perturbations, making them not scalable for industry-scale datasets. In this paper, we present Sharpness-aware Collaborative Filtering (SharpCF), a simple yet effective method that conducts adversarial training without extra computational cost over the base optimizer. To achieve this goal, we first revisit the existing adversarial collaborative filtering and discuss its connection with recent Sharpness-aware Minimization. This analysis shows that adversarial training actually seeks model parameters that lie in neighborhoods around the optimal model parameters having uniformly low loss values, resulting in better generalizability. To reduce the computational overhead, SharpCF introduces a novel trajectory loss to measure the alignment between current weights and past weights. Experimental results on real-world datasets demonstrate that our SharpCF achieves superior performance with almost zero additional computational cost comparing to adversarial training.

References in corpus (9)

• Graph Convolutional Neural Networks for Web-Scale Recommender Systems
• xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems
• IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
• Adversarial Personalized Ranking for Recommendation
• Denoising Implicit Feedback for Recommendation
• Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issue
• Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakage
• Denoising Self-attentive Sequential Recommendation
• Sharpness-Aware Training for Free

Cited by in corpus (3)

• From Clicks to Carbon: The Environmental Toll of Recommender Systems
• Improving the Shortest Plank: Vulnerability-Aware Adversarial Training for Robust Recommender System
• The Fallacy of Borda Count Method -- Why it is Useless with Group Intelligence and Shouldn't be Used with Big Data including Banking Customer Services