Papers › How Many and Which Training Points Would Need to be Removed to Flip this Prediction?

How Many and Which Training Points Would Need to be Removed to Flip this Prediction?

4 Feb 2023arXiv:2302.02169archive 2025-07-28

Jinghan Yang, Sarthak Jain, Byron C. Wallace

We consider the problem of identifying a minimal subset of training data 𝒮ₜ such that if the instances comprising 𝒮ₜ had been removed prior to training, the categorization of a given test point xₜ would have been different. Identifying such a set may be of interest for a few reasons. First, the cardinality of 𝒮ₜ provides a measure of robustness (if |𝒮ₜ| is small for xₜ, we might be less confident in the corresponding prediction), which we show is correlated with but complementary to predicted probabilities. Second, interrogation of 𝒮ₜ may provide a novel mechanism for contesting a particular model prediction: If one can make the case that the points in 𝒮ₜ are wrongly labeled or irrelevant, this may argue for overturning the associated prediction. Identifying 𝒮ₜ via brute-force is intractable. We propose comparatively fast approximation methods to find 𝒮ₜ based on influence functions, and find that -- for simple convex text classification models -- these approaches can often successfully identify relatively small sets of training examples which, if removed, would flip the prediction.

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 6 code samples harvested from 1 repository linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 6 samples from 1 repository, 4 ran (1 with no instrument failure; 3 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-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

ecielyang/smallest_set officialmentioned in paperSyntology: 6 samples, 4 ran (3 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

6 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 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 has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
1ran; the contract check could not run
2unverified

Licence: 6 of the 6 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 ecielyang/smallest_set. “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.

ecielyang/smallest_set official repository 6 samples, 4 ran (3 instrument-failed) · 2 unverified
Remove Smallest_k.py ran; the contract check could not run (RAISES) · metamorphic tier: deterministic no licence file found · pointer only · 394ed4867d5740ce · report fixture: signature k:int/0/int, scores:ndarray/2/float, test_idx:int/0/int, pred:ndarray/1/float, X:dict/0/?, y:dict/0/?, thresh:float/0/float · returned tuple · level recorded 2026-09-22
concatenate in 8 papers recursive.py ran · honoured contract fingerprinted no licence file found · pointer only · f0458fd6f37c6080 · report fixture: signature X:ndarray/2/float · returned ndarray · level recorded 2026-09-22
error in 16 papers recursive.py ran · our draft was wrong no licence file found · pointer only · 51f77e4457107d04 · report fixture: signature X:ndarray/2/float, y:ndarray/1/float, model:SimpleModel/0/? · returned ndarray · level recorded 2026-09-22
prediction in 11 papers recursive.py ran · our draft was wrong no licence file found · pointer only · 6154bee9b6ca26bd · report fixture: signature X:ndarray/2/float, model:RandomForestClassifier/0/? · returned ndarray · level recorded 2026-09-22
approximate_k Smallest_k.py unverified no licence file found · pointer only · 22cc94a64b762c8a · report
new_train Smallest_k.py unverified no licence file found · pointer only · 412344879324027f · report

Tasks

PredictionText Classificationtext-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

FLIPTest

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