Pith. sign in

REVIEW 2 cited by

Deeper Understanding of Black-box Predictions via Generalized Influence Functions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.05586 v2 pith:SDU5DIWC submitted 2023-12-09 cs.LG cs.AI

classification cs.LGcs.AI
keywords parametersdatainfluencechangesfunctionsgeneralizedhowevermodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Influence functions (IFs) elucidate how training data changes model behavior. However, the increasing size and non-convexity in large-scale models make IFs inaccurate. We suspect that the fragility comes from the first-order approximation which may cause nuisance changes in parameters irrelevant to the examined data. However, simply computing influence from the chosen parameters can be misleading, as it fails to nullify the hidden effects of unselected parameters on the analyzed data. Thus, our approach introduces generalized IFs, precisely estimating target parameters' influence while nullifying nuisance gradient changes on fixed parameters. We identify target update parameters closely associated with the input data by the output- and gradient-based parameter selection methods. We verify the generalized IFs with various alternatives of IFs on the class removal and label change tasks. The experiments align with the "less is more" philosophy, demonstrating that updating only 5\% of the model produces more accurate results than other influence functions across all tasks. We believe our proposal works as a foundational tool for optimizing models, conducting data analysis, and enhancing AI interpretability beyond the limitation of IFs. Codes are available at https://github.com/hslyu/GIF.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. What Is The Performance Ceiling of My Classifier? Utilizing Category-Wise Influence Functions for Pareto Frontier Analysis

    cs.LG 2025-10 conditional novelty 4.0 of 10

    Category-wise influence vectors plus linear programming and a genetic algorithm reweight training data to improve all classes at once, with an unproven criterion for when a classifier has reached its Pareto ceiling.

  2. DeGLIF for Label Noise Robust Node Classification using GNNs

    cs.LG 2025-05 conditional novelty 4.0 of 10

    DeGLIF identifies noisy graph nodes by approximating how much each node's removal would improve loss on a small clean set, relabels them with the model's most confident alternative class, and retrains, improving accur...

Pith tools