菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-06-10
📄 Abstract - How Low Can You Go? Active Learning for Sparse Model Discovery in the Ultra-Low-Data Limit

Identifying the governing equations of complex dynamical systems remains a fundamental challenge across science and engineering. While early approaches relied on empirical data and heuristics, modern data-driven methods offer greater flexibility and fewer assumptions. However, data acquisition in real-world settings is often expensive. This work addresses this challenge by introducing an active learning strategy for dynamics discovery in the ultra-low data limit. Rather than sampling randomly, our method iteratively prioritizes regions that are most informative for model identification. This approach builds on Sparse Identification of Nonlinear Dynamics (SINDy), and utilizes an ensemble extension, E-SINDy, to estimate epistemic uncertainty and guide the sampling for both ordinary and partial differential equations (ODEs/PDEs). For ODEs, an exhaustive analysis is conducted on the Lorenz system across varying data budgets and noise levels. For PDEs, two systems with contrasting dynamical characteristics are examined: the Burgers' equation, where a sharp shock front creates a distinction between informative and uninformative regions, and the Kuramoto-Sivashinsky equation, which presents a more spatially complex sampling landscape. Across all scenarios, the proposed method accurately identifies the governing dynamics with significantly fewer data samples than random sampling.

顶级标签: machine learning systems
详细标签: active learning sparse identification dynamical systems equations discovery uncertainty estimation 或 搜索:

能有多低?超低数据极限下稀疏模型发现的主动学习策略 / How Low Can You Go? Active Learning for Sparse Model Discovery in the Ultra-Low-Data Limit


1️⃣ 一句话总结

本文提出了一种基于主动学习的智能采样方法,能在极少量数据(比如仅需几十个测量点)下,通过优先选取最有信息价值的区域,高效精确地发现复杂动力系统(如混沌运动、激波传播等)背后的控制方程,比传统随机采样大幅减少数据需求。

源自 arXiv: 2606.12182