Fast-MIA: Efficient and Scalable Membership Inference for LLMs
Hiromu Takahashi, Shotaro Ishihara
TL;DR
Fast-MIA addresses the dual challenges of high computational cost and nonstandardized implementations in membership inference attacks on LLMs by providing a batched, cache-enabled evaluation framework built on vLLM. It unifies multiple MIA methods within a YAML-driven configuration, enabling scalable, reproducible benchmarking across models and datasets. The library demonstrates near-identical MIA performance to Transformer-based baselines while delivering about a 5x speedup, validating its utility for privacy research and rigorous comparative studies. By supporting non-English prompts and extensible plug-in architecture, Fast-MIA offers a practical, open-source foundation for advancing memorization and privacy evaluations in modern LLM deployments.
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 against LLMs has emerged as a crucial challenge due to growing concerns over copyright, security, and data privacy, and has attracted increasing research attention. However, the progress of this research is significantly hindered by two main obstacles: (1) the high computational cost of inference in LLMs, and (2) the lack of standardized and maintained implementations of MIA methods, which makes large-scale empirical comparison difficult. To address these challenges, our library provides fast batch inference and includes implementations of representative MIA methods under a unified evaluation framework. This library supports easy implementation of reproducible benchmarks with simple configuration and extensibility. We release Fast-MIA as an open-source (Apache License 2.0) tool to support scalable and transparent research on LLMs.
