Representer Point Selection for Explaining Regularized High-dimensional Models
Che-Ping Tsai, Jiong Zhang, Hsiang-Fu Yu, Eli Chien, Cho-Jui Hsieh, Pradeep Kumar Ravikumar
Abstract
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 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0c5d5592-fd49-41e2-be43-03c9333734a1Cited by top-tier papers1
Ask how each one uses itBuilds on9
- Estimating Training Data Influence by Tracing Gradient DescentGarima Pruthi, Frederick Liu, Satyen Kale, Mukund SundararajanNeurIPS 2020 · 784 citations
- What Neural Networks Memorize and Why: Discovering the Long Tail via Influence EstimationVitaly Feldman, Chiyuan ZhangNeurIPS 2020 · 674 citations
- Scaling Up Influence FunctionsAndrea Schioppa, Polina Zablotskaia, David Vilar, Artem SokolovAAAI 2022 · 149 citations
- Simplify and Robustify Negative Sampling for Implicit Collaborative FilteringJingtao Ding, Yuhan Quan, Quanming Yao, Yong Li et al.NeurIPS 2020 · 131 citations
- Explaining Black Box Predictions and Unveiling Data Artifacts through Influence FunctionsXiaochuang Han, Byron C. Wallace, Yulia TsvetkovACL 2020 · 91 citations
Related papers
- Sample based Explanations via Generalized RepresentersChe-Ping Tsai, Chih-Kuan Yeh, Pradeep RavikumarNeurIPS 2023 · 13 citations
- Unsupervised Extractive Summarization-Based Representations for Accurate and Explainable Collaborative FilteringReinald Adrian Pugoy, Hung-Yu KaoACL 2021
- Representer Point Selection via Local Jacobian Expansion for Post-hoc Classifier Explanation of Deep Neural Networks and Ensemble ModelsYi Sui, Ga Wu, Scott SannerNeurIPS 2021 · 26 citations
- Accurate and Explainable Recommendation via Review RationalizationSicheng Pan, Dongsheng Li, Hansu Gu, Tun Lu et al.WWW 2022 · 22 citations
- ImplicitSLIM and How it Improves Embedding-based Collaborative FilteringIlya Shenbin, Sergey I. NikolenkoICLR 2024
