Pith. sign in

REVIEW 2 cited by

Stochastic Amortization: A Unified Approach to Accelerate Feature and Data Attribution

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 2401.15866 v2 pith:GUPFQHHI submitted 2024-01-29 cs.LG

classification cs.LG
keywords dataattributionfeaturemodelsapproachdatasetslabelslearning
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many tasks in explainable machine learning, such as data valuation and feature attribution, perform expensive computation for each data point and are intractable for large datasets. These methods require efficient approximations, and although amortizing the process by learning a network to directly predict the desired output is a promising solution, training such models with exact labels is often infeasible. We therefore explore training amortized models with noisy labels, and we find that this is inexpensive and surprisingly effective. Through theoretical analysis of the label noise and experiments with various models and datasets, we show that this approach tolerates high noise levels and significantly accelerates several feature attribution and data valuation methods, often yielding an order of magnitude speedup over existing approaches.

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. On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspective

    cs.IR 2024-11 conditional novelty 6.0 of 10

    Shaver prunes CTR model embedding tables to arbitrary sparsity in a single shot using Shapley-value attribution and a field-aware codebook, with accuracy close to retrained baselines.

  2. Capturing the Temporal Dependence of Training Data Influence

    cs.LG 2024-12 conditional novelty 5.0 of 10

    A new influence-estimation method approximates order-aware data influence with a dot product and reveals that early and late training data matter most.

Pith tools