Unverified
2026
Add a decentralized safety layer to a multi-agent neural policy or learned world model. Each agent first predicts an action or short trajectory, then projects its proposal into a half-space defined by each neighbor's announced trajectory and a positive buffer, avoiding a centralized nonconvex collision solve. Use Jacobi or Gauss-Seidel iterations when agents mutually revise their predicted trajectories.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a differentiable layer that maps a polygonal contour or predicted segmentation polygon to high-order complex Zernike moments using exact edge integrals instead of pixel-center sums. Feed the resulting moment vector to a classifier or use it as an auxiliary shape-consistency loss, making the representation insensitive to raster resolution and reducing high-order aliasing.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a distribution-level regularizer that compares augmented second-moment matrices of neural activations using the affine-invariant Riemannian metric on SPD matrices. This aligns means, variances, and selected nonlinear moments while remaining invariant to invertible linear reparameterizations of feature coordinates.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a differentiable geometric-conditioning reward to a neural policy that selects UAV motions or other active-sensing actions. The policy is rewarded for configurations whose sensing Jacobian has a large smallest nonzero singular value, preventing early decisions from overfitting to an uncertain target estimate and encouraging measurements that distinguish competing hypotheses.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train the output layer on a fast timescale and the hidden feature layer on a slow timescale, so output coefficients first fit the components representable by the current features before hidden directions move. Use residual plateaus to detect when the fast subsystem has approximately equilibrated, then increase the hidden-layer learning rate to begin the next feature-learning stage.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Construct intermediate training examples along an optimal-transport coupling between two strongly log-concave endpoint distributions, and regularize the network so that its output variance on each intermediate distribution is no larger than the sharp endpoint-interpolated Poincare scale times its expected input-Jacobian energy. This converts the paper's distributional inequality into a path-wise smoothness constraint for logits, embeddings, or scalar losses.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent top-k MoE routing with a submodular polyhedral allocation over experts. A learned set function assigns a marginal gain to each additional expert allocation, so the router exhibits diminishing returns and can enforce global capacity constraints rather than making unrelated per-token choices. The allocation is obtained by sorting marginal gains, giving a fast greedy router with piecewise-linear routing regions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independent coordinate rounding of a fixed-sum vector with nearest-point quantization in the projected integer lattice A_n^*. The quantized vector preserves the zero-sum constraint exactly, while the globally optimal rounding correction accounts for the aggregate residual induced by projection.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a hybrid neural ODE from several smooth vector-field branches and select the active branch using a learned Hamiltonian-like score. Track a positive-definite matrix representing local tangent sensitivity and force its discrete evolution to be positive semidefinite, adapting the paper's monotone Jacobi-curve condition to neural dynamics.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a single smooth inverse predictor near detected ambiguity boundaries with multiple prediction branches and a soft gate. The gate is trained to preserve distinct decompositions rather than forcing the network to interpolate through a thin high-curvature transition layer, while a Jacobian or curvature penalty identifies unresolved ambiguity regions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the paper's singular stopping-gain term to explicitly measure how much learned feature covariance crosses a max or routing boundary. Penalize excessive covariance in the normal direction to the switching surface, rather than pretending that the max operation has an ordinary Hessian.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Turn a recurrent or state-space memory into a constrained hereditary state: the latent state remains in a learned convex domain, and only input motion that reaches the boundary changes the plastic component. This creates a nonexpansive, rate-independent memory that should suppress unstable state growth and make the representation depend on meaningful cumulative changes rather than arbitrary update frequency.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a targeted barrier or hinge loss to an existing attention or graph-mixing matrix that penalizes violations of signed circular-minor inequalities. Instead of enforcing only generic entrywise positivity, constrain higher-order noncrossing interactions encoded by determinants. This can suppress pathological oscillatory mixing while still allowing individual entries to be negative when the global structured sign pattern permits them.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Augment each token or graph node with a periodic latent position x_i and phase θ_i, then evolve these variables before attention or message passing. Tokens with similar phase attract in x, while tokens with similar position synchronize in θ, producing self-organized groups without an externally specified clustering objective. The coupling strengths J and K provide interpretable controls for aggregation and synchronization, and their sweep should expose the paper's four collective regimes and…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the unconstrained parameter update of a selected neural layer by a tangent update generated by a rank-two skew-symmetric operator. A Cayley transform then applies this operator while exactly preserving a quadratic parameter energy, preventing exploding or vanishing layer norms without projecting after every step. Add a separately trained scalar gain if fixed norm would otherwise reduce expressivity.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a standard permutation-invariant object pool with a latent state on an unordered configuration together with a fiber vector transported along the observed object trajectories. The instantaneous state remains invariant to reordering, but loops and exchanges of objects act through learned monodromy matrices, allowing the network to represent path-dependent interactions without assigning arbitrary permanent object indices.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace or augment geometric attention on spatial or point-cloud tokens with a positive fractional kernel containing the paper's inverse-square origin factor. This gives tokens near a designated singular center a controlled increase in receptive-field influence while preserving a scale-invariant distance decay, which may help models represent cusp-like fields, radial singularities, and multiscale spatial interactions.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace a dense learnable Fourier multiplier with a low-parameter multiplier concentrated near the common zero set of two polynomial constraint symbols. A linear constraint together with a cubic constraint can produce straight or curved frequency loci, allowing the network to represent directional long-range structure while using far fewer spectral parameters than a full 3D frequency grid.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Insert a differentiable intersection-body-inspired map on positive spherical feature fields. The map contracts high-order angular variation while leaving degree-two ellipsoidal structure neutral, providing a principled alternative to generic smoothing that does not erase global anisotropy.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace or augment entropy-based MoE load balancing with a structured concave utility over expert loads. The utility is the geometric mean of positive linear coverage factors, so it rewards underused directions strongly while exhibiting diminishing returns for already-covered directions. Positive coefficients can encode expert capacity, hardware placement, or expert groups.
Useful6/10
Difficulty3/10
Novelty7/10
✗ Mechanism failed
2026
Use sign choices over redundant gradient or adapter proposals to keep the accumulated residual update small in the coordinatewise maximum norm. Constrain the sign controller to preserve a positive projection onto the desired descent direction, so it suppresses coordinate spikes without completely canceling optimization progress.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a quotient-aware representation layer that separates changes caused by motion along a symmetry orbit from changes that are genuinely informative. The layer estimates orbit tangent directions from known group actions or a learned local transformation group, projects features onto the metric-orthogonal normal space, and trains the representation to be invariant along orbit directions. Unlike ordinary global pooling over augmentations, this construction is local and can adapt when orbit…
Useful6/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Build a recurrent block as a fixed or learned ordering of local vertex foldings, mirroring the paper's identification of staircase solution maps with Coxeter elements of a folding group. Each folding changes one polygon coordinate by a rational cross-ratio completion while leaving all other coordinates unchanged. The resulting structured recurrence is reversible and can support constant-memory backpropagation by recomputing folds in reverse order.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a hidden state as complex-valued points on a two-dimensional lattice and replace unconstrained local updates by the exact harmonic-quadrilateral completion rule from discrete conformal geometry. Given three corners of a plaquette, compute the fourth corner by a Mobius-rational formula enforcing cross-ratio minus one, then use a learned readout or forcing term for task-specific predictions. The layer supplies a hard geometric inductive bias and a directly measurable local constraint…
Useful6/10
Difficulty6/10
Novelty8/10