Byzantine-Robust Federated Fire Detection with a Rotating Coordinator
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Machine Learning
Title:Byzantine-Robust Federated Fire Detection with a Rotating Coordinator
Abstract:We study the application of federated learning (FL) to indoor fire detection. Such fire-detection systems use edge cameras that record sensitive footage which cannot easily be collected at a central server. Existing federated solutions leave three practical obstacles unaddressed: limited uplink bandwidth, Byzantine (malicious or faulty) clients, and unconditional trust in a single, permanently fixed aggregation server. Our main contributions address all three. In particular, we provide (i) a curated indoor fire-detection dataset assembled from eight public sources; (ii) an edge-deployable detector whose model updates are compressed up to 10 time with only a small loss in balanced accuracy; and (iii) a semi-decentralized Byzantine-robust FL method that combines history-aware aggregation with a rotating coordinator, evicting stealthy attacks that per-round filters miss while removing the fixed-server single point of failure. On the held-out test set the rotating-coordinator method matches its fixed-server counterpart in accuracy and detection speed, and a physically distributed six-node cloud deployment confirms feasibility.
| Subjects: | Machine Learning (cs.LG) |
| ACM classes: | I.2.11; I.4.8; C.2.4 |
| Cite as: | arXiv:2609.10647 [cs.LG] |
| (or arXiv:2609.10647v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2609.10647
arXiv-issued DOI via DataCite (pending registration)
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
Generative Query Suggestion via Intent Coverage and Query-Level Credit Assignment
Sep 18
-
Layer-wise Curriculum Learning for Efficient LLM Compression
Sep 18
-
Block Parallelism For Efficient Distributed Long-Context Diffusion Language Model Training
Sep 18
-
Randomized SVD Approximations for Spectral Co-Clustering of Word-Document Matrices
Sep 18
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.