Research map / Learning theory and algorithms / Prediction and decision losses
Shapley-Based Data Valuation for Weighted $k$-Nearest Neighbors
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Extends fast exact Shapley-value data valuation from unweighted kNN classifiers to weighted kNN classifiers.
Problem
Computing exact Shapley values for data valuation is computationally expensive; fast exact computation exists for unweighted kNN classifiers but not for weighted kNN.
Approach
Extends the fast exact Shapley computation for unweighted kNN to the weighted kNN setting, as the abstract indicates the goal of extending the unweighted breakthrough to weighted kNN; specific technique not stated in the abstract.
Experimental setup
Builds on: Shapley value data valuation for unweighted kNN
Closest papers by meaning
- DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation (NeurIPS 2024 · similarity 0.90)
- A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values (NeurIPS 2025 · similarity 0.88)
- Rethinking Data Shapley for Data Selection Tasks: Misleads and Merits (ICML 2024 · similarity 0.87)
- Shapley-Guided Utility Learning for Effective Graph Inference Data Valuation (ICLR 2025 · similarity 0.86)
- shapiq: Shapley Interactions for Machine Learning (NeurIPS 2024 · similarity 0.85)
- Amortized Linear-time Exact Shapley Value for Product-Kernel Methods (NeurIPS 2026 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.