- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces an approach for solving ill-posed partial differential equation inverse problems. The authors propose to learn an observation-complementary latent representation that preserves reconstruction relevant information for inverse reconstruction. The setup consists of a physics-aware autoencoder and a conditional Flow Matching part. The physics-aware autoencoder is trained to learn a forward response predictor. The decoder part combines the observations with the latent representation. After training of the autoencoder, conditional Flow Matching learns to generate latent codes from Gaussian noise conditioned on the observations. Once trained, the autoencoder and Flow Matching can be combined for fine-scale reconstruction.
Critical strengths
The paper proposes a combination of autoencoders and flow matching for solving ill-posed PDE inverse problems.
Critical weaknesses
- It is not quite clear to me why the authors did not use a conditional variational autoencoder rather than the proposed autoencoder. Forcing the encoder to predict both an observation and a latent representation seems unnecessary if the observation can be passed as a condition to both the encoder and decoder like in the standard conditional variational autoencoder architecture.
- In the related work section, the authors state quite a few related methods for solving PDE inverse problems. In the experimental section, however, their approach is only compared to two previous works for the Darcy flow problem with a continuous coefficient and coarse observations.
Questions for authors
- Please can you specify how the known query in Figure 1 is incorporated into the autoencoder? The textual description does not match up with the Figure here.
- The loss function in Equation 5 is only partly defined. Please can you specify how is defined similar to how you defined the other three loss terms?
- In your experiments you empirically show the importance of the latent. Can you show why learning both the observation and latent is required rather than just training a standard conditional variational autoencoder where the encoder maps the unknown field x observation to a latent space?
3 comments
W2. Baseline comparisons for continuous Darcy flow
Reviewer comment
In the related work section, the authors state quite a few related methods for solving PDE inverse problems. In the experimental section, however, their approach is only compared to two previous works for the Darcy flow problem with a continuous coefficient and coarse observations.
Response
Our experiments focus on the backward Allen–Cahn problem and also evaluate coefficient recovery in Darcy flow with both binary and continuous coefficients. We added DPS [1], DiffusionPDE [2], and FunDPS [3] as baselines for recovering continuous coefficient from coarse pressure observations. DiffusionPDE and FunDPS are supervised baselines, both are trained with 1,000 numerical coefficient–pressure pairs. OCL-PDE achieved the smallest reconstruction error among the four methods at both noise levels (Table 1). We will add these results to the Experiments section of the revised manuscript.
Table 1. GRF Darcy flow reconstruction before refinement. Entries are mean relative errors (%) of the permeability estimates, averaged over 64 test fields. Each estimate averages 16 posterior samples. Half of the pressure observations are clean anchors.
| Method | 1% pressure noise | 3% pressure noise |
|---|---|---|
| DPS | 11.29 | 11.58 |
| DiffusionPDE | 39.97 | 39.21 |
| FunDPS | 14.80 | 15.05 |
| OCL-PDE (ours) | 3.44 | 5.21 |
Q1. The known query in Figure 1
Reviewer comment
Please can you specify how the known query in Figure 1 is incorporated into the autoencoder? The textual description does not match up with the Figure here.
Response
The known query enters the autoencoder as coordinate channels. In Allen–Cahn, gives the spatial coordinates on the grid, and is a single physical time shared by all grid points. We repeat across the grid to form the three-channel query map . The encoder uses the initial field and this query map to predict the PDE response . The decoder uses the response, the same query map, and the latent variable to reconstruct . Equations (2) and (4) omit the query inputs for brevity.
Q2. The latent regularizer in Equation 5
Reviewer comment
The loss function in Equation 5 is only partly defined. Please can you specify how is defined similar to how you defined the other three loss terms?
Response
Following the VAE formulation of Kingma and Welling (2014) [4], is the KL divergence from the encoder's diagonal Gaussian to , averaged over latent components and training samples. Here latent variable . Appendix A.2, Eq. (16) of the submitted paper gives its explicit form:
\bigl(\mu_i^2+\sigma_i^2-\log\sigma_i^2-1\bigr)\right],$$ where $\mu_i$ and $\sigma_i$ are the encoder output mean and standard deviation for latent component $i$ given the training field $c$. Note that, in OCL-PDE, the KL term, weighted by $\lambda_{\rm reg}=10^{-4}$, serves only as a regularizer on the means and variances of the latents distributions. Thus, the latent distribution generally does not equal a standard Gaussian. This term helps keep the latent on a consistent scale. We therefore use a separate conditional flow matching [5] to learn the latent distribution. In the revised Methodology section, we will give the explicit formula for $L_{\rm reg}$ alongside the other loss terms in Eq(5). **References** [1] Chung et al., [Diffusion Posterior Sampling for General Noisy Inverse Problems](https://arxiv.org/abs/2209.14687), ICLR 2023. [2] Huang et al., [DiffusionPDE: Generative PDE-Solving under Partial Observation](https://proceedings.neurips.cc/paper_files/paper/2024/hash/eb3878c1dcbfff9ee95d5d033e5f5942-Abstract-Conference.html), NeurIPS 2024. [3] Yao et al., [Guided Diffusion Sampling on Function Spaces with Applications to PDEs](https://proceedings.neurips.cc/paper_files/paper/2025/hash/b8a28baaa25cebfa9345a8a2edf7f19d-Abstract-Conference.html), NeurIPS 2025. [4] Kingma and Welling, [Auto-Encoding Variational Bayes](https://arxiv.org/abs/1312.6114), ICLR 2014. [5] Lipman et al., [Flow Matching for Generative Modeling](https://arxiv.org/abs/2210.02747), ICLR 2023. Liu et al., [Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow](https://arxiv.org/abs/2209.03003), arXiv 2022.Dear authors,
thank you very much for the rebuttal. Because of the very limited time until the end of the author-reviewer discussion period, I unfortunately won't be able to go through the rebuttal in detail before the deadline. I will however consider the rebuttal in the upcoming discussion period with the AC.
We thank the reviewer for reviewing our manuscript and for providing insightful and constructive comments.
W1 / Q3. The proposed autoencoder and the CVAE alternative
W1
Q3
Response
In OCL-PDE, the autoencoder learns an observation-complementary latent representation z for reconstruction. The encoder-produced latent z do not generally follow a standard Gaussian distribution, so we learn a separate model to sample from it. For this separate model, we use conditional Flow Matching to transform standard Gaussian noise into latent samples suited to the observation y.
We interpret the standard conditional variational autoencoder mentioned by the reviewer as the model introduced by Sohn et al. (2015) [1] in Learning Structured Output Representation using Deep Conditional Generative Models, hereafter referred to as CVAE.
First, we use two encoder outputs to encourage the latnt z to complement the observation y. The latent z is trained to capture features of c that are difficult to recover from y alone. As in residual learning [2], starting from an observation-based reconstruction lets the latent focus on correcting the details that the initial reconstruction misses, which can improve reconstruction accuracy. A CVAE encoder only outputs the latent, and do not have this explicit incentive to learn a complementary latent representation. In terms of encoder inputs and outputs, the distinction is
\qquad E_{\mathrm{CVAE}}(c,y)=z,$$ Second, we separate learning the latent representation from learning how to generate it. We first train the autoencoder to learn a latent representation $z$ of the unknown field $c$. We then freeze the autoencoder and train a conditional flow on the encoder-produced latent. This allows the flow to learn how to generate $z$ given $y$ while preserving the representation of $c$ learned in the first stage. A standard CVAE instead jointly learns the recognition model $q_\phi(z\mid c,y)$ and the conditional prior $p_\eta(z\mid y)$ through $D_{\rm KL}\\!\left(q_\phi(z\mid c,y)\\,\\|\\,p_\eta(z\mid y)\right)$ term. CVAE use this coupling to train the model, which may encourage $z$ to depend mainly on $y$, retaining less information about $c$ beyond what the observation already provides. Third, OCL-PDE is a framework which solves both the forward and inverse problems. Our encoder serves as a forward solver, predicting the PDE response from the input field $c$. This is also useful when numerical field–response pairs are scarce. We can sample coefficient or initial-state fields and use the encoder's predicted PDE responses to train the decoder and conditional flow without additional numerical solves. The Binary Darcy topology figure shows distinct Binary Darcy reconstructions generated by OCL-PDE for the same pressure observations. **Binary Darcy topology figure (for the revised manuscript).** Binary Darcy at 5% pressure observations. Each row shows the reference and the first four draws in generation order. The titles report relative pressure observation errors and Betti numbers $(\beta_0,\beta_1)$, which count connected components and holes in the high-permeability phase. **References** [1] [Sohn et al., Learning Structured Output Representation using Deep Conditional Generative Models, NeurIPS 2015](https://proceedings.neurips.cc/paper_files/paper/2015/hash/8d55a249e6baa5c06772297520da2051-Abstract.html). [2] He et al., [Deep Residual Learning for Image Recognition](https://arxiv.org/abs/1512.03385), CVPR 2016.