△ Mechanism confirmed, baseline not beaten 2026

David-coordinate invertible warp

Implementation & benchmark of arXiv:2608.05618 — An Orlicz variational formula for David-type Beltrami equations

Usefulness7/10

Difficulty6/10

Novelty7/10

Geometry Stability Accuracy Architecture Regularization Geometry Functional analysis

Source paper: An Orlicz variational formula for David-type Beltrami equations arXiv:2608.05618 ⓘ · analyzed Aug 31, 2026

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

Idea description

Parameterize the local anisotropic deformation of a 2D neural warp by an unconstrained field ν rather than directly predicting a Beltrami coefficient μ. Map it through μ=F(ν)=ν/(2+|ν|), which guarantees |μ|<1 at every pixel while retaining a simple distortion measure K=1+|ν|. This allows an invertible image-coordinate or spatial-transformer layer to represent highly distorted regions without sigmoid saturation near |μ|=1.

Formulas

$$\bar{\partial}f=\mu\,\partial f,\qquad |\mu|<1$$

$$\mu=F(\nu)=\frac{\nu}{2+|\nu|},\qquad K_{F(\nu)}=\frac{1+|F(\nu)|}{1-|F(\nu)|}=1+|\nu|$$

$$\frac{\|DF_{\nu}\|_{\mathrm{op}}}{1-|F(\nu)|^{2}}\leq\frac{1}{2}$$

$$\mathcal L_{\mathrm{warp}}=\mathcal L_{\mathrm{task}}+\lambda\,\mathbb E_x\left[\Phi\left(\frac{|\nu(x)|}{\tau}\right)\right],\qquad \Phi(s)=e^s-s-1$$

Mathematical statement

The paper defines the complex Beltrami equation $\bar\partial f=\mu\,\partial f$, where $\partial=(\partial_x-i\partial_y)/2$, $\bar\partial=(\partial_x+i\partial_y)/2$, and μ is the complex local distortion coefficient. It reparameterizes μ using $\nu\in\mathbb C$ as $F(\nu)=\nu/(2+|\nu|)$. For $r=|\nu|$, the induced distortion is $K_{F(\nu)}=(1+|F(\nu)|)/(1-|F(\nu)|)=1+r$. Thus an unconstrained network output has a directly interpretable condition-number-like distortion. The radial and tangential singular values of $DF_\nu$ are $2/(2+r)^2$ and $1/(2+r)$, so $\|DF_\nu\|_{op}=1/(2+r)$. Since $1-|F(\nu)|^2=4(1+r)/(2+r)^2$, the key cancellation is $\|DF_\nu\|_{op}/(1-|F(\nu)|^2)=(2+r)/(4(1+r))\le1/2$. This bounds parameter sensitivity relative to the loss of ellipticity.

Implementation notes

Integrate this into a differentiable 2D coordinate-warp module, such as an image-registration layer, optical-flow model, or neural PDE coordinate map. The coefficient head receives a feature map and outputs two channels $\nu_R,\nu_I$; form $r=\sqrt{\nu_R^2+\nu_I^2+\epsilon}$, then compute $\mu=(\nu_R+i\nu_I)/(2+r)$. Use μ to construct the local real Jacobian of the warp: if $a=\partial f$ is a positive scalar or a separately predicted rotation/scale factor, impose $\bar\partial f=\mu a$, convert these complex derivatives to a 2x2 real Jacobian, and integrate the field with an existing differentiable Poisson/Beltrami solver or use it as the local Jacobian in a piecewise-affine warp. Pseudocode: nu=net(features); r=sqrt(sum(nu**2)+eps); mu=nu/(2+r); J=jacobian_from_beltrami(mu, scale); y=integrate_or_apply(J,x); loss=task(y)+lambda*mean(exp(r/tau)-r/tau-1). The mathematical part is the coefficient map and its guaranteed bound; estimate empirical Jacobian condition numbers from finite differences of the produced warp. Start on 32x32 MNIST or CelebA registration with a small U-Net and compare direct mu=tanh(raw) against the proposed map under identical parameter count. Success means fewer foldovers, lower gradient variance near large deformations, and better registration error at the same training budget.

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 a differentiable David-coordinate Beltrami coefficient head and real 2D Jacobian conversion in david_warp.py, plus numerical verification in verify_warp.py. The mechanism manifested: K=1+|nu| had maximum error 7.1e-15 with measured slope 1.0, the sensitivity ratio stayed within the predicted [0.25,0.5] interval with no bound violations, and finite-difference singular values matched analytic values within 0.1%. The David map’s radial derivative remained much larger than tanh at large radii, although the simple fixed-step target-fitting toy favored tanh and therefore does not establish an accuracy win.

Agent confidence: 8/10

Baseline: tanh target fit: final MSE 9.27e-6, reached MSE<1e-3 in 3 steps; derivative at r=8 was 4.50e-7
Idea: David map: final target-fit MSE 0.0618 with this fixed SGD setup; derivative at r=8 was 0.0200; K slope 1.000, max formula error 7.1e-15, sensitivity max 0.500, max |mu| on r<=100 was 0.9804

Limitations: No end-to-end image registration or integrated spatial warp/Poisson-Beltrami solver was tested, and no FLOP-matched vision benchmark was run. The Jacobian finite-difference check excludes the nondifferentiable origin and uses a fixed scale factor f_z=1.

How to run: python3 verify_warp.py && /home/maxwelhelp/main/bin/python3 -c "import torch; from david_warp import DavidCoefficient; x=torch.randn(2,3,8,8,requires_grad=True); nu,mu,J=DavidCoefficient(3)(x); (J.square().mean()).backward(); print(nu.shape,mu.shape,J.shape)"

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

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

Benchmark: Vision (image classification)
Model: cnn_small
Paired seeds: 8
Baseline mean: 0.84
Idea mean: 0.8387
Effect (Δ): -0.0013 (−0.1%; negative = idea better)
Wins: 5 / 8 paired seeds
p-value: 0.7308 (permutation test, 20 000 shuffles)
Smallest detectable effect: ±1.5%
Mechanism: Confirmed ✓
Practical effect: No effect
Baseline tuning: swept over 5 configs

Limitations:

Only the registered vision track was tested. No true image-registration dataset, globally integrated Poisson/Beltrami solver, foldover-rate measurement, gradient-variance analysis, speed/FLOP benchmark, or larger-scale dataset was tested; the local warp uses bounded coefficient channels as coordinate offsets.

How to run: python3 bench_david.py

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

Stage 2 — Benchmark Aug 31, 2026 latest Failed ✗

Agent confidence: 9/10

The David-coordinate warp was implemented and evaluated end-to-end against a direct tanh coefficient warp on the registered built-in vision track. The trained-model signature confirmed K=1+|nu| and |mu|<1, but test error improved only from 0.83999999 to 0.83874997 with paired permutation p=0.7308, so the benchmark verdict is no measurable effect and worked=false.

Baseline: err mean 0.83999999, std 0.02850438, best lr=0.01 strength=0.25 epochs=8
Idea: err mean 0.83874997, std 0.02701273, best lr=0.01 strength=0.25 epochs=8; delta=-0.00125001, p=0.7308

Benchmark result