mlsanityData to 7 Oct 2026

Representer Point Selection for Explaining Regularized High-dimensional Models

arXiv 2305.20002 ↗First posted 31 May 2023cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We introduce a novel class of sample-based explanations we term high-dimensional representers, that can be used to explain the predictions of a regularized high-dimensional model in terms of importance weights for each of the training samples. Our workhorse is a novel representer theorem for general regularized high-dimensional models, which decomposes the model prediction in terms of contributions from each of the training samples: with positive (negative) values corresponding to positive (negative) impact training samples to the model's prediction. We derive consequences for the canonical instances of ℓ1 regularized sparse models, and nuclear norm regularized low-rank models. As a case study, we further investigate the application of low-rank models in the context of collaborative filtering, where we instantiate high-dimensional representers for specific popular classes of models. Finally, we study the empirical performance of our proposed methods on three real-world binary classification datasets and two recommender system datasets. We also showcase the utility of high-dimensional representers in explaining model recommendations.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 64 references that are in the map. First posted on arXiv 31 May 2023.

Builds on

29 of 64 references.

References · 29

  1. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  3. 2017Neural Collaborative Filteringcited by 1,108
  4. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  5. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  6. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
  7. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
  8. 2018Explainable Recommendation: A Survey and New Perspectivescited by 210
  9. 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
  10. 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 162
  11. 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
  12. 2020Explaining Black Box Predictions and Unveiling Data Artifacts through Influence Functionscited by 144
17 more
  1. 2022If Influence Functions are the Answer, Then What is the Question?cited by 142
  2. 2021Scaling Up Influence Functionscited by 130
  3. 2020FastIF: Scalable Influence Functions for Efficient Model Interpretation and Debuggingcited by 120
  4. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
  5. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  6. 2020Influence Function based Data Poisoning Attacks to Top-N Recommender Systemscited by 61
  7. 2018Interpreting Black Box Predictions using Fisher Kernelscited by 48
  8. 2018A representer theorem for deep neural networkscited by 38
  9. 2021HYDRA: Hypergradient Data Relevance Analysis for Interpreting Deep Neural Networkscited by 38
  10. 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
  11. 2022Identifying a Training-Set Attack's Target Using Renormalized Influence Estimationcited by 32
  12. 2017A representer theorem for deep kernel learningcited by 26
  13. 2014Nuclear Norm based Matrix Regression with Applications to Face Recognition with Occlusion and Illumination Changescited by 19
  14. 2016"Influence Sketching": Finding Influential Samples In Large-Scale Regressionscited by 17
  15. 2022Adapting and Evaluating Influence-Estimation Methods for Gradient-Boosted Decision Treescited by 16
  16. 2018Explaining Latent Factor Models for Recommendation with Influence Functionscited by 14
  17. 2022TracInAD: Measuring Influence for Anomaly Detectioncited by 8

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.