Timing is Everything: Inferring Temporal Membership in Continually Updated Models

arXiv:2611.05781 · cs.CR, cs.LG · Submitted 2026-11-04 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.

Nadia: We're looking at the paper: "Timing is Everything".

Elias: Here's the gist of the paper. Continual model updating introduces new privacy risks that require systematic study and formalization of temporal membership to address The paper presents TMIA, a novel black-box attack leveraging bidirectional LSTMs to infer whether and when individual samples were involved in model training at both timestamp-level and interval-level granularities Problem Formalization The paper formalizes the notion of temporal membership in continually updated models, defining temporal membership inference at two levels: timestamp-level and interval-level At the timestamp level, the adversary seeks to determine whether a target sample belongs to the training set at a specific point in time At the interval level, the adversary aims to infer the time interval(s) during which the sample participates in training, identifying its entry and exit points Temporal membership is defined based on whether a sample is in the initial dataset or if its most recent update involving it was an insertion The temporal membership interval is defined as the time periods during which a sample is a member of corresponding model snapshots, where tstart is the entry point and tend is the exit point Attack Methodology TMIA infers temporal membership intervals by analyzing model updates across multiple timestamps through three main components: training update-aligned shadow models, labeling timestamps, and constructing membership intervals The adversary constructs a sequence of shadow models that emulate the target model’s evolution over time to capture temporal changes in the model’s outputs The labeling phase involves training a BiLSTM with a sliding window to map each timestamp in the output sequence to a label: N for non-change point, E for entry point, and X for exit point Valid membership intervals are constructed through a three-step procedure involving extracting entry and exit points, selecting representative timestamps with the highest confidence score in groups of consecutive same-label timestamps, and pairing these representatives to form intervals Empirical Evaluation Extensive experiments on three language models and three image classification models show that TMIA is highly effective and significantly outperforms existing baselines For timestamp-level inference, TMIA achieves strong T-Pre, T-Rec, and T-F1 results across all settings for the language models For interval-level inference, TMIA also achieves consistently strong I-Pre and I-Rec results on all models and datasets The performance gap is particularly pronounced at small theta, where accurate temporal localization is most critical Robustness and Trade-offs TMIA remains effective even under shadow model heterogeneity, showing marginal reductions in T-F1 when datasets, architectures, or update algorithms are mismatched The performance of TMIA is sensitive to the sliding-window size, with a window size of 7 yielding the best T-F1 performance and a window size of 11 achieving the highest I-F1 score Furthermore, increasing membership duration consistently improves TMIA’s performance across all datasets because longer intervals allow confidence score changes to stabilize Potential defenses like label-only output, dropout, and differential privacy can reduce TMIA’s privacy risks but often at the cost of model utility Differential privacy offers the strongest protection but incurs the most severe loss in model utility The paper concludes that TMIA enables accurate recovery of continuous membership intervals for interval-level membership inference, demonstrating that temporal membership inference is inherently more challenging than timestamp-level inference The work opens directions for future research into whitebox settings and designing methods specifically to mitigate temporal membership leakage Developing formal guarantees and benchmarks that account for temporal dynamics is both crucial and urgent The paper also shows that TMIA can recover continuous membership intervals even from large generative models A Proof of Theorem 5 The proof establishes the correctness of the three-step process by proving Lemma 1, which states that no two consecutive timestamps in the set of representative timestamps share the same label This lemma leads to three cases for constructing membership intervals based on whether there are equal, one more entry point than exit point, or one more exit point than entry point among the representative labels In all three cases, the constructed intervals satisfy the three requirements in Definition 4 This formalizes the correctness of our approach and provides a foundation for interval-level measurement References

Title and authors: Nadia: So we're looking at this paper called "Timing is Everything: Inferring Temporal Membership in Continually Updated Models" and it tackles the problem of privacy risks that pop up when deep learning models are constantly being updated.

