• Corpus ID: 197544831

Stability selection enables robust learning of partial differential equations from limited noisy data

@article{Maddu2019StabilitySE,
  title={Stability selection enables robust learning of partial differential equations from limited noisy data},
  author={Suryanarayana Maddu and Bevan L. Cheeseman and Ivo F. Sbalzarini and Christian L. M{\"u}ller},
  journal={ArXiv},
  year={2019},
  volume={abs/1907.07810}
}
We present a statistical learning framework for robust identification of partial differential equations from noisy spatiotemporal data. Extending previous sparse regression approaches for inferring PDE models from simulated data, we address key issues that have thus far limited the application of these methods to noisy experimental data, namely their robustness against noise and the need for manual parameter tuning. We address both points by proposing a stability-based model selection scheme to… 

Learning physically consistent differential equation models from data using group sparsity.

We propose a statistical learning framework based on group-sparse regression that can be used to (i) enforce conservation laws, (ii) ensure model equivalence, and (iii) guarantee symmetries when

Ensemble-SINDy: Robust sparse model discovery in the low-data, high-noise limit, with active learning and control

This work leverages the statistical approach of bootstrap aggregating (bagging) to robustify the sparse identification of the nonlinear dynamics (SINDy) algorithm and shows that ensemble statistics from E-Sindy can be exploited for active learning and improved model predictive control.

Learning physically consistent mathematical models from data using group sparsity

We propose a statistical learning framework based on group-sparse regression that can be used to 1) enforce conservation laws, 2) ensure model equivalence, and 3) guarantee symmetries when learning

Sparsistent Model Discovery

It is shown that the adaptive Lasso will have more chances of verifying the IRC than the Lasso and it is proposed to integrate it within a deep learning model discovery framework with stability selection and error control.

Towards data-driven inference of stencils for discrete differential operators

Finite element, finite difference or similar methods allow to numerically solve ordinary (ODEs) and partial differential equations (PDEs). The backbone of all these discrete approaches are matrices

Discovering PDEs from Multiple Experiments

A randomised adaptive group Lasso sparsity estimator is introduced to promote grouped sparsity and implement it in a deep learning based PDE discovery framework to create a learning bias that implies the a priori assumption that all experiments can be explained by the same underlying PDE terms with potentially different coefficients.

Model discovery in the sparse sampling regime

This work investigates how deep learning can improve model discovery of partial differential equations when the spacing between sensors is large and the samples are not placed on a grid, and shows how leveraging physics informed neural network interpolation and automatic differentiation, allow to better fit the data and its spatiotemporal derivatives, compared to more classic spline interpolations and numerical differentiation techniques.

Learning Sparse Nonlinear Dynamics via Mixed-Integer Optimization

This work proposes an exact formulation of the SINDy problem using mixed-integer optimization (MIO) to solve the sparsity constrained regression problem to provable optimality in seconds.

STENCIL-NET: Data-driven solution-adaptive discretization of partial differential equations

STENCILNET is presented, an artificial neural network architecture for data-driven learning of problem and resolution-specific local discretizations of nonlinear PDEs that can be used to predict solutions of the PDE on larger spatial domains and for longer times than it was trained for, hence addressing the problem of PDE-constrained extrapolation from data.

References

SHOWING 1-10 OF 74 REFERENCES

Data-driven discovery of partial differential equations

The sparse regression method is computationally efficient, robust, and demonstrated to work on a variety of canonical problems spanning a number of scientific domains including Navier-Stokes, the quantum harmonic oscillator, and the diffusion equation.

Robust data-driven discovery of governing physical laws with error bars

  • Sheng ZhangGuang Lin
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2018
The data-driven prediction of dynamics with error bars using discovered governing physical laws is more accurate and robust than classical polynomial regressions.

Learning partial differential equations via data discovery and sparse optimization

  • H. Schaeffer
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2017
This work develops a learning algorithm to identify the terms in the underlying partial differential equations and to approximate the coefficients of the terms only using data, which uses sparse optimization in order to perform feature selection and parameter estimation.

Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems

This paper proposes gradient projection algorithms for the bound-constrained quadratic programming (BCQP) formulation of these problems and test variants of this approach that select the line search parameters in different ways, including techniques based on the Barzilai-Borwein method.

Machine learning of linear differential equations using Gaussian processes

Model selection for hybrid dynamical systems via sparse regression

A new methodology is developed, Hybrid-Sparse Identification of Nonlinear Dynamics, which identifies separate nonlinear dynamical regimes, employs information theory to manage uncertainty and characterizes switching behaviour.

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

In this article, penalized likelihood approaches are proposed to handle variable selection problems, and it is shown that the newly proposed estimators perform as well as the oracle procedure in variable selection; namely, they work as well if the correct submodel were known.

Hidden physics models: Machine learning of nonlinear partial differential equations

Discovering governing equations from data by sparse identification of nonlinear dynamical systems

This work develops a novel framework to discover governing equations underlying a dynamical system simply from data measurements, leveraging advances in sparsity techniques and machine learning and using sparse regression to determine the fewest terms in the dynamic governing equations required to accurately represent the data.

Parameter Estimation of Partial Differential Equation Models

Simulation studies show that the Bayesian method and parameter cascading method are comparable, and both outperform other available methods in terms of estimation accuracy.
...