Polynomial Jacobian Non-Collapse
Implementation & benchmark of arXiv:2608.03922 — Absolute continuity of two-dimensional polynomial random vectors
Source paper: Absolute continuity of two-dimensional polynomial random vectors arXiv:2608.03922 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Add a two-output anti-collapse regularizer based on the determinant of the Jacobian Gram matrix, together with a penalty against proportional highest-degree coefficient tensors. The paper's inequality predicts that preserving coefficient non-proportionality prevents the output distribution from concentrating on thin curves or tiny regions, potentially improving coverage of a two-dimensional latent or generative output.
Formulas
Mathematical statement
Let X have independent coordinates with law μ, and let f = (f₁, f₂) be a polynomial map of degree at most d. Let a₁ and a₂ be the coefficient vectors of the degree-d orthogonal-chaos components of f₁ and f₂. Define the computable non-proportionality proxy ρ(f) = min_c ||a₁ − c a₂||₂; when both coefficient vectors are normalized to unit norm, this is sqrt(1 − (a₁ᵀa₂)²). The paper proves [[f]]_{μ,∞}^{1/(2d−1)} μ(f ∈ A) ≤ C λ₂(A)^{1/(2d−1)} for every Borel set A in R², where [[f]]_{μ,∞} measures failure of proportionality, λ₂(A) is planar Lebesgue area, and C depends on d and input distribution bounds. It also proves ∫ Δ_f dμ ≥ C [[f]]_{μ,∞}², where Δ_f = det(G_f), G_f is the 2 by 2 Gram matrix of the input gradients ∇f₁ and ∇f₂, and C is a positive constant. The neural-network adaptation maximizes the empirical log determinant of G_f and penalizes small ρ.
Implementation notes
(1) Integration point: apply this to a two-dimensional continuous output head, such as a VAE decoder coordinate head, a diffusion model prediction head for two selected channels, or a two-dimensional bottleneck in an MLP. To expose top-degree coefficients, use a small polynomial or Hermite-feature adapter before the output head: f_i(x) = Σ_{|α|≤d} a_{i,α} φ_α(x), with tensor-product Hermite features for approximately Gaussian inputs or centered monomial features for general inputs. The vectors a₁ and a₂ contain coefficients with |α| = d. (2) Pseudocode: sample a minibatch x_b; compute y_b = f(x_b); obtain g₁b = ∇x f₁(x_b) and g₂b = ∇x f₂(x_b) with autodiff; calculate q₁ = g₁b·g₁b, q₂ = g₂b·g₂b, q₁₂ = g₁b·g₂b, and Δ_b = q₁q₂ − q₁₂². Add −λΔ mean_b log(Δ_b + ε) to the task loss. Normalize a₁ and a₂, calculate ρ = sqrt(max(ε, 1 − (a₁ᵀa₂)²)), and add λρ max(0, ρ₀ − ρ)². (3) The paper supplies the anti-concentration and expected-determinant relationships; the minibatch determinant, coefficient score, and output occupancy are empirical estimates. Use gradient clipping and a warm-up schedule for λΔ because the log determinant has large gradients near singular Jacobians. (4) First experiment: train a small VAE with a two-dimensional decoder output on a synthetic mixture of 2D Gaussians and MNIST-derived two-dimensional projections. Compare the baseline, determinant-only regularization, and coefficient-plus-determinant regularization at equal parameter count. Measure reconstruction loss, held-out likelihood, mean and tenth-percentile Δ_b, ρ, fraction of occupied equal-area output grid cells, and maximum probability in a thin strip. The method succeeds if it increases occupied-area coverage and reduces thin-strip concentration without materially degrading reconstruction or likelihood.
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.