Hypoelliptic transport-diffusion layer
Source paper: Boundary Harnack inequalities for Kolmogorov equations in asymptotically cylindrical Lipschitz domains arXiv:2608.29813 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace an isotropic local mixing layer with a kinetic layer that smooths features in x and transports them in y along the characteristic direction x. The layer should be useful for phase-space data, learned simulators, and world models in which positions or transported quantities evolve through coupled drift and diffusion rather than independent Euclidean motion.
Formulas
Mathematical statement
The paper studies the Kolmogorov operator \(\mathcal{K}=\Delta_x+x\cdot\nabla_y-\partial_t\), where \(x\in\mathbb{R}^m\) is the diffusive variable, \(y\in\mathbb{R}^m\) is the higher-order transported variable, \(t\) is time, \(\Delta_x=\sum_{i=1}^m\partial_{x_i}^2\), and \(x\cdot\nabla_y=\sum_{i=1}^m x_i\partial_{y_i}\). Its intrinsic dilation is \(\delta_r(x,y,t)=(rx,r^3y,r^2t)\), so x has homogeneous degree 1, t degree 2, and y degree 3. The proposed layer uses the two constructive pieces of \(\mathcal{K}\): diffusion in x, approximated by \(e^{h\Delta_x}\), and characteristic transport in y, generated by \(x\cdot\nabla_y\). Here \(h>0\) is a layer step size, \(D_h\) is an x-only diffusion operator, \(S_hf(x,y)=f(x,y+hx)\) is transport, and \(g_k\) is a learned gate constrained to \([0,1]\). The residual update is a stable interpolation between the current feature and the transported-diffused feature.
Implementation notes
Integrate the layer as a replacement for one local convolution, MLP-mixer block, or state-space transition in a model whose features are indexed by phase-space coordinates (x,y), with optional time conditioning. Let the input be a tensor f of shape [batch, spatial-x locations, spatial-y locations, channels], together with coordinate tensors x and y. First choose a positive step h. Implement D_h as a depthwise separable convolution over x axes only, using a normalized Gaussian kernel with variance 2h; on irregular coordinates, use K nearest x-neighbors with weights w_ij proportional to exp(-||x_i-x_j||^2/(4h)), normalized over j. Next implement characteristic transport by evaluating the diffused feature at y_i+h*x_i using bilinear interpolation or a differentiable grid sampler. Compute delta=f_shift-f, and update f_new=f+sigmoid(G(f))*delta, where G is a pointwise linear layer and the sigmoid gate supplies g in the formula. Optionally follow this with a pointwise channel-mixing MLP and LayerNorm. For a multiscale stack, use x receptive-field radius r_l, y radius r_l^3, and time or layer step proportional to r_l^2, directly matching delta_r. Pseudocode is: f_diff=DiffusionX(f,h); f_shift=InterpolateY(f_diff,y+h*x); delta=f_shift-f; f=f+sigmoid(G(f))*delta. The paper-derived quantities are the Kolmogorov operator, anisotropic dilation, Gaussian x diffusion, and x-directed y transport; h, kernel truncation radius, channel width, and gate initialization are empirical hyperparameters. The first experiment should use a small damped-particle or Lorenz-style phase-space prediction dataset. Compare a six-layer MLP or Transformer local mixer against an equal-parameter, equal-FLOP model replacing two mixers with kinetic layers. Measure one-step MSE, long-horizon rollout error, gradient norm variance, and performance as training-set size decreases. Success means lower rollout error and fewer unstable trajectories, especially on systems where y evolves through x. Include ablations removing the transport term, using isotropic diffusion, and replacing h*x by a learned unconstrained displacement.
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.