The paper addresses novelty detection across a network of independent agents who can't share raw data (privacy or bandwidth constraints). Instead, agents exchange low-precision (quantized) versions of learned scoring functions — think compressed model summaries — and use them to collectively decide what's novel while controlling the global false-discovery rate. The authors prove that evaluating new data against these quantized composite scores maintains the statistical exchangeability property needed for rigorous coverage guarantees, and show empirically that you get competitive detection power with drastically lower communication overhead.
Main takeaways:
- Decentralized novelty detection where agents share quantized scoring functions rather than raw data or full-precision models.
- Maintains finite-sample false-discovery-rate control even with low-precision model exchange, backed by formal proof.
- Drastically cuts communication cost while preserving statistical power in synthetic experiments.
- Could apply to federated or edge settings where bandwidth is limited and privacy matters.