Pith. sign in

REVIEW 1 cited by

Membership Inference Attacks by Exploiting Loss Trajectory

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 2208.14933 v1 pith:OGSYPORT submitted 2022-08-31 cs.CR cs.LG

classification cs.CRcs.LG
keywords attackmodelmembershiptargetdifferentinformationlosslosses
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Machine learning models are vulnerable to membership inference attacks in which an adversary aims to predict whether or not a particular sample was contained in the target model's training dataset. Existing attack methods have commonly exploited the output information (mostly, losses) solely from the given target model. As a result, in practical scenarios where both the member and non-member samples yield similarly small losses, these methods are naturally unable to differentiate between them. To address this limitation, in this paper, we propose a new attack method, called \system, which can exploit the membership information from the whole training process of the target model for improving the attack performance. To mount the attack in the common black-box setting, we leverage knowledge distillation, and represent the membership information by the losses evaluated on a sequence of intermediate models at different distillation epochs, namely \emph{distilled loss trajectory}, together with the loss from the given target model. Experimental results over different datasets and model architectures demonstrate the great advantage of our attack in terms of different metrics. For example, on CINIC-10, our attack achieves at least 6$\times$ higher true-positive rate at a low false-positive rate of 0.1\% than existing methods. Further analysis demonstrates the general effectiveness of our attack in more strict scenarios.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Membership Inference Attacks on In-Context Examples in LLM-based Recommender Systems

    cs.IR 2025-08 conditional novelty 5.0 of 10

    Simply asking a large language model 'have you seen this user?' or comparing its recommendations after prompt poisoning can reveal whether a user's interactions are in the hidden prompt of an ICL-based recommender.

Pith tools