Sparsely constrained neural networks for model discovery of PDEs
arXiv:2011.04336
Abstract
Sparse regression on a library of candidate features has developed as the prime method to discover the partial differential equation underlying a spatio-temporal data-set. These features consist of higher order derivatives, limiting model discovery to densely sampled data-sets with low noise. Neural network-based approaches circumvent this limit by constructing a surrogate model of the data, but have to date ignored advances in sparse regression algorithms. In this paper we present a modular framework that dynamically determines the sparsity pattern of a deep-learning based surrogate using any sparse regression technique. Using our new approach, we introduce a new constraint on the neural network and show how a different network architecture and sparsity estimator improve model discovery accuracy and convergence on several benchmark examples. Our framework is available at \url{https://github.com/PhIMaL/DeePyMoD}
References in corpus (11)
- Neural Machine Translation by Jointly Learning to Align and Translate
- API design for machine learning software: experiences from the scikit-learn project
- Physics Informed Deep Learning (Part I): Data-driven Solutions of Nonlinear Partial Differential Equations
- Data-driven discovery of coordinates and governing equations
- Discovering physical concepts with neural networks
- Hamiltonian Neural Networks
- Deep learning of dynamics and signal-noise decomposition with time-stepping constraints
- DeepMoD: Deep learning for Model Discovery in noisy data
- Lagrangian Neural Networks
- Stability selection enables robust learning of partial differential equations from limited noisy data
- Machine Discovery of Partial Differential Equations from Spatiotemporal Data