Elias: It seems like they've formally defined what temporal membership even means in these situations, splitting it into two levels: just checking if a sample was in the training set at a specific time, and figuring out the whole time window—the interval—during which it was involved.

Priya: So if we think about this for someone driving or cooking something, it's like trying to figure out not just if a piece of data is in the current batch of ingredients, but exactly when that ingredient was added and when it left the process.

Nadia: That’s right. The paper introduces this specific attack called TMIA, which uses bidirectional LSTMs to look at how the model outputs change over time to figure out those exact entry and exit points for a sample.

Elias: What's interesting is how they construct these intervals; they use training update-aligned shadow models and a labeling phase where they train an LSTM with a sliding window to mark timestamps as non-change, entry point, or exit point.

Priya: So the methodology sounds pretty complex for something designed to find the start and end times of involvement across many snapshots. I wonder if that complexity actually leads to reliable results when you're dealing with real-world data drift.

Nadia: Well, they show extensive experiments on three language models and three image classification models, and the results are pretty strong for both timestamp-level inference—they get good T-Pre, T-Rec, and T-F1 scores across all those settings.

Elias: And for the interval level too, they report consistently strong I-Pre and I-Rec results across all those different models and datasets. They even show that the performance gap is really noticeable when the time window size is small, which makes sense since accurate temporal localization matters most then.

Priya: What does that mean for us on the ground? If we're worried about a specific piece of data being used in training, this suggests that simply looking at static model outputs isn't enough; you need to track the entire evolution of the model over time to get meaningful privacy information.

Nadia: Exactly. And they also address robustness by showing that TMIA still works even when the shadow models they use are different from the target model, although there are some slight drops in T-F1 when everything is mismatched—datasets, architectures, or update algorithms don't line up perfectly.

Elias: They also found that the sliding window size for their LSTM matters; a window size of seven gave them the best T-F1 performance for timestamp inference, while a window size of eleven was better for interval inference scores.

Priya: It’s interesting how sensitive it is to those specific settings, but they also noted that making the membership duration longer consistently improves TMIA’s performance across all datasets because it helps stabilize those confidence score changes.

Nadia: The paper points out some potential defenses too, like label-only output or dropout or differential privacy, and they show these things can reduce the privacy risks associated with TMIA, but usually at a cost to the model's utility.

Elias: Differential privacy is presented as offering the strongest protection against this type of leakage but it definitely brings in the most severe loss for how good that model actually performs.

Priya: So while these defenses offer some mitigation, they don't seem like a simple fix, and there’s always that trade-off between keeping the data private and keeping the model useful for its intended task.

Nadia: To wrap up on "Timing is Everything: Inferring Temporal Membership in Continually Updated Models," this paper really shows that inferring continuous membership intervals is inherently harder than just checking if a sample was present at one specific moment.

Elias: It opens up new directions for research, pushing people to focus on designing methods specifically to handle these temporal dynamics and build formal guarantees around them in whitebox settings.

Priya: I think the work really highlights that for continual updates, we can't just treat the model as a static entity; we have to analyze its whole history of updates to protect privacy properly.

Nadia: That's it for this one. It shows how important it is to study these temporal risks systematically. We’ll see what other papers are tackling next on our feed.

The paper's summary: Nadia: So, to recap, this paper looks at continual model updating—where an AI keeps learning new things over and over—and introduces this method called TMIA to figure out exactly when a piece of data was involved in that learning process, not just if it was in the training set at all.

Elias: Right. It formalizes what temporal membership means at two levels: checking if something was in the training set at a single moment, and figuring out the whole time window, or interval, during which it participated in training.

Priya: So instead of just looking at a snapshot of the model's knowledge, this technique lets you trace the sample's journey through all those snapshots over time.

Nadia: Exactly. The attack works by creating shadow models that mimic how the target model evolves across different times, and then they use a specialized bidirectional LSTM to spot when the training data actually caused a change in the model’s output scores.

