Data-Driven, ML-assisted Approaches to Problem Well-Posedness

• URL: http://arxiv.org/abs/2503.19255v1
• Date: Tue, 25 Mar 2025 01:34:48 GMT
• Title: Data-Driven, ML-assisted Approaches to Problem Well-Posedness
• Abstract summary: We show how standard tools from machine and manifold learning can be used to infer, in a data driven manner, certain well-posedness features of differential equation problems.<n>Our study naturally combines a data assimilation perspective with an operator-learning one.
• Score: 10.544250336831595
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classically, to solve differential equation problems, it is necessary to specify sufficient initial and/or boundary conditions so as to allow the existence of a unique solution. Well-posedness of differential equation problems thus involves studying the existence and uniqueness of solutions, and their dependence to such pre-specified conditions. However, in part due to mathematical necessity, these conditions are usually specified "to arbitrary precision" only on (appropriate portions of) the boundary of the space-time domain. This does not mirror how data acquisition is performed in realistic situations, where one may observe entire "patches" of solution data at arbitrary space-time locations; alternatively one might have access to more than one solutions stemming from the same differential operator. In our short work, we demonstrate how standard tools from machine and manifold learning can be used to infer, in a data driven manner, certain well-posedness features of differential equation problems, for initial/boundary condition combinations under which rigorous existence/uniqueness theorems are not known. Our study naturally combines a data assimilation perspective with an operator-learning one.

Related papers

• Recovering Governing Equations from Solution Data: Identifiability Bounds for Linear and Nonlinear ODEs [1.360738859820932]
  We introduce the Hausdorff distance on solution sets as the natural metric for comparing differential equations.<n>We establish identifiability bounds for governing ODEs across a wide class of structure equations.<n>We derive metric entropy estimates for the relevant ODE classes and analyze sample complexity bounds.
  arXiv  Detail & Related papers  (2026-06-25T17:02:08Z)
• Operator learning on domain boundary through combining fundamental solution-based artificial data and boundary integral techniques [7.3529349900185395]
  For linear partial differential equations with known fundamental solutions, this work introduces a novel operator learning framework.<n>It relies exclusively on domain boundary data, including solution values and normal derivatives, rather than full-domain sampling.<n>We refer to this approach as the Mathematical Artificial Data Boundary Neural Operator (MAD-BNO), which learns boundary-to-boundary mappings.
  arXiv  Detail & Related papers  (2026-01-16T12:00:52Z)
• Data-Driven Self-Supervised Learning for the Discovery of Solution Singularity for Partial Differential Equations [0.0]
  The appearance of singularities in the function of interest constitutes a fundamental challenge in scientific computing.<n>We propose a self-supervised learning framework for estimating the location of the singularity.<n>Various experiments are presented to demonstrate the ability of the proposed approach to deal with input perturbation, label corruption, and different kinds of singularities.
  arXiv  Detail & Related papers  (2025-06-29T17:39:41Z)
• Diffeomorphic Latent Neural Operators for Data-Efficient Learning of Solutions to Partial Differential Equations [5.308435208832696]
  A computed approximation of the solution operator to a system of partial differential equations (PDEs) is needed in various areas of science and engineering.<n>We propose that in order to learn a PDE solution operator that can generalize across multiple domains without needing to sample enough data expressive enough, we can train instead a latent neural operator on just a few ground truth solution fields.
  arXiv  Detail & Related papers  (2024-11-27T03:16:00Z)
• Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces [47.907236421762626]
  This work studies discrete-time discounted Markov decision processes with continuous state and action spaces. We first consider the case in which we have access to the entire expert policy and characterize the set of solutions to the inverse problem.
  arXiv  Detail & Related papers  (2024-05-24T12:53:07Z)
• Towards true discovery of the differential equations [57.089645396998506]
  Differential equation discovery is a machine learning subfield used to develop interpretable models. This paper explores the prerequisites and tools for independent equation discovery without expert input.
  arXiv  Detail & Related papers  (2023-08-09T12:03:12Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• Measuring dissimilarity with diffeomorphism invariance [94.02751799024684]
  We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces. We prove that DID enjoys properties which make it relevant for theoretical study and practical use.
  arXiv  Detail & Related papers  (2022-02-11T13:51:30Z)
• Feature Engineering with Regularity Structures [4.082216579462797]
  We investigate the use of models from the theory of regularity structures as features in machine learning tasks. We provide a flexible definition of a model feature vector associated to a space-time signal, along with two algorithms which illustrate ways in which these features can be combined with linear regression. We apply these algorithms in several numerical experiments designed to learn solutions to PDEs with a given forcing and boundary data.
  arXiv  Detail & Related papers  (2021-08-12T17:53:47Z)
• Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
  We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space. We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
  arXiv  Detail & Related papers  (2020-12-09T20:19:32Z)
• Learning To Solve Differential Equations Across Initial Conditions [12.66964917876272]
  A number of neural network-based partial differential equation solvers have been formulated which provide performances equivalent, and in some cases even superior, to classical solvers. In this work, we posit the problem of approximating the solution of a fixed partial differential equation for any arbitrary initial conditions as learning a conditional probability distribution.
  arXiv  Detail & Related papers  (2020-03-26T21:29:22Z)

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.