  In this paper, we study the concurrent composition of interactive mechanisms
with adaptively chosen privacy-loss parameters. In this setting, the adversary
can interleave queries to existing interactive mechanisms, as well as create
new ones. We prove that every valid privacy filter and odometer for
noninteractive mechanisms extends to the concurrent composition of interactive
mechanisms if privacy loss is measured using $(\epsilon, \delta)$-DP, $f$-DP,
or R\'enyi DP of fixed order. Our results offer strong theoretical foundations
for enabling full adaptivity in composing differentially private interactive
mechanisms, showing that concurrency does not affect the privacy guarantees. We
also provide an implementation for users to deploy in practice.
