Search arXivSearch

arXiv · 2509.05259

Glass-Box Deep Learning for FDIA Detection in Nonlinear Automatic Generation Control: A Kolmogorov-Arnold Network Approach

Abstract

Automatic Generation Control (AGC) plays a critical role in maintaining power balance across multi-area power systems. However, its complete reliance on remotely communicated measurements makes it susceptible to cyber-induced False Data Injection Attacks (FDIAs), which can alter measurement values and destabilize system operation. Unlike prior studies that employ black-box Deep Learning (DL) models for FDIA detection, this paper proposes an interpretable and accurate Kolmogorov-Arnold Network (KAN)-based framework for detecting FDIAs in AGC systems, explicitly accounting for nonlinearities often overlooked in previous work. The proposed KAN model effectively identifies FDIAs in nonlinear AGC systems using only AGC measurements. Moreover, KANs inherently facilitate the extraction of symbolic equations, a capability absent in conventional DL models. After training, these equations can be directly utilized for FDIA detection, enhancing interpretability without compromising accuracy. The framework is trained offline to learn the nonlinear relationships among AGC measurements under diverse normal operating conditions and under FDIA scenarios that manipulate those measurements. Following training, pruning, and fine-tuning, symbolic expressions describing the model's decision logic are extracted. Both the trained KAN model and the extracted symbolic expressions are subsequently employed and evaluated for FDIA detection. Our results using a benchmark power system demonstrate that the proposed KAN-based framework and its associated symbolic representations accurately detect FDIAs targeting nonlinear AGC systems while preserving AGC reliability. The approach outperforms existing methods and provides a robust, interpretable mechanism for verifying AGC measurement authenticity against potential FDIAs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmad Mohammad Saber, Alok Paranjape, Jehad Jilan, Niranjana Naveen Nambiar, Amr Youssef, Deepa Kundur. 2026-09-18. Glass-Box Deep Learning for FDIA Detection in Nonlinear Automatic Generation Control: A Kolmogorov-Arnold Network Approach. https://arxiv.org/abs/2509.05259

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG