Paper Detail

Continual Learning With Participation Privacy: An Auditable Buffering-Aggregation Recipe

T-H. Hubert Chan, Elaine Shi, Mengshi Zhao, Mingxun Zhou

arxiv Score 10.0

Published 2026-07-08 · First seen 2026-07-10

Research Track A

Abstract

Modern federated and streaming learning systems often release intermediate models, so privacy must hold for the full trajectory under adaptive interaction. Motivated by participation privacy, we study single-edit neighboring user streams, where one insertion/deletion shifts all subsequent updates and defeats standard Hamming-neighbor continual-release analyses. We give an auditable modular recipe. A randomized buffering wrapper emits bins of size $[U,2U]$, reducing single-edit streams to a Hamming-style per-bin update stream with explicit backlog/delay guarantees, where $U$ is calibrated by the privacy parameters $(\varepsilon,δ)$. We then prove a certification theorem identifying when a non-adaptive Hamming-neighbor DP proof for a continual primitive lifts to adaptive inputs: the primitive must use fresh per-round randomness and have a stable one-round privacy profile under common adaptive context. Together, these ingredients yield trajectory-level $(\varepsilon,δ)$-DP for single-edit streams using standard primitives (e.g., tree prefix sums), with an explicit privacy--latency link via $U$.

Workflow Status

Review status
pending
Role
unreviewed
Read priority
now
Vote
Not set.
Saved
no
Collections
Not filed yet.
Next action
Not filled yet.

Reading Brief

No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.

Why It Surfaced

No ranking explanation is available yet.

Tags

No tags.

BibTeX

@article{chan2026continual,
  title = {Continual Learning With Participation Privacy: An Auditable Buffering-Aggregation Recipe},
  author = {T-H. Hubert Chan and Elaine Shi and Mengshi Zhao and Mingxun Zhou},
  year = {2026},
  abstract = {Modern federated and streaming learning systems often release intermediate models, so privacy must hold for the full trajectory under adaptive interaction. Motivated by participation privacy, we study single-edit neighboring user streams, where one insertion/deletion shifts all subsequent updates and defeats standard Hamming-neighbor continual-release analyses. We give an auditable modular recipe. A randomized buffering wrapper emits bins of size \$[U,2U]\$, reducing single-edit streams to a Hammi},
  url = {https://arxiv.org/abs/2607.07209},
  keywords = {cs.CR, cs.LG},
  eprint = {2607.07209},
  archiveprefix = {arXiv},
}

Metadata

{}