New algorithms efficiently value data for kNN classifiers

By PulseAugur Editorial · [1 sources] · 2026-05-20 11:10

Researchers have developed new algorithms to efficiently calculate the Banzhaf value, a game-theoretic method for data valuation, specifically for k-nearest neighbors (kNN) classifiers. The study proves the computational hardness of the problem but introduces practical exact algorithms using dynamic programming, achieving pseudo-polynomial time complexity for weighted kNN and linear time complexity for unweighted kNN. Experiments on real-world datasets confirm the efficiency and effectiveness of these novel valuation methods. AI

IMPACT Introduces more efficient methods for understanding data contributions, potentially improving model training and interpretability.

RANK_REASON Academic paper detailing a new algorithmic approach to a machine learning problem. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

paper
other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

COVERAGE [1]

arXiv cs.LG TIER_1 English(EN) · Aristides Gionis · 2026-05-20 11:10

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification

Data valuation, the task of quantifying the contribution of individual data points to model performance, has emerged as a fundamental challenge in machine learning. Game-theoretic approaches, such as the Banzhaf value, offer principled frameworks for fair data valuation; however,…

COVERAGE [1]

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification

RELATED ENTITIES

RELATED TOPICS