TY - JOUR
T1 - A state alignment-centric approach to federated system identification
T2 - The FedAlign framework
AU - Keçeci, Ertuğrul
AU - Güzelkaya, Müjde
AU - Kumbasar, Tufan
N1 - Publisher Copyright:
© 2025 Elsevier B.V.
PY - 2025/12
Y1 - 2025/12
N2 - This paper presents FedAlign, a Federated Learning (FL) framework, designed for System Identification (SYSID) of linear State-Space Models (SSMs) by aligning state representations. Local workers can learn linear SSMs with equivalent representations but different parameter basins. We demonstrate that directly aggregating these local SSMs via FedAvg results in a global model with altered system dynamics. FedAlign overcomes this problem by employing similarity transformation matrices to align state representations of local SSMs, thereby establishing a common parameter basin that retains the dynamics of local SSMs. FedAlign computes similarity transformation matrices via two distinct approaches. In FedAlign-A, we represent the global SSM in controllable canonical form (CCF). We use control theory to analytically derive similarity transformation matrices that convert each local SSM into this form. Yet, establishing global SSM in CCF brings additional alignment challenges in multi-input multi-output SYSID, as CCF representation is not unique, unlike in single-input single-output SYSID. In FedAlign-O, we address the alignment challenges by reformulating the local parameter basin alignment problem as an optimization task. We set the parameter basin of a local worker as the common parameter basin and solve least square problems to obtain the transformation matrices needed to align the remaining local SSMs. The experiments conducted on synthetic and real-world datasets show that FedAlign outperforms FedAvg, converges faster, and provides improved global SSM stability thanks to local parameter basins’ alignment.
AB - This paper presents FedAlign, a Federated Learning (FL) framework, designed for System Identification (SYSID) of linear State-Space Models (SSMs) by aligning state representations. Local workers can learn linear SSMs with equivalent representations but different parameter basins. We demonstrate that directly aggregating these local SSMs via FedAvg results in a global model with altered system dynamics. FedAlign overcomes this problem by employing similarity transformation matrices to align state representations of local SSMs, thereby establishing a common parameter basin that retains the dynamics of local SSMs. FedAlign computes similarity transformation matrices via two distinct approaches. In FedAlign-A, we represent the global SSM in controllable canonical form (CCF). We use control theory to analytically derive similarity transformation matrices that convert each local SSM into this form. Yet, establishing global SSM in CCF brings additional alignment challenges in multi-input multi-output SYSID, as CCF representation is not unique, unlike in single-input single-output SYSID. In FedAlign-O, we address the alignment challenges by reformulating the local parameter basin alignment problem as an optimization task. We set the parameter basin of a local worker as the common parameter basin and solve least square problems to obtain the transformation matrices needed to align the remaining local SSMs. The experiments conducted on synthetic and real-world datasets show that FedAlign outperforms FedAvg, converges faster, and provides improved global SSM stability thanks to local parameter basins’ alignment.
KW - Deep learning
KW - Federated learning
KW - State alignment
KW - System identification
UR - https://www.scopus.com/pages/publications/105015136566
U2 - 10.1016/j.asoc.2025.113800
DO - 10.1016/j.asoc.2025.113800
M3 - Article
AN - SCOPUS:105015136566
SN - 1568-4946
VL - 184
JO - Applied Soft Computing
JF - Applied Soft Computing
M1 - 113800
ER -