mlsanityData to 14 Oct 2026

Kalman Filter Aided Federated Koopman Learning

arXiv 2507.04808 ↗First posted 7 Jul 2025cs.IT cs.LG math.ITcited by 1

Not on the map. Why?

Abstract (arXiv)

Real-time control and estimation are pivotal for applications such as industrial automation and future healthcare. The realization of this vision relies heavily on efficient interactions with nonlinear systems. Therefore, Koopman learning, which leverages the power of deep learning to linearize nonlinear systems, has been one of the most successful examples of mitigating the complexity inherent in nonlinearity. However, the existing literature assumes access to accurate system states and abundant high-quality data for Koopman analysis, which is usually impractical in real-world scenarios. To fill this void, this paper considers the case where only observations of the system are available and where the observation data is insufficient to accomplish an independent Koopman analysis. To this end, we propose Kalman Filter aided Federated Koopman Learning (KF-FedKL), which pioneers the combination of Kalman filtering and federated learning with Koopman analysis. By doing so, we can achieve collaborative linearization with privacy guarantees. Specifically, we employ a straightforward yet efficient loss function to drive the training of a deep Koopman network for linearization. To obtain system information devoid of individual information from observation data, we leverage the unscented Kalman filter and the unscented Rauch-Tung-Striebel smoother. To achieve collaboration between clients, we adopt the federated learning framework and develop a modified FedAvg algorithm to orchestrate the collaboration. A convergence analysis of the proposed framework is also presented. Finally, through extensive numerical simulations, we showcase the performance of KF-FedKL under various situations.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 58 references that are in the map. First posted on arXiv 7 Jul 2025.

Builds on

22 of 58 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  4. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  5. 2020Adaptive Federated Optimizationcited by 1,046
  6. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  7. 2018Local SGD Converges Fast and Communicates Littlecited by 605
  8. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
  9. 2017Deep learning for universal linear embeddings of nonlinear dynamicscited by 494
  10. 2019Asynchronous Federated Optimizationcited by 267
  11. 2017VAMPnets: Deep learning of molecular kineticscited by 136
  12. 2021KalmanNet: Neural Network Aided Kalman Filtering for Partially Known Dynamicscited by 132
10 more
  1. 2021Asynchronous Federated Learning on Heterogeneous Devices: A Surveycited by 93
  2. 2022Federated Learning Enables Big Data for Rare Cancer Boundary Detectioncited by 84
  3. 2017Data-driven discovery of Koopman eigenfunctions for controlcited by 64
  4. 2019Active Learning of Dynamics for Data-Driven Control Using Koopman Operatorscited by 32
  5. 2022Deep Koopman Operator with Control for Nonlinear Systemscited by 25
  6. 2023DANSE: Data-driven Non-linear State Estimation of Model-free Process in Unsupervised Learning Setupcited by 19
  7. 2023Integrated Sensing and Communication Signals Toward 5G-A and 6G: A Surveycited by 12
  8. 2014Learning from Data with Heterogeneous Noise using SGDcited by 4
  9. 2023A Unified Filter Method for Jointly Estimating State and Parameters of Stochastic Dynamical Systems via the Ensemble Score Filtercited by 3
  10. 2014Linearization of Time-Varying Nonlinear Systems Using A Modified Linear Iterative Methodcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.