✓✓ Beats tuned baseline 2026

Fractional Boundary-Factored Neural Solver

Implementation & benchmark of arXiv:2607.02312 — The structure of solution spaces for fractional-order operators, with gradient estimates

Usefulness6/10

Difficulty4/10

Novelty7/10

Architecture Accuracy Stability Sample efficiency Mlp Loss Architecture Training Pde Functional analysis Approximation theory

Source paper: The structure of solution spaces for fractional-order operators, with gradient estimates arXiv:2607.02312 ⓘ · analyzed Aug 30, 2026

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

Idea description

For a fractional Dirichlet problem, replace a free coordinate network N_theta(x) with u_theta(x)=d(x)^a N_theta(x), where d(x)=dist(x,boundary) and 0<a<1 is the fractional order. Train the regular quotient v_theta=u_theta/d^a=N_theta and use a weighted gradient loss that reflects the paper's boundary estimate.

Formulas

$$P u=f\text{ on }\Omega,\qquad u=0\text{ on }\mathbb{R}^n\u005csetminus\Omega,$$

$$u_\theta(x)=d(x)^a v_\theta(x),\qquad d(x)=\operatorname{dist}(x,\partial\Omega),\qquad v_\theta(x)=N_\theta(x),$$

$$\left\|d^{1-a+s}\nabla\left(\frac{u}{d^a}\right)\right\|_{\dot H_q^{s+t}(\overline\Omega)}\leq C\left(\|f\|_{\overline H_q^t(\Omega)}+\|u\|_{L_q(\Omega)}\right),\qquad a>\frac12,$$

$$\mathcal L_\theta=\frac{1}{|X|}\sum_{x_i\in X}|P[u_\theta](x_i)-f(x_i)|^2+\lambda_g\frac{1}{|X_b|}\sum_{x_i\in X_b}\left(d(x_i)^{1-a+s}|\nabla v_\theta(x_i)|\right)^2.$$

Mathematical statement

The paper studies P u=f in a bounded domain Omega, with u=0 outside Omega, for a fractional-order operator P of order 2a, where 0<a<1. It states that the solution space contains a component of the form d^a times a boundary-value lifting, with d(x)=dist(x,partial Omega). For a>1/2, the gradient estimate is ||d^(1-a+s) nabla(u/d^a)||_{H_q^(s+t)} <= C(||f||_{H_q^t}+||u||_{L_q}), where s and t are small regularity indices, q is an integrability exponent, C is problem-dependent, and the norms are taken on the closure of Omega. The transferable fact is that v=u/d^a is more regular than u, while d^(1-a+s) nabla v is the correctly weighted quantity near the boundary.

Implementation notes

Integrate the construction at the output layer of a coordinate MLP or PINN solving a known fractional PDE. Precompute a nonnegative distance field d(x) for the domain; during optimization use d_delta(x)=sqrt(d(x)^2+delta^2)-delta if exact distance derivatives are unstable, and define u_theta=d_delta^a N_theta. Set the output to zero outside the domain. Each iteration should: (1) sample interior collocation points X, boundary-near points X_b, and forcing values f(x); (2) evaluate v=N_theta(X) and u=d_delta^a v; (3) compute the fractional PDE residual r_i=P[u](x_i)-f(x_i) using the existing fractional-operator discretization or quadrature routine; (4) compute g_i=d_delta(x_i)^(1-a+s) nabla N_theta(x_i) by automatic differentiation; and (5) minimize mean(r_i^2)+lambda_g mean(||g_i||_2^2). The factor d^(1-a+s) comes directly from the paper. The constant C and exact Sobolev norms are not computed; lambda_g, s, and delta are selected by validation. Start with a unit disk or square, a=0.75, a manufactured solution u*=d^a v* with smooth v*, a four-layer width-128 MLP, and equal collocation budgets for the baseline and factored model. Compare against a free-output PINN with a standard boundary penalty. Measure relative L2 error, boundary-strip error, residual variance, and loss decrease per optimizer step. Success means lower boundary error and faster residual reduction at equal compute, especially as a approaches one.

Verification

Beats tuned baseline

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Confirmed ✓

Stage 2 · Practical benchmark result: Significant win ✓

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 and tested the fractional boundary-factored MLP in experiment.py. The numerical check reproduced slopes -0.2495 versus expected -0.25 for the raw derivative and 0.3500 versus expected 0.35 for the weighted quotient gradient. In the matched toy run, boundary-strip relative L2 improved from 0.4213 to 0.1598, but global relative L2 worsened from 0.0779 to 0.0977, so the effect is a real boundary-accuracy win rather than an overall accuracy or speed win.

Agent confidence: 8/10

Baseline: global relative L2=0.077865; boundary-strip relative L2=0.421280; final loss=0.001269; runtime=12.17s
Idea: global relative L2=0.097693; boundary-strip relative L2=0.159800; final loss=0.002812; runtime=16.94s

Limitations: The test is a 1D manufactured supervised fitting proxy, not a genuine fractional PDE quadrature/PINN residual experiment. Only one seed, one order, one regularization weight, and one architecture were tested; no higher-dimensional domain or true fractional operator was evaluated.

How to run: python3 experiment.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.02312) Sep 4, 2026

Beats the tuned baseline by 8.1% (p=0.0317, wins 6 / 8 paired seeds; metric: lower is better).

Benchmark: Poisson_boundary
Model: mlp_tiny
Paired seeds: 8
Baseline mean: 0.007
Idea mean: 0.0065
Effect (Δ): -0.0006 (−8.1%; negative = idea better)
Wins: 6 / 8 paired seeds
p-value: 0.0317 (permutation test, 20 000 shuffles)
Smallest detectable effect: ±5.9%
Mechanism: Confirmed ✓
Practical effect: Helps
Baseline tuning: swept over 9 configs

Limitations:

The benchmark uses a manufactured fractional-boundary regression proxy rather than an explicit fractional operator quadrature/PINN residual. Only a unit-disk domain, a=0.75, one small MLP architecture, 35 epochs, and 400 training/test samples were evaluated; no higher-dimensional, nonlocal-operator, or broader architecture study was performed.

How to run: python3 bench_experiment.py

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

Stage 2 — Benchmark Sep 4, 2026 latest Worked ✓

Agent confidence: 9/10

Implemented fractional boundary factoring with weighted quotient-gradient regularization on a custom fractional Dirichlet boundary-value regression track, using identical mlp_tiny systems and paired seeds. The idea lowered test MSE from 0.0070448734 to 0.0064753409, with paired delta -0.0005695326 and permutation p=0.0317, meeting the benchmark's significant-win criterion. The trained-model mechanism signature also confirmed the predicted near-boundary scaling.

Baseline: 8-seed test MSE mean=0.0070448734, std=0.0010013697; best lr=0.01, boundary_weight=1.0
Idea: 8-seed test MSE mean=0.0064753409, std=0.0010829861; best lr=0.01, lambda_g=0.01; delta=-0.0005695326; p=0.0317

Benchmark result