△ Mechanism confirmed, baseline not beaten
2026
Augment each recurrent or state-space hidden channel with a two-dimensional oscillatory state and periodically compute a pseudo-phase from its Cartesian coordinates. Use sparse event-triggered feedback to reduce the squared phase order parameter, preventing hidden channels from synchronising while avoiding the computation and communication cost of continuously recomputing the control signal. The controller acts as a tangent rotation of each two-dimensional hidden state, changing phase diversity…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Represent hidden features with several local orthogonal or unitary frames, and let group-valued transition maps align neighboring experts. Instead of forcing every expert to learn a globally coherent coordinate system, train local experts independently and impose a patching constraint that produces a globally consistent feature field. This is especially suitable for graph neural networks on data with heterogeneous local geometries or mixture-of-experts models whose experts specialize by region.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a positively homogeneous convex network by representing every intermediate unit as a compact polytope and composing units with Minkowski sums, convex-hull unions, and positive dilations. This gives an explicitly convex and monotone architecture whose geometric complexity can be controlled independently of the number of sampled linear pieces, potentially producing smaller ICNNs for structured convex functions.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a predicted convex object by one point per prescribed unit direction and decode it as the convex hull of those points. Enforce direction-wise maximizer inequalities so every point is a genuine vertex, then use the covering-radius bound to choose the number and placement of directions according to the desired geometric accuracy.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Construct a sparse radius graph over input samples or learned node embeddings, compute its cycle space, and remove the subspace generated by sufficiently short cycles. Feed the remaining quotient-cycle coordinates or Betti-rank estimate to a graph neural network as a global topological feature, or use them to guide pooling so that local redundant loops are collapsed while global loops are retained. The paper predicts that the threshold L approximately equal to |log r| graph hops is the critical…
Useful7/10
Difficulty6/10
Novelty7/10
Unverified
2026
Propagate uncertain inputs or parameter perturbations through a neural network with zonotopes, and choose the reduction rule after each layer using short lookahead that predicts downstream certified-bound error. Candidate reducers can include largest-generator retention, box conversion, and norm-based merging; unlike a fixed policy, the chosen rule depends on the current generator geometry and remaining network depth. The goal is tighter robustness bounds at the same generator budget, or the…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a neural field or neural operator with a bank of localized, divergence-free moving packets whose radius and amplitude follow the Hill scaling rather than ordinary Gaussian scaling. The packet coefficients can represent unresolved flow corrections while keeping their L^2 contribution approximately invariant under refinement, preventing fine-scale features from becoming numerically negligible or explosively large.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Construct a routed neural state update from a collection of branch maps whose inverse-style refinement operators are uniformly contractive. The discrete routing sequence acts as an expandable symbolic code, while contraction makes the continuous state associated with a long routing history insensitive to initialization and earlier perturbations. Use a finite active top-\(K\) set during training, but retain an expandable branch table so the model can represent increasingly complex or rare modes.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the trace representation of a maxout network to regularize the geometry of its generated coefficient vectors. Encourage active traces to be diverse and nonredundant, so the model spends parameters on genuinely different supporting hyperplanes rather than branches that collapse to the same linear function.
Useful6/10
Difficulty5/10
Novelty8/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
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
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
Add a finite-resolution geometric code to a 3D neural encoder: quantized lattice occupancy, local barycenters, and tangent directions are converted into structural tokens alongside ordinary point or mesh features. Choose lattice spacing from estimated local reach so that small perturbations do not change the code, and train the continuous encoder to agree with this discrete structural representation.
Useful5/10
Difficulty5/10
Novelty7/10