△ Mechanism confirmed, baseline not beaten
2026
Replace Euclidean or entrywise Kronecker fitting of a layer curvature matrix with its affine-invariant projection onto G = A tensor B. Use the resulting factors as a compact SPD preconditioner in the optimizer, while solving the projection through logarithmic residual partial traces and Armijo line search.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a dense multiresolution voxel or hash-grid encoder with an omnitree-like anisotropic feature partition. Each cell stores a vector-valued scaling feature and its children are introduced only when local Haar detail energy is large; coarsening replaces children by their mean, so compression does not introduce an arbitrary offset. Splitting can be restricted to the coordinate whose one-dimensional detail coefficient is largest, allowing thin structures to receive resolution only in the…
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense directional feature map with a finite stable-zonotope layer: a small set of large random vectors creates a hyperplane arrangement over the input sphere, while a cheaper small-jump residual gives continuous features inside each cell. The layer exposes an explicit compute-versus-resolution knob through the jump cutoff and can be used either as an embedding before an MLP or as a lightweight router for mixture-of-experts blocks.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a neural feature, adapter, or expert block only through the component of its outputs that is orthogonal to the span of all previously installed blocks. Quotient coefficient directions that produce nearly identical outputs with an SVD or pseudoinverse, so the new block contributes intrinsic representational dimensions instead of duplicating old features. The expected benefit is a smaller effective architecture and better-conditioned block expansion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a neural-network weight tensor by rank-one terms whose mode factors are selected from shared orthonormal bases, and impose the same basis alignment across tensor flattenings. During or after training, retain the largest coefficients to obtain a structured truncation analogous to truncated SVD. This should produce better-conditioned tensorized layers than unconstrained CP factors while preserving a directly controllable accuracy/compute tradeoff.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a $K$-class softmax with $N$ binary hyperplane heads, where each class is represented by the signs of its projections onto fixed random directions. Train the embedding to reproduce these codewords and decode by nearest Hamming codeword. The paper's guarantee suggests that $N\approx 2\log_2 K+\log_2(1/\delta)$ can separate all class centers with high probability in sufficiently high dimension, giving a concrete width rule rather than choosing the number of binary heads heuristically.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Train a square orthogonal neural mixer while maximizing its entrywise fourth-power concentration. When optimization reaches a non-permutation stationary configuration, explicitly test rank-two row or column rotations and take a rotation with positive exact second variation, using the paper's constructive saddle-escape mechanism.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Prune hidden units only after testing whether their nonlinear gate is task-visible and downstream-used. For ReLU, a unit is removable when its preactivation does not cross zero on the task patch or its outgoing weight column is zero; this is a more structural criterion than weight magnitude and can be applied during width search or post-training compression.
Useful6/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Replace nominal hidden-unit count by the number of distinct realized ReLU kink hyperplanes, then regularize or prune this effective count. Neurons whose normalized affine boundaries coincide can be exactly merged by summing their canonical coefficients, reducing memory without changing the represented function and aligning the model's complexity measure with the theorem.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Represent every mesh interface degree of freedom by one feature copy per incident cell, and apply local neural blocks directly to these cell tensors. Enforce inter-cell consistency with valence-weighted averaging only after selected layers or hierarchy transitions, avoiding repeated construction of a global sparse graph or assembled feature vector. This is suited to adaptive quadtrees, octrees, and finite-element neural operators.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace dense grid tokens or global spectral features with coefficients of compactly supported kernels centered on a nested hierarchy of spatial points. Encode an input field into coarse-to-fine coefficients, apply a neural map to those coefficients, and decode the predicted coefficients at arbitrary query locations; the contribution from each level provides an explicit multiscale output decomposition.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Prune higher-order tensor or polynomial interactions while preserving an exchange-closed support instead of independently retaining the largest weights. The resulting sparse interaction pattern avoids arbitrary holes and retains structured substitutions between coordinates, potentially improving parameter efficiency and robustness after pruning.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Replace ordinary per-coordinate activation normalization or covariance whitening with a learned or frozen affine map based on a minimum-volume ellipsoid calibrated to the activation convex hull. Estimate the hull's Minkowski symmetry and use the bound \(\rho=\sqrt{d/\alpha}\) to set a principled clipping radius, where \(d\) is feature dimension and \(\alpha\) is the measured symmetry. This should reduce worst-case clipping of asymmetric activation distributions without requiring a much larger…
Useful5/10
Difficulty6/10
Novelty4/10
Unverified
2026
Replace a dense channel-mixing matrix in a sequence layer with alternating diagonal propagation and sparse unipotent Stokes jumps. The diagonal part carries independently controlled exponential phases, while the unipotent factors implement cheap residual-like mode conversion without changing determinant or requiring a dense matrix multiply. Constrain the phase magnitudes and jump coefficients during training to obtain a reversible, norm-monitorable mixer.
Useful5/10
Difficulty4/10
Novelty7/10