Unverified 2026

Web-Constrained Product Flow

Implementation & benchmark of arXiv:2607.20646 — The Independence-Preserving Property and Planar Web Geometry

Usefulness5/10
Difficulty6/10
Novelty6/10

Source paper: The Independence-Preserving Property and Planar Web Geometry arXiv:2607.20646 ⓘ · analyzed Aug 30, 2026

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

Idea description

Add an invertible two-dimensional flow block whose Jacobian and coordinate outputs are explicitly regularized to preserve independence of several prescribed product distributions. Instead of estimating independence only from samples, enforce the change-of-variables functional equation for multiple density probes, encouraging the learned map to belong to a low-dimensional family of independence-preserving transformations.

Formulas

$$\mu_U\otimes\mu_V=F_{\#}(\mu_X\otimes\mu_Y)$$
$$\varphi_X(x)+\varphi_Y(y)-\varphi_U(u(x,y))-\varphi_V(v(x,y))-\log\left|\det\frac{\partial(u,v)}{\partial(x,y)}\right|=0$$
$$\alpha_X(x)+\alpha_Y(y)+\alpha_U(u(x,y))+\alpha_V(v(x,y))=0$$
$$\operatorname{rank}(\mathcal W_F)\leq 3$$

Mathematical statement

For independent inputs with densities p_X(x) and p_Y(y), an invertible map F(x,y)=(u(x,y),v(x,y)) produces joint density p_{U,V}(u,v)=p_X(x)p_Y(y)/|J_F(x,y)|, where J_F=det(\partial(u,v)/\partial(x,y)). Independence of U,V with marginal densities p_U,p_V is equivalent to the logarithmic equation \varphi_X(x)+\varphi_Y(y)-\varphi_U(u(x,y))-\varphi_V(v(x,y))-\log|J_F(x,y)|=0, where \varphi_T is the logarithm of the density of T, or the logarithm of its density relative to the paper's reference measure. The associated planar 4-web consists of the level curves x=constant, y=constant, u=constant, and v=constant. An Abelian relation is an identity \alpha_X(x)+\alpha_Y(y)+\alpha_U(u)+\alpha_V(v)=0. Under the paper's nonsingularity assumptions, Bol's rank bound gives at most three independent Abelian relations, so the learned family of product-preserving corrections can be restricted to three shared scalar basis functions per foliation.

Implementation notes

Integrate this as a two-dimensional invertible coupling block inside a VAE encoder or an invertible latent model, operating on two latent channels z_1 and z_2 at a time. Start with an affine coupling transform u=z_1 and v=s(z_1)z_2+t(z_1), where s(z_1)=softplus(a(z_1))+epsilon ensures a nonzero Jacobian; alternate channel order across blocks and optionally insert an invertible 2-by-2 linear mixing layer. Construct K=4 to 8 probe product densities q_k(z_1,z_2)=q^k_1(z_1)q^k_2(z_2), using one-dimensional Gaussians with different means and variances. For each probe, sample z, compute (u,v) and log_abs_det_J, and use small one-dimensional density heads r^k_1(u), r^k_2(v) to model the output marginals. Compute e_k=log q^k_1(z_1)+log q^k_2(z_2)-r^k_1(u)-r^k_2(v)-log_abs_det_J and add L_web=(1/K) sum_k mean(e_k^2) to the task, reconstruction, or negative-log-likelihood objective. To encode the rank bound, parameterize the probe-dependent corrections as alpha^k_T(t)=sum_{j=1}^3 c^k_{Tj}b_{Tj}(t), where T is one of X,Y,U,V and b_{Tj} are learned one-dimensional basis functions; penalize alpha^k_X(z_1)+alpha^k_Y(z_2)+alpha^k_U(u)+alpha^k_V(v) squared. The paper-derived quantities are the change-of-variables residual and the three-relation capacity limit; output marginals, basis functions, and coefficients are estimated during training. Pseudocode: sample k and z1,z2; compute u,v,logdet; evaluate e_k; compute the Abelian residual; backpropagate task_loss+lambda_web*mean(e_k^2)+lambda_abelian*mean(residual^2). First run a 2D toy benchmark where independent non-Gaussian inputs are transformed by a known nonlinear bijection, then test a small MNIST VAE with paired latent channels. Compare against an unconstrained RealNVP and a standard total-correlation penalty at matched parameter count and training FLOPs. Track held-out mutual information between u and v, reconstruction or likelihood, Jacobian singular-value condition numbers, and variance across random seeds. A successful result is lower held-out mutual information and better Jacobian conditioning without reducing reconstruction quality.

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.