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 View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 1 repository linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 4 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 11 samples from 1 repository, 9 ran (9 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

sleepymalc/miss officialmentioned in papermentioned on GitHubpytorchSyntology: 11 samples, 9 ran (0 instrument-failed) · 2 unverified 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 (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 4 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

4ran · honoured contract
1ran · violated contract
4ran
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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

sleepymalc/miss official repository 11 samples, 9 ran (0 instrument-failed) · 2 unverified
adaptive_first_order logistic_regression/IF.py ran no licence file found · pointer only · 389da74decf16d54 · report fixture: signature X_train:ndarray/2/float, Y_train:ndarray/1/int, x_test:ndarray/1/float, y_test:int64/0/int, k:int/0/int · returned ndarray · level recorded 2026-09-24
count_parameters in 278 papers MLP/utlis/grad_calculator.py ran · honoured contract no licence file found · pointer only · df23da82fbd7ff7b · report fixture: signature model:callable/0/? · returned int · level recorded 2026-09-24
data_generation MLP/utlis/data.py ran no licence file found · pointer only · 7da23eb5e99526c4 · report fixture: signature train_indices:list/1/int, test_indices:list/1/int, mode:str/0/str · returned tuple · level recorded 2026-09-24
first_order logistic_regression/IF.py ran no licence file found · pointer only · 1e7c95c2a848bc1f · report fixture: signature X_train:ndarray/2/float, Y_train:ndarray/1/int, x_test:ndarray/1/float, y_test:int/0/int · returned ndarray · level recorded 2026-09-24
grad_calculator MLP/utlis/grad_calculator.py ran no licence file found · pointer only · 16e9d14348d7b5ce · report fixture: signature data_loader:list/1/Tensor, model:callable/0/?, parameters:list/1/Tensor, func:callable/0/?, normalize_factor:float/0/float, device:str/0/str, projector:SimpleProjector/0/?, checkpoint_id:int/0/int · returned Tensor · level recorded 2026-09-24
parameters_to_vector in 7 papers MLP/utlis/grad_calculator.py ran · honoured contract no licence file found · pointer only · 1def74edcd0ae636 · report fixture: signature parameters:list/1/Tensor · returned Tensor · level recorded 2026-09-24
parse_range in 22 papers MLP/MISS.py ran · honoured contract no licence file found · pointer only · 01825b27c662afc5 · report fixture: signature value:str/0/str · returned tuple · level recorded 2026-09-24
rankmin metric.py ran · violated contract fingerprinted no licence file found · pointer only · 83e51d0a4268dc41 · report fixture: signature x:ndarray/1/int · returned ndarray · level recorded 2026-09-24
winning_rate metric.py ran · honoured contract fingerprinted no licence file found · pointer only · d81973c9f942192a · report fixture: signature ranks:ndarray/2/float · returned ndarray · level recorded 2026-09-24
LAGS linear_regression/LAGS.py unverified no licence file found · pointer only · f4ba7de56847ffa5 · report
adaptive_LAGS linear_regression/LAGS.py 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