Search arXivSearch

arXiv · 2406.10359

State-Space Neural Network with Ordered Variance for Model Order Determination

Abstract

This paper addresses the problem of identifying a nonlinear state-space model, along with an adequate model order, from a given input-output training dataset. To this end, a novel framework, termed state-space neural network with ordered variance (SSNNO), is proposed. In SSNNO, the state variables are ordered according to their variances computed using the training data. This ordering is achieved by introducing a variance-regularization term into the loss function used for SSNNO training and it facilitates a distinction between significant states, which exhibit high variance from the other residual states with near-zero variance. The number of significant states is indicative of a suitable model order. The variance-regularization mechanism is designed to minimize the number of significant state variables, thereby promoting a minimal order of the identified state-space model without significantly compromising its prediction accuracy. A systematic procedure is then introduced to obtain a reduced-order state-space model from the trained SSNNO, yielding a reduced-order SSNNO (R-SSNNO). The existence of an SSNNO with variance-ordered states, based solely on input-output data, as well as an upper bound on its output prediction error, are formally established. A practical and robust method is proposed for ensuring variance-ordered states in an SSNNO, even when the network is trained using local optimization algorithms. The effectiveness of the proposed method for identification of nonlinear state space models is demonstrated through simulation studies on a nonlinear continuous stirred-tank reactor process. The identified model is further used for state estimation and prediction in a model predictive control implementation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Midhun T. Augustine, Mani Bhushan, Sharad Bhartiya. 2026-05-30. State-Space Neural Network with Ordered Variance for Model Order Determination. https://arxiv.org/abs/2406.10359

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

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY