Metraipolis › archive › dc_e2997ee827ca
Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration — arXiv:2608.13504
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13504
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:27:41.365Z
- SHA-256 of the archived text
d58166b8d56400016f4ef62d7ebf6c8e999d06e133217901ef6971137f6de0a4- Stable URL of this page
https://metraipolis.com/documento/dc_e2997ee827ca
How to cite
Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration — arXiv:2608.13504 — arXiv (en), https://arxiv.org/abs/2608.13504 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2997ee827ca (Metraipolis archive dc_e2997ee827ca, sha256 d58166b8d56400016f4ef62d7ebf6c8e999d06e133217901ef6971137f6de0a4)
BibTeX
@misc{dce2997ee827ca,
title = {Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration — arXiv:2608.13504},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13504},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2997ee827ca; sha256 d58166b8d56400016f4ef62d7ebf6c8e999d06e133217901ef6971137f6de0a4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13504. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop the Sparse Orthogonal Regression Technique (SORT), a sparse spectral framework for learning orthonormal-basis expansions from noisy and irregularly sampled data. SORT estimates expansion coefficients directly from observations using L1-regularized regression, avoiding explicit quadrature or analytic inner-product evaluation. The central application is data-driven discovery of ordinary differential equations: vector fields are represented in chosen orthogonal bases and learned as sparse coefficient expansions. This provides a complementary route to symbolic regression, grammar-based discovery, and SINDy-style sparse identification by first recovering a compact spectral representation, which can later guide searches for simpler analytic forms. Across the dynamical-system experiments, SORT matches or improves upon library-based sparse-regression baselines when the basis is well adapted to the problem, and shows more stable degradation under sparse sampling, noisy derivative estimates, and representation mismatch. Specific examples illustrate why this representation is useful: if a finite library misses the problem-specific nonlinearity, the resulting model can fail. SORT is not immune to mismatch, but it shifts the problem away from brittle selection among generic terms to basis design adapted to the problem domain. The experiments also show that dominant low-order coefficients persist as model order increases, supporting order-consistent model growth. Beyond equation discovery, the same learned expansion supports nonlinear approximation and estimation of complex, high-dimensional integrals by coefficient readout. Overall, SORT provides a reusable intermediate representation for system identification, approximation, and integration, while making basis design an explicit part of the scientific modeling problem. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-14 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.13504 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:20:35.867Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).