Newton-envelope monomial layer
Implementation & benchmark of arXiv:2608.17714 — Newton Support Functions and Metric Completion of Singular Conformal Metrics at Corners
Source paper: Newton Support Functions and Metric Completion of Singular Conformal Metrics at Corners arXiv:2608.17714 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace a naively evaluated mixture of power-law experts with a Newton-envelope layer that computes all monomial magnitudes in log-space and subtracts their maximum before exponentiation. The layer exposes both a stabilized mixture value and soft dominance weights, allowing a downstream MLP to adapt to whichever scaling regime is active without overflow or hand-designed regime splits.
Formulas
Mathematical statement
The paper defines a positive monomial mixture \(F(x,y,z)=\sum_{j=1}^{N}u_j(x,y,z)x^{-a_j}y^{-b_j}\), where \(x,y>0\), \(u_j\) are positive bounded coefficients, and \(a_j,b_j\geq0\) are exponent pairs. For logarithmic scales \(p=-\log x\) and \(q=-\log y\), the Newton support function is \(\mathcal{H}(p,q)=\max_j(pa_j+qb_j)\); it is the log-scale upper envelope of the monomials. We use the exact log-sum-exp identity \(\log F=\mathcal{H}+\log\sum_j\exp(\log u_j+pa_j+qb_j-\mathcal{H})\). The resulting weights \(\pi_j=\exp(\log u_j+pa_j+qb_j-\mathcal{H})/\sum_k\exp(\log u_k+pa_k+qb_k-\mathcal{H})\) are a differentiable soft version of the dominant Newton face and sum to one. The support subtraction is the key numerical property: all exponentials have nonpositive arguments, so the layer remains stable over many orders of magnitude.
Implementation notes
Integrate this as a coordinate-conditioned layer in a neural field or MLP, immediately after the input coordinates and before the first hidden block. Inputs are positive coordinates x,y, optional context z, and N exponent pairs (a_j,b_j). Clamp x and y below by epsilon, for example 1e-6. Store exponents as softplus parameters if they should be learned. Use a small linear or MLP coefficient head to produce log u_j. Compute p=-log(x), q=-log(y), s_j=log_u_j+a_j*p+b_j*q, h=max_j s_j, and pi=softmax(s-h). Produce logF=h+logsumexp(s-h), then feed [logF, pi_1,...,pi_N, x, y, z] into the ordinary MLP. A cheaper variant returns the weighted expert feature sum sum_j pi_j*phi_j(x,y,z), where each phi_j is a small shared-width expert. The paper supplies the envelope h and stable normalization; learned coefficients and expert features are empirical design choices. First test on a 2D regression benchmark containing a mixture of singular terms, such as F(x,y)=x^-1.7 y^-.1 + 0.5 x^-.2 y^-1.5, sampled logarithmically near the origin. Compare a standard coordinate MLP, a raw monomial layer, and this layer at equal parameter count. Measure validation error versus distance to the corner, NaN or overflow frequency, and wall-clock time. Success is lower near-corner error and no numerical failures at scales where raw evaluation overflows; a useful secondary signal is faster loss descent because the soft dominance weights avoid forcing one MLP to learn all scale regimes.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.