Data-driven sparse identification of governing PDEs via knockoff filters and multi-criteria trade-offs

• URL: http://arxiv.org/abs/2605.26631v1
• Date: Tue, 26 May 2026 07:07:23 GMT
• Title: Data-driven sparse identification of governing PDEs via knockoff filters and multi-criteria trade-offs
• Abstract summary: KO-PDE-IDENT is a framework for identifying parsimonious partial differential equations (PDEs) with false discovery rate (FDR) control.<n>To address this problem, KO-PDE-IDENT initially mines a support set of potential candidate terms via model-X knockoff filters.<n>We validate KO-PDE-IDENT on five canonical PDEs under severe noise corruption.
• Score: 4.876446735726356
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose KO-PDE-IDENT, a data-driven framework for identifying parsimonious partial differential equations (PDEs) with false discovery rate (FDR) control. PDE discovery from noisy observations is often hindered by extreme multicollinearity among candidate terms, which causes typical sparse-regression methods to select spurious terms. To address this problem, KO-PDE-IDENT initially mines a support set of potential candidate terms via model-X knockoff filters with finite-sample FDR control, then refines and ranks the surviving PDE alternatives. The framework integrates three components. First, knockoff feature statistics are constructed by coupling $\ell_{0}$-constrained adaptive best-subset selection with SHapley Additive exPlanations (SHAP), yielding an effective and computationally efficient difference statistic. Second, a recursive feature elimination (RFE) procedure removes terms whose marginal contributions are dispensable and assesses statistical necessity through knockoff-perturbed hypothesis testing. Third, the final model selection is formulated as a multi-criteria decision-making (MCDM) problem, where the optimal governing equation is the alternative that best balances a wide range of criteria such as predictive accuracy, model complexity and coefficient uncertainty. We validate KO-PDE-IDENT on five canonical PDEs under severe noise corruption. Empirical results show that our framework can exactly recover the true PDE structure, eliminating false discoveries while retaining all true underlying terms, with low coefficient estimation error.

Related papers

• Guided Flow Matching for Forward and Inverse PDE Problems with Sparse Observations: Algorithm and Theory [2.148615003900331]
  We present FM4PDE, a flow-matching generative framework that learns the joint distribution of PDE coefficients.<n>Experiments on static and time-dependent benchmark PDEs demonstrate competitive accuracy and faster inference than diffusion-based generative models.
  arXiv  Detail & Related papers  (2026-05-25T07:14:11Z)
• DISA: Offline Importance Sampling for Distribution-Matching LLM-RL [56.9445657766829]
  We introduce DISA, which moves this calibration problem outside the RL loop.<n> DISA draws proposal trajectories offline, estimates the partition function via importance sampling, and freezes the resulting partition-function estimate.<n>On two open-weight backbones across six math and three code benchmarks, DISA matches or exceeds the online-coupled distribution-matching baseline Flow.
  arXiv  Detail & Related papers  (2026-05-17T07:14:44Z)
• A Randomized PDE Energy driven Iterative Framework for Efficient and Stable PDE Solutions [3.005135324395161]
  Partial differential equations (PDEs) are central to scientific and engineering applications.<n>Existing numerical solvers rely heavily on matrix based discretizations.<n>We propose a PDE energy driven framework that solves PDEs through physically constrained diffusion iterations.
  arXiv  Detail & Related papers  (2026-04-17T06:53:03Z)
• Weak-PDE-Net: Discovering Open-Form PDEs via Differentiable Symbolic Networks and Weak Formulation [10.638660239419636]
  Weak-PDE-Net is an end-to-end differentiable framework that can robustly identify open-form PDEs.<n>Experiments on several challenging PDE benchmarks demonstrate that Weak-PDE-Net accurately recovers governing equations, even under highly sparse and noisy observations.
  arXiv  Detail & Related papers  (2026-03-24T08:47:01Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Guided Diffusion Sampling on Function Spaces with Applications to PDEs [112.09025802445329]
  We propose a general framework for conditional sampling in PDE-based inverse problems.<n>This is accomplished by a function-space diffusion model and plug-and-play guidance for conditioning.<n>Our method achieves an average 32% accuracy improvement over state-of-the-art fixed-resolution diffusion baselines.
  arXiv  Detail & Related papers  (2025-05-22T17:58:12Z)
• Adaptation of uncertainty-penalized Bayesian information criterion for parametric partial differential equation discovery [1.1049608786515839]
  We introduce an extension of the uncertainty-penalized Bayesian information criterion (UBIC) to solve parametric PDE discovery problems efficiently. UBIC uses quantified PDE uncertainty over different temporal or spatial points to prevent overfitting in model selection. We show that our extended UBIC can identify the true number of terms and their varying coefficients accurately, even in the presence of noise.
  arXiv  Detail & Related papers  (2024-08-15T12:10:50Z)
• Unisolver: PDE-Conditional Transformers Towards Universal Neural PDE Solvers [53.79279286773326]
  We present Unisolver, a novel Transformer model trained on diverse data and conditioned on diverse PDEs.<n>Unisolver achieves consistent state-of-the-art on three challenging large-scale benchmarks, showing impressive performance and generalizability.
  arXiv  Detail & Related papers  (2024-05-27T15:34:35Z)
• Deep Equilibrium Based Neural Operators for Steady-State PDEs [100.88355782126098]
  We study the benefits of weight-tied neural network architectures for steady-state PDEs. We propose FNO-DEQ, a deep equilibrium variant of the FNO architecture that directly solves for the solution of a steady-state PDE.
  arXiv  Detail & Related papers  (2023-11-30T22:34:57Z)
• Adaptive Uncertainty-Guided Model Selection for Data-Driven PDE Discovery [3.065513003860786]
  We propose a new parameter-adaptive uncertainty-penalized Bayesian information criterion (UBIC) to prioritize the parsimonious partial differential equation (PDE) We numerically affirm the successful application of the UBIC in identifying the true governing PDE. We reveal an interesting effect of denoising the observed data on improving the trade-off between the BIC score and model complexity.
  arXiv  Detail & Related papers  (2023-08-20T14:36:45Z)
• Error-based Knockoffs Inference for Controlled Feature Selection [49.99321384855201]
  We propose an error-based knockoff inference method by integrating the knockoff features, the error-based feature importance statistics, and the stepdown procedure together. The proposed inference procedure does not require specifying a regression model and can handle feature selection with theoretical guarantees.
  arXiv  Detail & Related papers  (2022-03-09T01:55:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.