aiqbench analysis
This research presents FedSysID, a federated learning framework designed to collaboratively identify linear dynamical systems across heterogeneous clients without sharing raw data. By leveraging existing federated algorithms at the client level, the approach achieves improved sample efficiency and provides tighter error bounds compared to single-agent settings. The work is significant for advancing machine learning applications in distributed control systems where data privacy and system diversity are critical constraints.
FedSysID: A Federated Approach to Sample-Efficient System Identification
arXiv:2211.14393v2 Announce Type: replace Abstract: We study the problem of learning a linear system model from the observations of $M$ clients. The catch: Each client is observing data from a different dynamical system. This work addresses the question of how multiple clients collaboratively learn dynamical models in the presence of heterogeneity. We pose this problem as a federated learning problem and characterize the tension between achievable performance and system heterogeneity. Furthermore, our federated sample complexity result provides a constant factor improvement over the single agent setting. Finally, we describe a meta federated learning algorithm, FedSysID, that leverages existing federated algorithms at the client level.
Abstract:We study the problem of learning a linear system model from the observations of $M$ clients. The catch: Each client is observing data from a different dynamical system. This work addresses the question of how multiple clients collaboratively learn dynamical models in the presence of heterogeneity. We pose this problem as a federated learning problem and characterize the tension between achievable performance and system heterogeneity. Furthermore, our federated sample complexity result provides a constant factor improvement over the single agent setting. Finally, we describe a meta federated learning algorithm, FedSysID, that leverages existing federated algorithms at the client level.
Paper accepted at L4DC 2023. This version refines the error bounds and correct typos in the paper
Machine Learning (cs.LG); Systems and Control (eess.SY); Optimization and Control (math.OC)
arXiv:2211.14393 [cs.LG]
(or arXiv:2211.14393v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2211.14393 Focus to learn more arXiv-issued DOI via DataCite
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.
Full text under the publisher's open licence · 216 words
Related coverage

[AINews] not much happened today
Latent Space · Oct 3, 2026

Memory , Fakes , and Thermodynamic Compute : CHIPS Act Bets $874M on Six AI Stack Gaps
techtimes.com · Jul 31, 2026

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · Sep 24, 2026
[AINews] Reflection Beam - 501B-A23B American Open Model
Latent Space · Oct 6, 2026