English

Fast-MIA: Efficient and Scalable Membership Inference for LLMs

Cryptography and Security 2026-05-12 v2 Computation and Language

Abstract

We propose Fast-MIA (https://github.com/Nikkei/fast-mia), a Python library for efficiently evaluating membership inference attacks (MIA) against large language models (LLMs). MIA has emerged as a crucial technique for auditing privacy risks and copyright infringement in LLMs. However, computational demands have grown substantially: recent methods rely on repeated inference, while practical auditing requires large-scale evaluation. Progress is further hindered by existing implementations that execute methods independently, redundantly computing shared intermediate results such as log-probabilities. To address these challenges, Fast-MIA combines two strategies: (1) high-throughput batch inference via vLLM, achieving approximately 5×\times speedup, and (2) a cross-method caching architecture that computes intermediate results once and shares them across methods. The library includes representative MIA methods under a unified framework, integrates with established benchmarks, and supports flexible YAML configuration. We release Fast-MIA under the Apache License 2.0 to support scalable and reproducible MIA research.

Keywords

Cite

@article{arxiv.2510.23074,
  title  = {Fast-MIA: Efficient and Scalable Membership Inference for LLMs},
  author = {Hiromu Takahashi and Shotaro Ishihara},
  journal= {arXiv preprint arXiv:2510.23074},
  year   = {2026}
}

Comments

ACL 2026 System Demonstrations

R2 v1 2026-07-01T07:07:15.649Z