Stable PDE-Informed Neural Networks for Inverse Problems
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
Source question. For convolutional neural networks used in inverse problems, determine whether suitably discretized partial differential equation (PDE) motivated networks enforce stability, and determine how explicit prior knowledge and constraints should be incorporated.Possible mathematical framework, with unresolved specifications. An inverse problem may be represented by a forward map $F:X\to Y$, where $X$ is a space of unknowns and $Y$ is a space of observations. A reconstruction network is a map $R_\theta:Y\to X$, with parameters $\theta$. These symbols provide a framework for explaining the question; the source does not specify the spaces, the forward map, the network family, or the admissible parameters.
For example, if metrics $d_X$ and $d_Y$ are specified and stability means Lipschitz stability with respect to observation perturbations on an admissible set $D\subseteq Y$, the corresponding property would be \[ \exists C<\infty\quad\forall y,y'\in D,\qquad d_X\left(R_\theta(y),R_\theta(y')\right)\le C\,d_Y(y,y'). \] This is only a possible interpretation of stability, not a condition selected or asserted by the source. In particular, the source does not specify whether such a constant must be uniform over network parameters, depth, discretization resolution, or other choices, or whether stability instead concerns numerical evolution, training, or another notion.
Unresolved formulation. The requested investigation is to identify PDE models, discretizations, architectural conditions, and ways of incorporating prior knowledge and constraints that yield the intended stability for reconstruction networks. No particular PDE, initial or boundary conditions, discretization rule, stability notion, class of priors, or constraint enforcement mechanism is supplied. Consequently, the record states a research question but does not determine a unique quantified mathematical conjecture. These missing specifications must be resolved before a precise theorem or conjecture can be extracted.
Short English statement
The question asks when convolutional reconstruction networks motivated by discretized PDEs are stable, and how prior knowledge and constraints should enter their construction. The supplied record leaves the meaning and scope of stability unspecified, so it does not determine a unique mathematical conjecture.Sources
- Supplied local UnsolvedMath registry record, permanent ID $30003748$, source problem code
catalogue entry, title: Stable PDE-Informed Neural Networks for Inverse Problems. Collection: Oberwolfach Reports Open Problems. No individual proposer is identified. The proposed year is recorded as 2018. - Supplied report citation: Mini-Workshop: Deep Learning and Inverse Problems (2019), Oberwolfach Reports, pp. 559--589, DOI 10.4171/owr/2018/11. Supplied source URL: https://doi.org/10.4171/owr/2018/11. The citation's 2019 designation differs from the recorded proposed year and the year appearing in the DOI; this discrepancy is unresolved.
- Supplied literature reference: Oberwolfach Report 11, https://doi.org/10.4171/OWR/2018/11.
- Supplied literature reference: Stable architectures, https://arxiv.org/abs/1705.03341.
- Supplied literature reference: Convex and ODE stability, https://www.sciencedirect.com/science/article/pii/S0167278924001106.
- Literature assessment dated exactly
2026-08-21: the supplied curation labels the problem open and reports that provably stable PDE-inspired architectures and conditional analyses exist, while the broad stability conjecture and its general mathematical formulation remain unresolved. This is supplied dated literature triage derived from the OWR curation, not an independently verified assessment. The record expressly requests independent verification of time-sensitive status and cited claims. - The registry labels the statement
corrected_verifiedand reports a manual semantic, typographic, and LaTeX review asserting that its clean statement is self-contained and preserves the mathematical target without unsupported additions. This is supplied review metadata, not independent mathematical verification of this draft or resolution of its formulation ambiguities.
Statement licence: CC-BY-SA-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.