Unverified 2026

Invariant cone positive feature head

Implementation & benchmark of arXiv:2607.07150 — On 4-dimensional convex projective domains invariant by a lattice of $\mathrm{SL}_2 (\mathbb{R})$

Usefulness5/10
Difficulty4/10
Novelty7/10

Source paper: On 4-dimensional convex projective domains invariant by a lattice of $\mathrm{SL}_2 (\mathbb{R})$ arXiv:2607.07150 ⓘ · analyzed Aug 30, 2026

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

Idea description

Constrain selected degree-four feature blocks to represent globally nonnegative binary quartics using a positive-semidefinite Gram matrix. This gives a structured alternative to unconstrained activations for energy, uncertainty, density, or direction-dependent gating features that must remain nonnegative under every planar direction.

Formulas

$$K_n=\{p\in V_n:\;P_p(X,Y)\ge 0\ \text{for all }(X,Y)\in\mathbb{R}^2\}.$$
$$P_p(X,Y)=z_m(X,Y)^\top Qz_m(X,Y),\qquad z_m(X,Y)=(X^m,X^{m-1}Y,\ldots,Y^m)^\top,\qquad Q\succeq0.$$
$$p\in K_n\Longrightarrow R_n(A)p\in K_n,\qquad P_{R_n(A)p}(X,Y)=P_p(aX+cY,bX+dY)\ge0.$$
$$Q=LL^\top+\varepsilon I,\qquad p=\operatorname{coeff}\left[z_m(X,Y)^\top Qz_m(X,Y)\right],\qquad \varepsilon>0.$$

Mathematical statement

The paper states that the representation rho preserves the cone of homogeneous polynomials that take nonnegative values on R^2. Define K_n={p in V_n:P_p(X,Y)>=0 for every (X,Y) in R^2}, where V_n is the degree-n binary-polynomial space and P_p is the polynomial encoded by p. The cone is convex, closed, pointed, and has nonempty interior; its projectivized interior is the paper's properly convex domain O_max. For even n=2m, use the constructive sufficient certificate P(X,Y)=z_m(X,Y)^T Q z_m(X,Y), with z_m(X,Y)=[X^m,X^(m-1)Y,...,Y^m]^T and Q positive semidefinite. Then P is nonnegative everywhere because it is a quadratic form in z_m. The Gram representation need not be unique and is sufficient rather than a minimal parameterization. Cone invariance follows from P_{R_n(A)p}(X,Y)=P_p(aX+cY,bX+dY), which remains nonnegative whenever p belongs to K_n.

Implementation notes

(1) Integration point: replace a free quartic coefficient head used for an energy, uncertainty score, directional attention gate, or nonnegative density with a cone-constrained head. Use n=4 and m=2, so z2(X,Y)=[X^2,XY,Y^2]. (2) Pseudocode: train an unconstrained lower-triangular raw matrix L; set Q=L L^T+epsilon I with epsilon about 1e-5; expand z2^T Q z2 into the five quartic coefficients p; for a unit direction u(theta)=[cos(theta),sin(theta)], compute s(theta)=z2(u(theta))^T Q z2(u(theta)); use s as the nonnegative output or apply log( s+epsilon ) when an energy-like score is required. To transform coordinates, either apply the exact coefficient matrix R4(A) to p or evaluate P(Au) directly. (3) The PSD guarantee and cone-preserving transformation come from the paper's mathematics. The Cholesky-style parameterization, epsilon, angular sampling, and the choice of downstream loss are engineering decisions. Check violations numerically on a dense angle grid, but the Gram construction guarantees nonnegativity analytically for every direction. (4) First experiment: compare this head with an unconstrained quartic head and a ReLU MLP on a small planar regression or energy-based classification task with random rotations and shears. Track negative-output violations, gradient norm variance, calibration, test loss, and robustness under transformations. Use matched hidden width and optimizer settings. The expected signal is zero sign violations, fewer unstable gradients, and improved extrapolation to unseen coordinate transformations at similar parameter count. If the positive constraint hurts accuracy, ablate epsilon and use the cone head only for auxiliary energy or uncertainty outputs.

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.