General
Sparse Fault Detection in Linear Systems: Equivalence of GLR Tests and $\ell_1$-regularized Least Squares
arXiv stat.TH0 views
arXiv:2611.11625v2 Announce Type: replace Abstract: This paper studies the detection of an impulsive fault of unknown time and input channel in a linear system with unknown initial state and Gaussian measurement noise. First, we show that the generalized likelihood ratio test, after the initial state is eliminated by projection onto the parity space, is the zero-solution test of a weighted lasso with an unpenalized nuisance block; the regularization parameter is the test threshold, and for unknown noise variance the same holds for the square-root lasso. Second, we show that the null distribution depends on the system only through a Gram matrix, so that the threshold is computed exactly and offline, and we compare it with closed-form bounds. Third, we characterize the fraction of a fault that survives the projection: we give it in closed form through observability Gramians, we show that it converges to a geometrically decaying profile for strictly stable systems, and that, for systems with unit-modulus modes, it grows linearly with the fault time as a fraction of the record length. Numerical studies, including a two-input, two-output example, illustrate the results.
Source:https://arxiv.org/abs/2611.11625PreviousOn the parametric and semiparametric Fisher information matrix for non-zero mean stationary spherical invariant random processesNextDecomposition Bounds for MCMC with Mixture Targets: Multimodality and Heavy-Tailedness
Related posts
If nobody writes it down, it did not get decided
0dev.to Productivity
Micrograph B-factor estimation via Wilson statistics
0arXiv eess.IV
Greedy Vector Approximation Based on Rotation for Multiplierless Complex Products
0arXiv eess.SP
Toward Massive MIMO HAPS Networks: Antenna Architectures and Design
0arXiv eess.SP
Deep-Learning-Assisted Full Waveform Inversion for Attenuation Reconstruction in Ultrasound Computed Tomography
0arXiv eess.SP
Two is better than one: optimizing binary rating scales for online platforms
0arXiv cs.MA