Papers › Most Influential Subset Selection: Challenges, Promises, and Beyond

Most Influential Subset Selection: Challenges, Promises, and Beyond

25 Sep 2024arXiv:2409.18153archive 2025-07-28

Yuzheng Hu, Pingbang Hu, Han Zhao, Jiaqi W. Ma

How can we attribute the behaviors of machine learning models to their training data? While the classic influence function sheds light on the impact of individual samples, it often fails to capture the more complex and pronounced collective influence of a set of samples. To tackle this challenge, we study the Most Influential Subset Selection (MISS) problem, which aims to identify a subset of training samples with the greatest collective influence. We conduct a comprehensive analysis of the prevailing approaches in MISS, elucidating their strengths and weaknesses. Our findings reveal that influence-based greedy heuristics, a dominant class of algorithms in MISS, can provably fail even in linear regression. We delineate the failure modes, including the errors of influence function and the non-additive structure of the collective influence. Conversely, we demonstrate that an adaptive version of these heuristics which applies them iteratively, can effectively capture the interactions among samples and thus partially address the issues. Experiments on real-world datasets corroborate these theoretical findings and further demonstrate that the merit of adaptivity can extend to more complex scenarios such as classification tasks and non-linear neural networks. We conclude our analysis by emphasizing the inherent trade-off between performance and computational efficiency, questioning the use of additive metrics such as the Linear Datamodeling Score, and offering a range of discussions.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2409.18153")

Code

Syntology Ran 9 of 11 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 9 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

sleepymalc/miss officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 9 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9ran
2unverified

Licence: 11 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from sleepymalc/miss. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

adaptive_first_order sleepymalc/miss/logistic_regression/IF.py official repository ran no licence file found · pointer only · 389da74decf16d54 · report
count_parameters sleepymalc/miss/MLP/utlis/grad_calculator.py official repository ran no licence file found · pointer only · df23da82fbd7ff7b · report
data_generation sleepymalc/miss/MLP/utlis/data.py official repository ran no licence file found · pointer only · 7da23eb5e99526c4 · report
first_order sleepymalc/miss/logistic_regression/IF.py official repository ran no licence file found · pointer only · 1e7c95c2a848bc1f · report
grad_calculator sleepymalc/miss/MLP/utlis/grad_calculator.py official repository ran no licence file found · pointer only · 16e9d14348d7b5ce · report
parameters_to_vector sleepymalc/miss/MLP/utlis/grad_calculator.py official repository ran no licence file found · pointer only · 1def74edcd0ae636 · report
parse_range sleepymalc/miss/MLP/MISS.py official repository ran no licence file found · pointer only · 01825b27c662afc5 · report
rankmin sleepymalc/miss/metric.py official repository ran fingerprinted no licence file found · pointer only · 83e51d0a4268dc41 · report
winning_rate sleepymalc/miss/metric.py official repository ran fingerprinted no licence file found · pointer only · d81973c9f942192a · report
LAGS sleepymalc/miss/linear_regression/LAGS.py official repository unverified no licence file found · pointer only · f4ba7de56847ffa5 · report
adaptive_LAGS sleepymalc/miss/linear_regression/LAGS.py official repository unverified no licence file found · pointer only · fc021c18a536d694 · report

Tasks

AttributeComputational Efficiency

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections