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

Ian Covert, Chanwoo Kim, Su-In Lee, James Zou, Tatsunori Hashimoto
2/3/2026

No official code found. Best implementation: iancovert/amortized-valuation (7 stars, MIT, last commit 2024-02-06). 1 more below.

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.

View on arXivView PDF

Code Implementations(2)

MIT
70PythonNov 3, 20232 years agoMIT
MIT
20Shell, PythonAug 7, 20231 years agoMIT

Similar Papers

Cite this paper

@article{covert2026stochastic,
  title  = {Stochastic Amortization: A Unified Approach to Accelerate Feature and Data Attribution},
  author = {Ian Covert and Chanwoo Kim and Su-In Lee and James Zou and Tatsunori Hashimoto},
  year   = {2026},
  eprint = {2401.15866},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2401.15866},
  url    = {https://arxiv.org/abs/2401.15866},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.15866.svg)](https://codeofpaper.com/paper/2401.15866)

Discussion