- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The proposed paper introduces GeoLAMP, a model designed to approximate PDE solution on irregular grids and complex domain. The model is composed of two components: an encoder-decoder based on graph and extracting local and global features, and a flow matching model to performs time stepping. Beyond the model, the paper introduces some datasets with complex geometries. The paper first introduces the model and its different components, and then different experiments are displayed to evaluate the method.
Critical strengths
- The paper is well-writtten and easy to follow
- Each component is clearly introduced and illustrated
- The paper also proposes 3 new datasets for the targeted problem
Critical weaknesses
- A major concern I have is that main references of the litterature are missing. The idea of making autoregressive steps in a compressed latent space is not new and it has already been proposed in other papers in the past years. Could you comment on the line of works from Kassai et al (ENMA and ECHO [2, 3]) that explored directly the same model structures ? (auto encoder on irregular grid with a time stepping task performs in the compressed latent space using diffusion methods or flow matching)
- As a result, the main experiment table does not display any recent baselines. While I acknowledge that very recent models can be difficult to spot and reproduce, a two year gap is quite long in the literature (the most recent baseline is Transolver from 2024, why not considering Transolver ++ [1] instead ?). This makes the claim regarding recent baselines comparison not fully demonstrated (line 326).
- Finally, the novelty of the model is not clear for me or marginal as it relies on a small brick of the encoder.
[1] Transolver++: An Accurate Neural Solver for PDEs on Million-Scale Geometries. Huakun Luo, Haixu Wu, Hang Zhou, Lanxiang Xing, Yichen Di, Jianmin Wang, Mingsheng Long. 2025
[2] ENMA: Tokenwise Autoregression for Generative Neural PDE Operators. Armand Kassaï Koupaï, Lise Le Boudec, Louis Serrano, Patrick Gallinari, 2025.
[3] Efficient Generative Transformer Operators For Million-Point PDEs. Armand Kassaï Koupaï, Lise Le Boudec, Patrick Gallinari. 2025.
Questions for authors
- Regarding W2, could you compare to more recent model of the literature ?
- Can you comment on the computational cost of the method ? (memory requirement, training time, inference latency). As the encoder involves computing the distance matrix (in my understanding) in the Global encoder, this operation can be very costly in terms of memory requirements (table 5).
- Have you trained the model on each dataset separately or all together in a multi physics setting ?
Dear Authors, Without any rebuttal provided to answer to my review, I keep my score unchanged.