Elias: The labeling part is key there; they train this LSTM with a sliding window to mark every single timestamp as either no change, an entry point where something new happened, or an exit point where that involvement stopped.

Priya: That sounds like a very precise way to map out the data's interaction timeline within the model’s development history.

Nadia: And they build these membership intervals in a three-step process: first finding those entry and exit points, then picking representative timestamps with high confidence scores in groups of consecutive same-labeled timestamps, and finally pairing those up to form a valid interval.

Elias: The proof of theorem five is pretty solid too; they show that this three-step procedure always creates intervals that fit the required definition by proving that no two consecutive representative timestamps share the same label.

Priya: What does this mean practically? It suggests that we can finally look past a static model and start seeing the actual data lifecycle within a constantly changing system.

Nadia: And the results are pretty strong, showing it works well on language models and image classification models, giving them good scores for both pinpointing single timestamps and figuring out those whole time intervals.

Elias: The authors point out that the performance gap is especially noticeable when the time window they are looking at is small, which makes sense because getting the timing exactly right is super hard then.

Priya: They also show that if you make the membership duration longer, it actually helps TMIA perform better across all datasets because it helps stabilize those confidence score changes.

Nadia: And they did show that this attack can still work even when the shadow models they use are different from the target model, though there are some small drops in accuracy when everything—the datasets, the architectures, or the update algorithms—don't match up perfectly.

Elias: So while it’s quite robust against those mismatches, they also pointed out that defenses like label-only output or dropout can reduce the privacy risks of TMIA, but usually at a cost to how good the model is at its job.

Priya: It sounds like a clear trade-off: you can try to protect the data's history, but it usually means sacrificing some of that model’s original accuracy.

Nadia: Exactly. This paper really shows that tracing these temporal dynamics is a much harder task than just checking if something was in the training set at one specific moment.

Elias: It points toward a need for more research focused on designing methods specifically to handle these time-dependent behaviors and building formal guarantees around them in systems where things are constantly changing.

Priya: It opens up new avenues for understanding how privacy risks evolve when models are updated continuously, which is a huge area we're looking into.

The paper's improvements: Tom: So we're looking at how the authors suggest they can make this TMIA method even better for dealing with these time windows and intervals that they're trying to find in continual model updates.

Nadia: They talk about using longer membership durations as a way to improve the attack’s performance across all datasets because it helps stabilize those confidence score changes, which makes it easier to find those entry and exit points accurately.

Elias: That makes sense from a cryptographic standpoint; if you have more data points in that time frame, the signal for when something started or stopped becomes clearer through the measurement record.

Priya: From a privacy researcher's view, that suggests that if we can track samples longer, we might get a more reliable estimate of their full involvement period, which is valuable information.

Nadia: They also touched on defenses like label-only output or dropout and said those can reduce the privacy risks associated with TMIA because they disrupt the attack’s ability to see those temporal changes in the first place.

Elias: They pointed out that these defenses can be integrated into continual updates, meaning you could potentially have a model that's both learning new things and actively trying to obscure its training history simultaneously.

Priya: But they also highlighted the trade-off again: applying those defenses usually means sacrificing some of the model’s utility, so you’re trading privacy for performance.

Nadia: It seems like the authors are really focused on finding that sweet spot, figuring out how much privacy leakage you can tolerate before the model becomes unusable.

Elias: They also mentioned that they need to develop formal guarantees and benchmarks specifically designed to handle these temporal dynamics so we have a solid proof of correctness beyond just showing it works on three models and three image classifiers.

Priya: That’s crucial; we need formal methods that can prove the method is correct when dealing with the complex timing dependencies of real-world data drift.

Nadia: And they emphasized that developing these tools for whitebox settings, where you have full access to the model, is really important because most real-world threats are happening there.

Elias: It’s also interesting that they showed this framework can recover continuous membership intervals even from large generative language models by adapting the process to use model perplexity instead of just confidence scores.

