mlsanityData to 14 Oct 2026

Safe Collaborative Filtering

arXiv 2306.05292 ↗First posted 8 Jun 2023cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Excellent tail performance is crucial for modern machine learning tasks, such as algorithmic fairness, class imbalance, and risk-sensitive decision making, as it ensures the effective handling of challenging samples within a dataset. Tail performance is also a vital determinant of success for personalized recommender systems to reduce the risk of losing users with low satisfaction. This study introduces a "safe" collaborative filtering method that prioritizes recommendation quality for less-satisfied users rather than focusing on the average performance. Our approach minimizes the conditional value at risk (CVaR), which represents the average risk over the tails of users' loss. To overcome computational challenges for web-scale recommender systems, we develop a robust yet practical algorithm that extends the most scalable method, implicit alternating least squares (iALS). Empirical evaluation on real-world datasets demonstrates the excellent tail performance of our approach while maintaining competitive computational efficiency.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 81 references that are in the map. First posted on arXiv 8 Jun 2023.

Builds on

28 of 81 references.

References · 28

  1. 2021Convex optimizationcited by 2,515
  2. 2018Variational Autoencoders for Collaborative Filteringcited by 310
  3. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
  4. 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 101
  5. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 94
  6. 2020FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platformscited by 78
  7. 2015MLlib: Machine Learning in Apache Sparkcited by 55
  8. 2020An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectivescited by 42
  9. 2019Adaptive Sampling for Stochastic Risk-Averse Learningcited by 39
  10. 2021Non-convex Distributionally Robust Optimization: Non-asymptotic Analysiscited by 39
  11. 2015An optimal randomized incremental gradient methodcited by 33
  12. 2021Two-sided fairness in rankings via Lorenz dominancecited by 28
16 more
  1. 2020Smoothed Quantile Regression with Large-Scale Inferencecited by 23
  2. 2016Sub-sampled Newton Methods with Non-uniform Samplingcited by 21
  3. 2021Revisiting the Performance of iALS on Item Recommendation Benchmarkscited by 21
  4. 2020Statistical Learning with Conditional Value at Riskcited by 19
  5. 2016A Generic Coordinate Descent Framework for Learning from Implicit Feedbackcited by 16
  6. 2019Smoothing quantile regressionscited by 16
  7. 2021High-Dimensional Quantile Regression: Convolution Smoothing and Concave Regularizationcited by 15
  8. 2020PAC-Bayesian Bound for the Conditional Value at Riskcited by 13
  9. 2015Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisonscited by 11
  10. 2018Efficient Training on Very Large Corpora via Gramian Estimationcited by 9
  11. 2017Exploiting Strong Convexity from Data with Primal-Dual First-Order Algorithmscited by 8
  12. 2019Markov Random Fields for Collaborative Filteringcited by 8
  13. 2023Curse of "Low" Dimensionality in Recommender Systemscited by 7
  14. 2016Faster and Cheaper: Parallelizing Large-Scale Matrix Factorization on GPUscited by 4
  15. 2021iALS++: Speeding up Matrix Factorization with Subspace Optimizationcited by 3
  16. 2022A Unified Algorithm for Penalized Convolution Smoothed Quantile Regressioncited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.