Sparsistent Model Discovery
Discovering the partial differential equations underlying spatio-temporal datasets from very limited and highly noisy 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. In this work, we show the design matrices used to infer the equations by sparse regression can violate the irrepresentability condition (IRC) of the Lasso, even when derived from analytical PDE solutions (i.e. without additional noise). Sparse regression techniques which can recover the true underlying model under violated IRC conditions are therefore required, leading to the introduction of the randomised adaptive Lasso. We show once the latter is integrated within the deep learning model discovery framework DeepMod, a wide variety of nonlinear and chaotic canonical PDEs can be recovered: (1) up to $\mathcal{O}(2)$ higher noise-to-sample ratios than state-of-the-art algorithms, (2) with a single set of hyperparameters, which paves the road towards truly automated model discovery.
Code (1)
Tasks
modelModel DiscoveryOpen-Ended Question AnsweringregressionVariable SelectionSimilar Papers 제목 키워드 기반
Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms
Sparse Principal Component Analysis (PCA) is a prevalent tool across a plethora of subfields of applied statistics. While several results have characterized the recovery error of the principal eigenvectors, these are typ…
Sparsistent Learning of Varying-coefficient Models with Structural Changes
To estimate the changing structure of a varying-coefficient varying-structure (VCVS) model remains an important and open problem in dynamic system modelling, which includes learning trajectories of stock prices, or…
Brain Computer InterfaceModel SelectionHigh-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions
We consider the problem of Ising and Gaussian graphical model selection given n i.i.d. samples from the model. We propose an efficient threshold-based algorithm for structure estimation based known as conditional mutu…
Model SelectionVocal Bursts Intensity PredictionSparsistent Estimation of Time-Varying Discrete Markov Random Fields
Network models have been popular for modeling and representing complex relationships and dependencies between observed variables. When data comes from a dynamic stochastic process, a single static network model cannot ad…
regressionTime SeriesTime Series AnalysisSparsistent filtering of comovement networks from high-dimensional data
Network filtering is an important form of dimension reduction to isolate the core constituents of large and interconnected complex systems. We introduce a new technique to filter large dimensional networks arising out of…
Dimensionality ReductionVocal Bursts Intensity Prediction