paper-with-me

홈 › Papers

Towards a data-scale independent regulariser for robust sparse identification of non-linear dynamics

2026-03-05 · Jay Raut, Daniel N. Wilke, Stephan Schmidt arxiv

Data normalisation, a common and often necessary preprocessing step in engineering and scientific applications, can severely distort the discovery of governing equations by magnitudebased sparse regression methods. This issue is particularly acute for the Sparse Identification of Nonlinear Dynamics (SINDy) framework, where the core assumption of sparsity is undermined by the interaction between data scaling and measurement noise. The resulting discovered models can be dense, uninterpretable, and physically incorrect. To address this critical vulnerability, we introduce the Sequential Thresholding of Coefficient of Variation (STCV), a novel, computationally efficient sparse regression algorithm that is inherently robust to data scaling. STCV replaces conventional magnitude-based thresholding with a dimensionless statistical metric, the Coefficient Presence (CP), which assesses the statistical validity and consistency of candidate terms in the model library. This shift from magnitude to statistical significance makes the discovery process invariant to arbitrary data scaling. Through comprehensive benchmarking on canonical dynamical systems and practical engineering problems, including a physical mass-spring-damper experiment, we demonstrate that STCV consistently and significantly outperforms standard Sequential Thresholding Least Squares (STLSQ) and Ensemble-SINDy (E-SINDy) on normalised, noisy datasets. The results show that STCV-based methods can successfully identify the correct, sparse physical laws even when other methods fail. By mitigating the distorting effects of normalisation, STCV makes sparse system identification a more reliable and automated tool for real-world applications, thereby enhancing model interpretability and trustworthiness.

📄 PDF Abstract BibTeX arXiv:2603.05201

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

When is there a Representer Theorem? Nondifferentiable Regularisers and Banach spaces

2018-04-25 · Kevin Schlegel

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the l…

SIGMA: Scale-Invariant Global Sparse Shape Matching

2023-08-16 · ICCV 2023 1 · Maolin Gao, Paul Roetzer, Marvin Eisenberger, Zorah Lähner 외

We propose a novel mixed-integer programming (MIP) formulation for generating precise sparse correspondences for highly non-rigid shapes. To this end, we introduce a projected Laplace-Beltrami operator (PLBO) which combi…

The jump set under geometric regularisation. Part 1: Basic technique and first-order denoising

2014-07-06 · Tuomo Valkonen

Let $u \in \mbox{BV}(\Omega)$ solve the total variation denoising problem with $L^2$-squared fidelity and data $f$. Caselles et al. [Multiscale Model. Simul. 6 (2008), 879--894] have shown the containment $\mathcal{H}^{m…

Denoising

When is there a Representer Theorem? Reflexive Banach spaces

2018-09-26 · Kevin Schlegel

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the l…

Learning Theory

Enforcing Perceptual Consistency on Generative Adversarial Networks by Using the Normalised Laplacian Pyramid Distance

2019-08-09 · Alexander Hepburn, Valero Laparra, Ryan McConville, Raul Santos-Rodriguez

In recent years there has been a growing interest in image generation through deep learning. While an important part of the evaluation of the generated images usually involves visual inspection, the inclusion of human pe…

Image GenerationImage SegmentationImage-to-Image TranslationSemantic Segmentation+1