△ Mechanism confirmed, baseline not beaten 2026

Exact-boundary geometric PINN ansatz

Implementation & benchmark of arXiv:2607.28733 — A user's guide to PINNs in geometric analysis: lessons from the asymptotic Plateau problem

Usefulness7/10
Difficulty4/10
Novelty6/10

Source paper: A user's guide to PINNs in geometric analysis: lessons from the asymptotic Plateau problem arXiv:2607.28733 ⓘ · analyzed Aug 31, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Replace penalty enforcement of boundary and asymptotic conditions by a neural-network parametrization that satisfies them identically. For a disc mapped to hyperbolic half-space, construct the positive height coordinate with a vanishing boundary factor and construct tangential coordinates as a fixed boundary extension plus a vanishing correction.

Formulas

$$g_{\mathrm{hyp}}=X^{-2}\left(dX^{2}+|d\boldsymbol{Y}|^{2}\right),\qquad \partial\overline{\mathbb H}^{n+1}=\{X=0\}\cong\mathbb R^{n}.$$
$$u=(X,\boldsymbol{Y}):D^{2}\to\overline{\mathbb H}^{n+1},\qquad u|_{\partial D^{2}}=\gamma,\qquad \tau(u)=\operatorname{tr}_{u^{*}g_{\mathrm{hyp}}}\nabla du=0.$$
$$X_{\theta}(z)=(1-|z|^{2})\exp(a_{\theta}(z)),\qquad \boldsymbol{Y}_{\theta}(z)=E[\gamma](z)+(1-|z|^{2})b_{\theta}(z).$$
$$\mathcal L(\theta)=\frac{1}{N}\sum_{i=1}^{N}\left\|\tau\!\left(u_{\theta}(z_i)\right)\right\|_{2}^{2},\qquad g_{ab}(z)=X_{\theta}(z)^{-2}\sum_{\alpha}\partial_a u_{\theta}^{\alpha}(z)\partial_b u_{\theta}^{\alpha}(z).$$

Mathematical statement

The geometric problem uses the hyperbolic half-space metric $g_{\mathrm{hyp}}=X^{-2}(dX^{2}+|d\boldsymbol{Y}|^{2})$, whose ideal boundary is $X=0$. The unknown map is $u=(X,\boldsymbol{Y}):D^{2}\to\overline{\mathbb H}^{n+1}$ with $u|_{\partial D^{2}}=\gamma$, where $\gamma:S^{1}\to\mathbb R^{n}$ is prescribed and the interior should satisfy the vanishing tension equation $\tau(u)=\operatorname{tr}_{u^{*}g_{\mathrm{hyp}}}\nabla du=0$. Let $r=|z|$ be the disc radius, let $\rho(r)=1-r^{2}$, let $E[\gamma](z)$ be any fixed extension of the boundary curve into the disc satisfying $E[\gamma](e^{i\theta})=\gamma(e^{i\theta})$, and let $a_{\theta}(z)$ and $b_{\theta}(z)$ be unconstrained neural outputs. The adapted ansatz $X_{\theta}(z)=\rho(r)\exp(a_{\theta}(z))$ is strictly positive in the interior and exactly zero on the boundary, while $\boldsymbol{Y}_{\theta}(z)=E[\gamma](z)+\rho(r)b_{\theta}(z)$ exactly equals $\gamma$ on $\partial D^{2}$. The PDE residual can then use the pullback metric $g_{ab}=X^{-2}\sum_{\alpha}\partial_{a}u^{\alpha}\partial_{b}u^{\alpha}=X^{-2}(J^{\top}J)_{ab}$ and $R_{\theta}=\tau(u_{\theta})$ without boundary penalty terms.

Implementation notes

Integrate this at the output head of a PINN whose inputs are disc coordinates $z=(z_1,z_2)$ and whose raw outputs are one scalar $a_\theta(z)$ and one vector $b_\theta(z)\in\mathbb R^n$. Precompute a differentiable boundary extension $E[\gamma]$; for a closed planar curve, a simple choice is the harmonic or Fourier extension obtained by evaluating the truncated Fourier series of $\gamma(e^{i\phi})$. At every collocation point compute $\rho=1-z_1^2-z_2^2$, then set $X=\rho\exp(a)$ and $Y=E[\gamma](z)+\rho b$. Compute first and second derivatives of $(X,Y)$ with respect to $z$ and form the pullback metric $g=X^{-2}J^\top J$; invert the $2\times2$ matrix $g$ with a stable determinant clamp. Assemble the hyperbolic tension residual using $\tau^\alpha=g^{ab}(\partial_{ab}u^\alpha+\Gamma^\alpha_{\beta\gamma}(u)\partial_a u^\beta\partial_b u^\gamma-\Gamma^c_{ab}(g)\partial_cu^\alpha)$, or use the coordinate expression already implemented for the target PDE. Optimize only the mean squared residual, with no boundary loss and no separate positivity penalty. Compare against an unconstrained network trained with boundary and positivity penalties on a small hyperbolic minimal-disc problem. Check boundary error, minimum predicted $X$, residual loss, and convergence variance across random seeds; success means boundary error remains at machine precision while residual reaches the same or lower value with fewer optimization steps.

