mlsanityData to 7 Oct 2026

When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendation

arXiv 2409.12730 ↗First posted 19 Sep 2024cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Learning user preferences from implicit feedback is one of the core challenges in recommendation. The difficulty lies in the potential noise within implicit feedback. Therefore, various denoising recommendation methods have been proposed recently. However, most of them overly rely on the hyperparameter configurations, inevitably leading to inadequacies in model adaptability and generalization performance. In this study, we propose a novel Adaptive Ensemble Learning (AEL) for denoising recommendation, which employs a sparse gating network as a brain, selecting suitable experts to synthesize appropriate denoising capacities for different data samples. To address the ensemble learning shortcoming of model complexity and ensure sub-recommender diversity, we also proposed a novel method that stacks components to create sub-recommenders instead of directly constructing them. Extensive experiments across various datasets demonstrate that AEL outperforms others in kinds of popular metrics, even in the presence of substantial and dynamic noise. Our code is available at https://github.com/cpu9xx/AEL.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 31 references that are in the map. First posted on arXiv 19 Sep 2024.

Builds on

21 of 31 references.

References · 21

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  3. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  4. 2017Neural Collaborative Filteringcited by 1,108
  5. 2020Denoising Implicit Feedback for Recommendationcited by 80
  6. 2015Modeling User Exposure in Recommendationcited by 69
  7. 2022LightFR: Lightweight Federated Recommendation with Privacy-preserving Matrix Factorizationcited by 26
  8. 2022Self-Guided Learning to Denoise for Robust Recommendationcited by 24
  9. 2023AutoDenoise: Automatic Data Instance Denoising for Recommendationscited by 23
  10. 2022Efficient Bi-Level Optimization for Recommendation Denoisingcited by 20
  11. 2024Double Correction Framework for Denoising Recommendationcited by 19
  12. 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
9 more
  1. 2018Sampler Design for Bayesian Personalized Ranking by Leveraging View Datacited by 11
  2. 2023Unbiased Delayed Feedback Label Correction for Conversion Rate Predictioncited by 10
  3. 2024Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filteringcited by 10
  4. 2023Knowledge-refined Denoising Network for Robust Recommendationcited by 9
  5. 2024Intersectional Two-sided Fairness in Recommendationcited by 8
  6. 2023Robust Recommender System: A Survey and Future Directionscited by 7
  7. 2024Collaborative-Enhanced Prediction of Spending on Newly Downloaded Mobile Games under Consumption Uncertaintycited by 7
  8. 2022Evolutionary bagging for ensemble learningcited by 6
  9. 2023Automated Data Denoising for Recommendationcited by 6

Built on by

Not cited yet.