✗ 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
Attach an RNCOA-inspired collision loss to a neural trajectory or control-policy head that predicts the pose of a rigid vehicle over time. For each obstacle and time step, aggregate the signed obstacle coordinates of all body vertices using max/min operators, and introduce two nonnegative side slacks whose sum is constrained to at most one. This models the disjunctive fact that the complete body should lie on one admissible side of an obstacle rather than independently penalizing every vertex.
Useful6/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a latent neural ODE with learned constraint functions whose time derivatives are forced to close linearly on the constraint family, making the zero level set invariant by construction. Integrate only the quotient-relevant coordinates while treating the constraint-generated characteristic coordinates as gauge variables, reducing latent dimension and suppressing long-horizon constraint drift.
Useful6/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Construct a sparse attention or message-passing graph as a gain graph, where every directed edge carries a relative frame label and reverse edges carry the inverse label. Grow the graph using the paper's 2-extension operation: replace two old edges by a new vertex connected to their four endpoints, while preserving the relative gain products. The resulting mask is intended to preserve global information flow under controlled sparsity and to avoid isolated components and brittle bridges commonly…
Useful6/10
Difficulty6/10
Novelty7/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 repeated multi-task training runs at different loss weights with pseudo-arclength continuation over stationary solutions of the weighted objective. Use homogeneous objective weights so that the algorithm can cross points where the conventional ratio of task weights diverges, then store the resulting network checkpoints as an approximate Pareto set.
Useful6/10
Difficulty8/10
Novelty7/10
✗ Mechanism failed
2026
Use the paper's third-order phase-locked-loop equations as a recurrent neuron instead of a leaky integrate-and-fire unit. Emit a spike whenever the phase crosses a chosen threshold, allowing one state trajectory to represent both slow burst envelopes and fast within-burst oscillations.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a discrete or one-hot recurrent state table with a low-dimensional vector memory whose event embeddings are orthogonal whenever the corresponding events are mutually exclusive in an input exclusivity graph. The module uses continuous state vectors and can therefore target dimension \(d=\xi(G)\), whereas a discrete state encoding is lower-bounded by \(N\geq\chi(G)\). This should be tested on graph-defined formal-language recognition tasks, where the graph is known and the claimed…
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's edge-to-area incidence structure to choose a small set of geometrically independent simplices instead of processing every possible hyperedge. A greedy rank-increasing router retains a triangle only when its Jacobian adds a new direction, reducing higher-order message-passing cost while preserving diverse geometric information.
Useful6/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Store a convex object as a direction-indexed vertex tuple and implement composition of objects through componentwise Minkowski addition and nonnegative scaling. This creates a structured residual or compositional layer where convexification is nonexpansive, making perturbation amplification controllable and avoiding repeated generic geometric optimization.
Useful6/10
Difficulty4/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a directional attention head whose admissible slopes are leaves of an M-adic interval tree with a prescribed finite splitting number. Instead of evaluating all K directions independently at every spatial location, route each query through only the branch decisions of the tree and share feature projections among directions that remain in the same multiscale angular interval.
Useful6/10
Difficulty6/10
Novelty7/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 a dense or ad hoc sparse attention pattern with a circulant mask generated by the paper's carry word c(m,k). Every query attends to exactly m of k relative positions, and the selected positions are prefix-balanced, avoiding the large gaps and collisions produced by random sparsification. Use several Farey-related slopes across heads or layers to combine local, medium-range, and long-range coverage.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a static top-k MoE capacity rule with a router whose expert allocation evolves through a finite-domain coverage process. Experts with larger current occupancy can either receive more future capacity, intentionally amplifying specialization, or receive less capacity by reversing the size dependence, allowing a controlled test of the paper's asymmetry-amplification mechanism.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace or augment standard sinusoidal or RoPE position features with bracket-quadratic phases $e(-\theta n\lfloor\beta n\rfloor)$ generated by a Heisenberg nilmanifold orbit. Multiple irrational coefficients and output frequencies produce a cheap deterministic encoding whose empirical cross-position correlations should exhibit cancellation instead of the periodic aliasing of rational or finite-frequency encodings.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Construct a Fourier layer whose active frequencies lie on several nonparallel polygonal patches or thin annular sectors, and cap repeated difference vectors generated by pairs of patches. The bounded-multiplicity geometry limits how many input frequency pairs can contribute to the same output frequency, potentially reducing spectral aliasing and gradient variance in nonlinear Fourier mixing.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a fixed multiscale router that maps 2D coordinates to 3D voxel coordinates using the paper's X-shaped self-similar refinement. Use the router to run a 3D feature field or volumetric token mixer over a 2D-organized tensor, while retaining a mathematically controlled locality bound instead of an arbitrary flattening permutation. The first target is a 3D neural field or small voxel classifier where the router replaces either a dense 3D feature table or a naive raster-order token layout.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a complex latent vector x in C^d by squared magnitudes of m learned complex linear projections. Set m equal to 2d: the paper proves that m less than or equal to 2d minus 1 cannot generically preserve the latent up to global phase, whereas m equal to 2d is generically sufficient, giving a principled minimal width for a phase-invariant neural bottleneck.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
For a neural model whose outputs lie on a d-dimensional analytic family in a very high-dimensional space, replace the full output vector by 2d+1 or a modestly oversampled number of fixed Gaussian scalar measurements. The paper's theorem predicts almost-sure injectivity in the noiseless setting, so an inverse network or decoder can recover the same latent instance without processing the full observation. Because the theorem does not provide a noise-stability constant, use M=4d+8 or M=8d in the…
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace independent token scores with a query-conditioned positive-semidefinite low-rank quadratic score over a fixed-size selected subset. Repeatedly convert the quadratic objective into a linear exposure vector and apply a cheap top-k oracle, allowing the selector to model joint token interactions without constructing an n-by-n attention matrix. The margin between the current low-dimensional shadow and alternatives provides a practical confidence or early-stopping signal.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the layer at which persistent connected components and holes disappear to allocate capacity nonuniformly across a network. If representations simplify much earlier than desired, widen the responsible layers or insert an additional block; if simplification is excessively delayed, avoid spending parameters there. This turns persistent-homology COM into an actionable architecture-search signal rather than a post-hoc visualization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a large flat positional-embedding table with a recursively decoded nine-way address whose child transformations contract coordinates by exactly 1/3. Encode an input position using features attached to the address prefix at several depths, guaranteeing that increasing depth produces a geometrically localized representation and that an infinite valid address cannot ambiguously represent two distinct points. This is especially suitable for 2D vision tokens, maps, point clouds, or…
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Replace raw hyperbolic embedding-radius regularization with a dimension-aware effective-radius target. For embeddings concentrated near hyperbolic radius rho in an n-dimensional hyperbolic space, regulate s times log(sinh(rho) / sqrt(n)) rather than rho itself, and use the same quantity to calibrate distance-logit temperature. This should make hyperbolic metric-learning behavior more invariant when embedding dimension, curvature, or model scale changes.
Useful5/10
Difficulty4/10
Novelty6/10