- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper develops an adaptation of the JEPA approach to learn an embedding of both the inputs and targets for PDE field reconstruction. Once a latent representation is learned, the authors use a decoder to make predictions of full fields from sparse observation locations. The proposed method performs well against the (specific) chosen benchmarks.
Critical strengths
The paper proposes a substantively new way of performing PDE inference -- attemtping to adapt JEPA-style approaches in a way I have not encountered before.
Critical weaknesses
-
My biggest concern is in Figure 3 and 4. The sparse observations which serve as the input are clearly numerous enough that a simple unstructured interpolation of the fields would be very good predictions for the full-field, yet the baseline comparisons shown completely fail this task. This leads me to believe these baselines are not appropriate comparisons. Furthermore, standard inverse problem methodology can be used for the inverse task this method is said to tackle, yet this is not included. Unless this is addressed, it is difficult to asses wheather the method is truly beneficial.
-
There is limited discussion of the experimental setup beyond discussion of the architectures themselves, can the experimental setup, the inference task itself, be more clearly discussed?
-
The lack of figures showing predictions of the full-field measurements makes it difficult to trust the output. The inferred fields are physically interpretable and should be included to help the reader asses the quality of inference.
Questions for authors
How was the decoder for prediction trained?
What would be the practical difference if one were to use an autoencoder (either VAE, standard AE, or sliced-Wasserstein/MMD AE)? Would these perform similarly?
Why was deterministic interpolation, or krigging, not compared against?