Priya: That's a big deal because it means we don't have to rely on direct confidence outputs being available; we can use other metrics like how well the AI predicts the next word.

Nadia: So, in short, they’re suggesting ways to make the attack more accurate by extending the time window and using better labeling techniques, while also showing how defenses work and what formal verification we still need.

Conclusion: Nadia: So we've seen how this paper, "Timing is Everything: Inferring Temporal Membership in Continually Updated Models," tackles the problem of figuring out exactly when a piece of data was involved in an AI’s learning process during constant updates.

Elias: Right. It shows that tracing the sample's journey through all those snapshots over time is possible by using shadow models and tracking confidence score changes with a bidirectional LSTM.

Priya: I think what this really means for us is that we can finally look past a static model and start seeing the actual data lifecycle within a constantly changing system.

Nadia: The numbers show it works well on language models and image classifiers for both pinpointing single moments and figuring out those whole time intervals of involvement.

Elias: And they proved that the method is correct by showing no two consecutive representative timestamps share the same label, which is a big deal for formalizing interval-level measurement.

Priya: It’s interesting that they also showed this attack can still work even when the shadow models are mismatched, though there are some small drops in accuracy when things like the update algorithms don't match up perfectly.

Nadia: They also pointed out that defenses like label-only output can reduce the privacy risks associated with TMIA because they disrupt those temporal changes in the first place.

Elias: They emphasized that developing formal guarantees and benchmarks specifically for these time-dependent behaviors is a huge need in whitebox settings.

Priya: It also shows that making the membership duration longer actually helps improve the attack’s performance across all datasets because it stabilizes those confidence score changes.

Nadia: So, to wrap up, this paper provides a solid framework for understanding and attacking temporal membership in continually updated models.

Elias: It points toward a need for more research focused on designing methods specifically to handle these time-dependent behaviors and building formal guarantees around them.

Priya: I think the work really highlights that we need to systematically study these temporal risks because they are inherently more challenging than just checking if something was present at one single moment.

Jie Fu, Xiangpeng Deng, Yuan Hong, Wendy Hui Wang

Stevens Institute of Technology · University of Connecticut

cs.CR, cs.LG

Submitted: 2026-11-04

Updated: 2026-11-04

Code: https://github.com/inspire-group/membership-inference-evaluation

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 91/100

The gist: Continual model updating introduces new privacy risks that require systematic study and formalization of temporal membership to address The paper presents TMIA…

Key concepts

Temporal Membership Inference
This refers to determining whether a specific data sample was part of the training set at a precise moment or during a specific time window. It moves beyond simple membership to pinpoint exactly when and for how long the data influenced model updates.
Timestamp-level vs. Interval-level
At the timestamp level, TMIA checks if a sample was in training at one exact point in time. At the interval level, it tries to find the continuous time period (entry and exit points) during which that sample was part of multiple model snapshots.
Shadow Models
These are copies of the target model that simulate its evolution over time. The attack analyzes how these shadow models change as they are updated to capture the temporal patterns necessary to infer membership intervals.
Bidirectional LSTM
This is a type of neural network used in the attack. It reads sequences of model outputs across different timestamps both forward and backward, allowing it to learn complex dependencies that help identify entry and exit points for a sample's influence.

Summary

Continual model updating introduces new privacy risks that require systematic study and formalization of temporal membership to address The paper presents TMIA, a novel black-box attack leveraging bidirectional LSTMs to infer whether and when individual samples were involved in model training at both timestamp-level and interval-level granularities

Problem Formalization

The paper formalizes the notion of temporal membership in continually updated models, defining temporal membership inference at two levels: timestamp-level and interval-level At the timestamp level, the adversary seeks to determine whether a target sample belongs to the training set at a specific point in time At the interval level, the adversary aims to infer the time interval(s) during which the sample participates in training, identifying its entry and exit points Temporal membership is defined based on whether a sample is in the initial dataset or if its most recent update involving it was an insertion The temporal membership interval is defined as the time periods during which a sample is a member of corresponding model snapshots, where tstart is the entry point and tend is the exit point

