- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a simulation-free diffusion-based learning framework for semilinear PDEs.
Using an integral residual derived from It^o's formula, the authors construct training paths through explicitly sampled Gaussian processes and endpoint-conditioned Brownian bridges.
The main algorithmic contribution is a boundary-anchored sampling strategy that incorporates boundary values directly into the interior training loss, together with geometric routing and chained bridges.
Experiments on perforated domains, metastable committor problems, and a high-dimensional HJB equation demonstrate promising computational performance compared with existing PINN, BSDE, and diffusion-based methods.
Critical strengths
- Meaningful algorithmic novelty.
The combination of explicitly sampled Gaussian bridges, prescribed boundary endpoints, and geometric path routing provides a useful training strategy for challenging PDEs. Although the stochastic tools are classical, the overall algorithmic construction has independent value.
- Well-motivated boundary treatment.
Incorporating known boundary values directly into the interior residual is particularly appealing for problems with complicated geometries or multiple boundary components.
Critical weaknesses
- Insufficient justification of boundary-sampling consistency.
The authors acknowledge that a Brownian bridge may leave the domain before reaching its prescribed boundary endpoint and propose anchor placement, node rejection, and truncation as remedies.
However, node rejection only constrains sampled grid points. It neither guarantees that the continuous path remains inside the domain nor preserves the original Gaussian bridge law.
Since the residual representation requires appropriate domain conditions, the consistency of the implemented boundary-handling procedure with the target Dirichlet PDE remains insufficiently established.
The reported low node-freezing rate does not quantify the resulting approximation bias.
This does not prove that the algorithm fails, but it leaves an important gap between the theoretical representation and the implemented method.
- Inconsistency in the perforated-square PDE.
Appendix D.2 specifies
\qquad h(x,v,z)=\frac{1}{2}\left(\lVert z\rVert^2-q(x)\right),$$ where $$z=\sigma^\top\nabla V, \qquad q(x)=\lVert\nabla V^\star(x)\rVert^2, \qquad \Delta V^\star=0.$$ These expressions imply $$\mathcal{L}V^\star +h(x,V^\star,\sigma^\top\nabla V^\star) =\frac{1}{2}q(x),$$ which is generally nonzero. The written driver is therefore inconsistent with the stated analytical reference solution. This may be a manuscript error rather than an implementation error. Nevertheless, clarification is essential because this experiment provides important evidence for the proposed boundary-coupling mechanism.Questions for authors
Q1. Boundary-sampling consistency.
Can the authors justify that the implemented boundary-anchored sampling procedure remains consistent with the original Dirichlet PDE?
In particular, can they quantify the effect of early boundary crossings and node rejection through a suitable consistency argument or a targeted numerical study?
A comparison across bridge discretizations or boundary-handling strategies would be informative.
Q2. Perforated-square implementation.
What is the exact nonlinear driver used in the perforated-square implementation?
Can the authors verify that the analytical reference solution satisfies the PDE corresponding to the implemented training loss?
An explicit formula and a short residual calculation or implementation excerpt would resolve this concern.
6 comments
Follow-up on Boundary Sampling in the Committor Experiment
Thank you for the additional analysis and experiments. I understand that Remark B.6 establishes the residual identity for an ideal reflected bridge under suitable assumptions, while the convergence of the implemented per-node rejection scheme to such a process is not formally established.
My remaining question concerns the committor experiment specifically. Since the Gaussian bridges are anchored on or , could the authors clarify whether they can provide a consistency argument, or a bound on the effect of node rejection and freezing, for the discrete loss used in this experiment? In particular, under what conditions would refining the time grid preserve the true committor as a zero-loss solution in the limit?
If a formal result is outside the scope of this revision, a limited grid-refinement or boundary-handling comparison on one representative committor instance would also help assess the practical effect.
Thank you for the follow-up question. We agree with your summary of Remark B.6. Below, we first clarify how the committor experiment handles the absorbing sets and then answer your question for the continuous objective and for the discrete loss. Changes since our previous revision are marked in red.
Boundary handling in the committor experiment. This experiment uses neither node rejection nor freezing. Each chained bridge is stopped at its first node in , and the exit residual evaluates at that node. Since equals on all of and on all of , this is the exact boundary value of the set in which that node lies. Detecting also the entries between two nodes, with a crossing test, changes the loss at the reference committor by less than 1% (next comment). We now state this explicitly in App. D.3.
Continuous objective. The continuous counterpart of this sampler is the chained Gaussian bridge stopped at its first exit from , with evaluated at the exit point, i.e., the stopped construction of Def. B.3. Its terminal anchor lies on , but the path may leave before reaching it. The proof of Prop. 2.4 needs only the weaker requirement of Remark B.6, for every , which this law satisfies: given that the path has not left by , its law on is the Gaussian bridge conditioned on staying in , whose support is given by Lemma B.5, and in the elliptic case Step 3 needs only . A new paragraph at the end of Remark B.6 states this. Hence, for isotropic , smooth and , and a boundary term with full support, a function has zero continuous loss if and only if it solves the committor equation.
Discrete loss. Each chained bridge ends at its terminal anchor on or , so a path that stays in until then needs no exit detection. Truncation matters only for paths that enter earlier, and the implemented loss detects such an entry only at the nodes. It therefore misses entries between nodes and places the final node of a truncated path up to one step inside , the bias of exit times that are monitored only at discrete times; in the interior, the time discretization adds the term of Prop. C.1. A formal convergence result for the discrete objective is outside the scope of this revision. As you suggest, we instead report a grid-refinement and boundary-handling study on the committor instance of Sec. 3.2 (next comment).
Thank you for the careful reading, for checking the driver, and for recognizing the algorithmic value of anchoring the bridges on the boundary.
W1/Q1: boundary-sampling consistency. Reviewer Sjqj raised this too (see W4 there); in short:
The table gives the relative L2 error after training at the paper's budget, as the mean over 3 seeds:
W2/Q2: driver. You are right that the formula in App. D.2 is inconsistent. It is a typo in the paper; the code and the reference solution agree. Like the main-text PDE (25), the implementation uses the raw gradient:
h(x,v,∇V)=λ(∥∇V∥2−q),i.e.h(x,v,z)=λ(∥z∥2/σ2−q) for z=σ⊤∇V,
with λ=21 and σ2=2, so the generator is Δ. Since ΔV⋆=0 and q=∥∇V⋆∥2, the residual at V⋆ is 0+21(q−q)=0.
We evaluated the implemented residual 2σ2ΔV⋆+h(x,V⋆,∇V⋆) in float64 at 20,000 uniform points of Ω. Its absolute value is at most 1.8⋅10−12 for N=16,36,64,144. The formula as printed leaves q/2, as you computed. The revision corrects App. D.2, including the typo "L=Δt", which should read L=Δ.
Thank you again for your review. Your check of the driver and your question on boundary sampling led to the corrected App. D.2 and to the new analysis of rejection in App. C.3, and they have significantly improved the manuscript. Please let us know whether this resolves your concerns about boundary sampling, or whether you have further questions. We would be glad to discuss them.