1. The DCGD-specific motivation rests on an incorrect geometric condition.
Section 4.1 claims that DCGD requires non-conflicting gradients or a restricted gradient-norm ratio.
This misstates Theorem 4.2 of DCGD [1].
That theorem characterizes when the unmodified sum of two gradients belongs to their dual cone.
It is not a prerequisite for DCGD to construct a common-descent direction.
Consider
gr=(10,0),gb=(−3,4).
Then R=∥gr∥/∥gb∥=2 and cosϕ=−0.6.
The paper's stated condition fails: 2>−1/cosϕ=5/3.
Indeed, the raw sum gr+gb=(7,4) conflicts with gb, since gb⊤(gr+gb)=−5.
Yet the DCGD (Center) rule [1] gives
v&=\frac{g_r}{\|g_r\|}+\frac{g_b}{\|g_b\|}=(0.4,0.8),\\
d&=\frac{(g_r+g_b)^\top v}{\|v\|^2}v=(3,6),\\
g_r^\top d&=30>0,\qquad g_b^\top d=15>0.
\end{aligned}$$
Thus, the stated condition can fail while DCGD still constructs a direction that decreases both losses to first order.
This reveals a fundamental misinterpretation of DCGD's geometric conditions.
The authors should revisit the original DCGD analysis and correct their theoretical motivation accordingly.
More generally, collocation-dependent gradients arise under any sample-based optimizer.
**2. The bi-level objective is ambiguous and admits degenerate interpretations.**
Equation (11) minimizes $\mathbb E_{S_t\sim\pi}[L(\theta_T)]$, but does not specify the measure defining $L(\theta_T)$.
Eqs. (3)–(6) instead define losses using policy-dependent collocation points.
If $L$ is the resulting empirical loss, the formulation can admit degenerate policies that leave physical constraints unobserved.
Consider
$$-u''(x)=\pi^2\sin(\pi x),\quad x\in(0,1),\qquad u(0)=u(1)=0,$$
with $u_\theta(x)=\sin(\pi x)+\theta x^2(x-\frac32)$.
Its PDE residual is $r_\theta(x)=\theta(3-6x)$.
A policy concentrating interior samples at $x_r=1/2$ and boundary samples at $x_b=0$ gives
$$r_\theta(1/2)=0,\qquad u_\theta(0)=0
\quad\text{for every }\theta.$$
Thus $L(\theta)=0$ for every $\theta$.
Yet $r_\theta$ is nonzero away from $x_r=1/2$, and $u_\theta(1)=-\theta/2$ violates the unsampled boundary condition when $\theta\ne0$.
Both loss components are sampled, but the empirical objective becomes trivial.
This example exposes a degeneracy in the empirical-loss interpretation.
Equation (11) does not specify restrictions on $\Pi_{\mathrm{prog}}$ sufficient to exclude concentrated sampling policies.
If $L$ instead denotes a fixed continuum loss, its measure and relation to the sampled objectives must be defined.
The implemented outer search instead ranks policies by relative $L^2$ error against a reference solution, rather than by the objective in Eq. (11).
In most forward PDE problems, the solution is precisely the unknown quantity that the solver is intended to recover.
Computing this ranking score therefore requires an oracle (reference solution).
Without such information, the proposed sampler-selection procedure cannot be applied as described.
**3. The two-objective reduction hides conflicts among physical constraints.**
Equation (7) aggregates all non-residual constraints into $g_c=\sum_j\lambda_j g_{c,j}$.
DCGD then operates only on $(g_r,g_c)$.
A common-descent direction for these two gradients need not decrease each individual constraint.
Conflicts among boundary and initial-condition losses can cancel in the aggregate.
ConFIG [2] and HARMONIC [3] address individual loss gradients, but lines 186–187 mention their use only as a possible extension.
The proposed method does not perform this extension.
Moreover, Eq. (7) introduces individual constraint losses without defining their collocation sets, sampling distributions, or how their weights are determined.
The sampling formulation is therefore incomplete for PINNs with multiple independently enforced physical constraints.
**4. The methodological distinction is unclear, and the exposition obscures it.**
The manuscript describe CoDyS as an *optimizer-conditioned program search* that *shapes* the empirical loss landscape.
The concrete operation is to change sampled points and thereby change the finite-sample loss.
That dependence is elementary and is not unique to geometry-aware optimization.
The remaining construction is a generator–critic search over executable sampling programs, using an existing agent-design pattern.
The manuscript does not identify a DCGD-specific property of the search rule or a distinct mathematical principle behind the program representation.
The text repeatedly defines the contribution by exclusion.
Similar qualifications appear in lines 124–132, 168–170, 213–215, 248–252, and 285–287.
Section 4.1 also repeats the PINN objective and sampling dependence established earlier.
In particular, saying that a property is *not a theorem* or that a method does *not* smooth the global landscape does not explain what mechanism the proposed search establishes.
The relationship between the cited generator–critic pattern, the proposed search space, and the DCGD-specific contribution needs a direct and precise account.
**References**
[1] Hwang et al., "Dual Cone Gradient Descent for Training Physics-Informed Neural Networks". NeurIPS 2024.
[2] Liu et al., "ConFIG: Towards Conflict-free Training of Physics Informed Neural Networks". ICLR 2025.
[3] Bu et al., "Harmonized Cone for Feasible and Non-conflict Directions in Training Physics-Informed Neural Networks". ICLR 2026.