paper-with-me

홈 › Papers

From STLS to Projection-based Dictionary Selection in Sparse Regression for System Identification

2025-12-16 · Hangjun Cho, Fabio V. G. Amaral, Andrei A. Klishin, Cassio M. Oishi, Steven L. Brunton arxiv

In this work, we revisit dictionary-based sparse regression, in particular, Sequential Threshold Least Squares (STLS), and propose a score-guided library selection to provide practical guidance for data-driven modeling, with emphasis on SINDy-type algorithms. STLS is an algorithm to solve the $\ell_0$ sparse least-squares problem, which relies on splitting to efficiently solve the least-squares portion while handling the sparse term via proximal methods. It produces coefficient vectors whose components depend on both the projected reconstruction errors, here referred to as the scores, and the mutual coherence of dictionary terms. The first contribution of this work is a theoretical analysis of the score and dictionary-selection strategy. This could be understood in both the original and weak SINDy regime. Second, numerical experiments on ordinary and partial differential equations highlight the effectiveness of score-based screening, improving both accuracy and interpretability in dynamical system identification. These results suggest that integrating score-guided methods to refine the dictionary more accurately may help SINDy users in some cases to enhance their robustness for data-driven discovery of governing equations.

📄 PDF Abstract BibTeX arXiv:2512.14404

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Dictionary Learning Phase Retrieval from Noisy Diffraction Patterns

2018-10-18

This paper proposes a novel algorithm for image phase retrieval, i.e., for recovering complex-valued images from the amplitudes of noisy linear combinations (often the Fourier transform) of the sought complex images. The…

Dictionary LearningregressionRetrieval

Fast Locality Sensitive Hashing with Theoretical Guarantee

2023-09-27 · Zongyuan Tan, Hongya Wang, Bo Xu, Minjie Luo 외

Locality-sensitive hashing (LSH) is an effective randomized technique widely used in many machine learning tasks. The cost of hashing is proportional to data dimensions, and thus often the performance bottleneck when dim…

Efficient Dictionary Learning via Very Sparse Random Projections

2015-04-05 · Farhad Pourkamali-Anaraki, Stephen Becker, Shannon M. Hughes

Performing signal processing tasks on compressive measurements of data has received great attention in recent years. In this paper, we extend previous work on compressive dictionary learning by showing that more general …

ClusteringDictionary Learning

Multi-Target XGBoostLSS Regression

2022-10-13 · Alexander März

Current implementations of Gradient Boosting Machines are mostly designed for single-target regression tasks and commonly assume independence between responses when used in multivariate settings. As such, these models ar…

regression

Exact identification of nonlinear dynamical systems by Trimmed Lasso

2023-08-03 · Shawn L. Kiser, Mikhail Guskov, Marc Rébillat, Nicolas Ranc

Identification of nonlinear dynamical systems has been popularized by sparse identification of the nonlinear dynamics (SINDy) via the sequentially thresholded least squares (STLS) algorithm. Many extensions SINDy have em…