Sparsistent Model Discovery

by   Georges Tod, et al.

Discovering the partial differential equations underlying a spatio-temporal datasets from very limited observations is of paramount interest in many scientific fields. However, it remains an open question to know when model discovery algorithms based on sparse regression can actually recover the underlying physical processes. We trace back the poor of performance of Lasso based model discovery algorithms to its potential variable selection inconsistency: meaning that even if the true model is present in the library, it might not be selected. By first revisiting the irrepresentability condition (IRC) of the Lasso, we gain some insights of when this might occur. We then show that the adaptive Lasso will have more chances of verifying the IRC than the Lasso and propose to integrate it within a deep learning model discovery framework with stability selection and error control. Experimental results show we can recover several nonlinear and chaotic canonical PDEs with a single set of hyperparameters from a very limited number of samples at high noise levels.


page 4

page 6

page 9

page 11

page 15

page 16


Discovering PDEs from Multiple Experiments

Automated model discovery of partial differential equations (PDEs) usual...

DeepMoD: Deep learning for Model Discovery in noisy data

We introduce DeepMoD, a deep learning based model discovery algorithm wh...

Machine Discovery of Partial Differential Equations from Spatiotemporal Data

The study presents a general framework for discovering underlying Partia...

Sparsely constrained neural networks for model discovery of PDEs

Sparse regression on a library of candidate features has developed as th...

Challenges of Integrating A Priori Information Efficiently in the Discovery of Spatio-Temporal Objects in Large Databases

Using the knowledge discovery framework, it is possible to explore objec...

Model discovery in the sparse sampling regime

To improve the physical understanding and the predictions of complex dyn...

When is best subset selection the "best"?

Best subset selection (BSS) is fundamental in statistics and machine lea...