Attack Methodology

TMIA infers temporal membership intervals by analyzing model updates across multiple timestamps through three main components: training update-aligned shadow models, labeling timestamps, and constructing membership intervals The adversary constructs a sequence of shadow models that emulate the target model’s evolution over time to capture temporal changes in the model’s outputs The labeling phase involves training a BiLSTM with a sliding window to map each timestamp in the output sequence to a label: N for non-change point, E for entry point, and X for exit point Valid membership intervals are constructed through a three-step procedure involving extracting entry and exit points, selecting representative timestamps with the highest confidence score in groups of consecutive same-label timestamps, and pairing these representatives to form intervals

Empirical Evaluation

Extensive experiments on three language models and three image classification models show that TMIA is highly effective and significantly outperforms existing baselines For timestamp-level inference, TMIA achieves strong T-Pre, T-Rec, and T-F1 results across all settings for the language models For interval-level inference, TMIA also achieves consistently strong I-Pre and I-Rec results on all models and datasets The performance gap is particularly pronounced at small theta, where accurate temporal localization is most critical

Robustness and Trade-offs

TMIA remains effective even under shadow model heterogeneity, showing marginal reductions in T-F1 when datasets, architectures, or update algorithms are mismatched The performance of TMIA is sensitive to the sliding-window size, with a window size of 7 yielding the best T-F1 performance and a window size of 11 achieving the highest I-F1 score Furthermore, increasing membership duration consistently improves TMIA’s performance across all datasets because longer intervals allow confidence score changes to stabilize Potential defenses like label-only output, dropout, and differential privacy can reduce TMIA’s privacy risks but often at the cost of model utility Differential privacy offers the strongest protection but incurs the most severe loss in model utility

Conclusion

The paper concludes that TMIA enables accurate recovery of continuous membership intervals for interval-level membership inference, demonstrating that temporal membership inference is inherently more challenging than timestamp-level inference The work opens directions for future research into whitebox settings and designing methods specifically to mitigate temporal membership leakage Developing formal guarantees and benchmarks that account for temporal dynamics is both crucial and urgent The paper also shows that TMIA can recover continuous membership intervals even from large generative models

A Proof of Theorem 5

The proof establishes the correctness of the three-step process by proving Lemma 1, which states that no two consecutive timestamps in the set of representative timestamps share the same label This lemma leads to three cases for constructing membership intervals based on whether there are equal, one more entry point than exit point, or one more exit point than entry point among the representative labels In all three cases, the constructed intervals satisfy the three requirements in Definition 4 This formalizes the correctness of our approach and provides a foundation for interval-level measurement

References

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Temporal membership inference attack TMIA can be used to infer whether and when individual samples were involved in model training at both timestamp-level and interval-level granularities, allowing adversaries to identify the time interval during which a sensitive document was included in training.

  2. The proposed TMIA framework leverages a bidirectional LSTM to accurately predict a sample’s entry and exit points from its confidence-score trajectories across model updates, enabling the construction of valid membership intervals that respect temporal constraints.

  3. The system can be evaluated against various update algorithms, including fine-tuning, Gradient Ascent (GA), and Negative Preference Optimization (NPO), providing a comprehensive understanding of privacy risks in continually updated environments.

  4. TMIA can be applied to large generative language models by adapting the framework to use model perplexity instead of confidence scores, enabling the inference of temporal membership even when direct confidence outputs are unavailable.

  5. The system can be robust against shadow model heterogeneity, maintaining high attack effectiveness even when the shadow and target models have mismatched datasets, architectures, or update algorithms.

  6. Defense mechanisms such as label-only output and dropout can be integrated into continual updates to reduce TMIA's privacy risks while maintaining a favorable trade-off between privacy protection and model utility.

Sources

Related papers