Verification

Mechanism confirmed, baseline not beaten

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Confirmed ✓

Stage 2 · Practical benchmark result: No measurable effect

Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works

Stage 1 — Mechanism check agent confidence 8/10

Built an exact-boundary PINN head with X=(1-|z|²)exp(a) and Y=E[gamma]+(1-|z|²)b, plus a matched penalty baseline and training experiment. The mechanism checks confirmed machine-precision boundary enforcement across raw-output scales, linear correction scaling with the vanishing factor (observed coefficient 3.25, predicted 3.25), and strict positivity of X. In the toy training problem, the exact ansatz reached residual MSE 4.5e-5–7.7e-5 versus 1.45e-2–1.72e-2 for the baseline, while eliminating boundary violations and negative X.

Agent confidence
8/10
Baseline
3 seeds: residual MSE 0.01450, 0.01723, 0.01688; boundary max 0.0219–0.0324; minimum X -0.0056 to -0.0171
Idea
3 seeds: residual MSE 5.49e-5, 7.74e-5, 4.52e-5; boundary max 1.19e-7; minimum X 0.0031–0.0197. Mechanism: rho-scaling coefficient 3.250000 versus predicted 3.25; boundary error 1.4e-17–4.4e-15 in float64 across scales 0.1–20; X stayed positive.

Limitations: The training comparison uses a small manufactured Laplacian residual proxy rather than the full hyperbolic harmonic-map tension equation and pullback Christoffel terms. It does not test complex target geometries, Fourier extensions beyond the simple identity boundary curve, larger networks, or equal-FLOP convergence curves; float32 training evaluation shows about 1e-7 boundary error due to coordinate arithmetic.

How to run: python3 run_experiment.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.28733)

Ahead of the baseline (−1.3%) but not statistically significant (p=0.7926, wins 5 / 8 paired seeds).

Benchmark
Poisson–Dirichlet process
Model
mlp_tiny
Paired seeds
8
Baseline mean
0.0002
Idea mean
0.0002
Effect (Δ)
-0 (−1.3%; negative = idea better)
Wins
5 / 8 paired seeds
p-value
0.7926 (permutation test, 20 000 shuffles)
Smallest detectable effect
±9.9%
Mechanism
Confirmed ✓
Practical effect
No effect
Baseline tuning
swept over 3 configs
Limitations:

The benchmark is a 1-D discrete Poisson/Dirichlet analogue, not the full 2-D hyperbolic harmonic-map tension equation with pullback metric and Christoffel terms. The implementation tests endpoint projection rather than continuous disc rho(z) exp(a) and E[gamma](z)+rho(z)b(z). Larger architectures, alternative geometries, longer budgets, and full PDE residual optimization were not tested.

How to run: python3 bench_exact_boundary.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Stage 2 — Benchmark latest Failed ✗

Agent confidence: 9/10

Implemented and evaluated an exact-boundary output projection on the structurally matched Poisson/Dirichlet benchmark with the shared mlp_tiny backbone and identical train_model settings. The mechanism signature was confirmed at trained-model scale: baseline endpoint max error was 0.0350982 while the idea was exactly 0.0. Test MSE improved slightly from 0.0001872611 to 0.0001847964, but the paired permutation p-value was 0.7926, so there was no significant win and worked=false.

Baseline
8-seed test MSE mean 0.0001872611, std 0.0000214104; tuned lr=0.01, epochs=24
Idea
8-seed test MSE mean 0.0001847964, std 0.0000293523; paired delta=-0.0000024647, p=0.7926, 5/8 wins; lr=0.01, epochs=24
Mechanism
trained baseline endpoint max abs=0.0350982; trained idea endpoint max abs=0.0; confirmed=true

Benchmark result

Ahead of the baseline (−1.3%) but not statistically significant (p=0.7926, wins 5 / 8 paired seeds).

Benchmark
Poisson–Dirichlet process
Model
mlp_tiny
Paired seeds
8
Baseline mean
0.0002
Idea mean
0.0002
Effect (Δ)
-0 (−1.3%; negative = idea better)
Wins
5 / 8 paired seeds
p-value
0.7926 (permutation test, 20 000 shuffles)
Smallest detectable effect
±9.9%
Mechanism
Confirmed ✓
Practical effect
No effect
Baseline tuning
swept over 3 configs
Limitations:

The benchmark is a 1-D discrete Poisson/Dirichlet analogue, not the full 2-D hyperbolic harmonic-map tension equation with pullback metric and Christoffel terms. The implementation tests endpoint projection rather than continuous disc rho(z) exp(a) and E[gamma](z)+rho(z)b(z). Larger architectures, alternative geometries, longer budgets, and full PDE residual optimization were not tested.

How to run: python3 bench_exact_boundary.py

Artifacts

Implementation overview ⬇ Download all as ZIP 7 files · code, reports and structured results