✗ Mechanism failed
2026
Add a bounded probing perturbation to the inputs or intermediate outputs of a neural sensor-fusion model, and choose the perturbation by maximizing separation between the predicted trusted-output set and output sets induced by candidate sensor attacks. Bounded feature and measurement uncertainty are propagated through local neural Jacobians as zonotopes, giving a conservative, geometry-based exposure objective rather than relying on random noise. Training can use the resulting margin as a…
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural operator from frozen ambient mechanism blocks and a geometry-specific algebraic constraint adapter. The adapter parameterizes all outputs in the affine set satisfying sampled linear constraints exactly, so the network never produces boundary-violating states and does not require a penalty coefficient or post-step projection.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use a learned scalar ordering function to turn a symmetric local Gaussian graph kernel into a directed, row-stochastic message-passing operator. The asymmetric tilt lets neighboring nodes communicate preferentially along an inferred dynamical direction, while the Gaussian factor retains locality and diffusion-like smoothing.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained edge-feature residual update in a graph neural network with separate cut-space and harmonic-space updates. The cut branch carries transfer information visible at nodes, while the harmonic branch models cycle circulation and can be given an independently chosen contraction rate, preventing persistent or unstable circulation features from contaminating node predictions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Construct a recurrent or state-space neural module whose latent dynamics are initialized from a mechanistic approximation of the target system rather than from an isotropic random matrix. For traffic-like interacting systems, use a graph reservoir with car-following-inspired relative-position and relative-velocity terms, drive it with undersensed observations, and train a linear or low-rank readout. The mechanism preserves nonlinear state encoding while enforcing an echo-state contraction…
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build a complex-valued recurrent or graph-neural layer whose hidden state evolves under a fixed graph Schrödinger operator and is exposed to the downstream network only through coordinate magnitudes at several times. Choose the diagonal potential so that the spectrum has unique unordered pair sums, the squared-eigenvector matrix is invertible, and every eigenvector pair overlaps in at least one observed coordinate; the resulting temporal intensity code is theoretically injective up to one…
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Wrap a neural multi-agent policy with an analytic planner that generates turn-straight trajectories tangent to pursuer surveillance disks, then selects the branch with the smallest predicted completion time. The network supplies high-level preferences or residual corrections, while the geometric layer prevents unnecessarily entering exclusion regions and exposes an explicit branch-switching signal for training.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural surrogate to predict outputs in a source-domain ZCA-whitened space, then adapt to a shifted domain using only the shifted domain's output mean and covariance. At inference, transport the network prediction through the target covariance square root, yielding a weight-free correction that preserves output-coordinate semantics and can be applied to MLP, CNN, graph-NN, or transformer regressors.
Useful7/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace independent per-sensor temporal encoders with a shared two-dimensional transform whose temporal and spatial phase channels remain algebraically distinguishable. Train a neural residual detector and localization head on the transformed coefficients, forcing perturbations with the same temporal signature but different positions to differ primarily in their spatial phase.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Insert a differentiable reaction-diffusion layer that converts dense token or pixel features into sparse, spatially coherent routing masks. Two competing orientations form complexes through conserved monomer reservoirs, so local assignments can cluster while opposite assignments mutually exclude one another instead of independently activating at the same location. The layer can be used as a soft-to-hard MoE router, attention-mask generator, or object-part grouping module.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Attach a local BCM-trained binary adapter to a pretrained or frozen encoder, allowing new graph nodes or streaming examples to acquire representations without backpropagating through the main network. The adapter learns only from positive co-occurrence statistics and maintains sparse codes, providing a low-memory continual-learning path.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Represent every predicted displacement and velocity as the sum of a prescribed boundary lift and a learned residual that is identically zero on the Dirichlet boundary. Feed the boundary velocity into the model through an explicit distributed-port feature and train an energy-balance residual so that the learned interior dynamics cannot inject arbitrary energy at the constrained boundary. This should eliminate boundary drift and reduce the burden on penalties or projection layers.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Insert a differentiable implicit layer that maps boundary features to an interior latent field by solving a discrete sinh-Gordon equation. The paper's second-order convergence result motivates using a symmetric five-point discretization and a damped Newton solve rather than asking a neural network to learn the entire interior field directly.
Useful6/10
Difficulty6/10
Novelty7/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
Unverified
2026
Replace independent Bernoulli branch dropout in a tree-structured mixture or hierarchical MLP with connectivity gates sampled from a q<1 wired random-cluster model. The q<1 law provides conditional negative association across branches, so increasing statistics of disjoint branches have nonpositive covariance; this should reduce redundant expert activation while preserving structured stochastic exploration.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Build a graph diffusion or neural-operator encoder whose sparse-observation loss is weighted according to graph distance from the observed nodes. For early diffusion times, suppress supervision or cross-attention demands that are geometrically impossible because signals at distance \(d\) are attenuated like \(e^{-d^2/(2t)}\); gradually release those constraints as diffusion time grows.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent each feature as belonging to one of three \(\mathbb{Z}_3\) charge sectors and constrain every linear and multiplicative operation to obey charge addition modulo 3. Add invariant cubic gates such as \(x_1x_2x_3\) or \(x_q^3\), which can express the same phase-insensitive interaction selected by the paper's three-photon drive. This should improve data efficiency and exact cyclic-augmentation consistency when the task has a genuine ternary symmetry.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Use the paper's topology-dependent Laplacian spectral bound to set the diffusion horizon of a graph neural network instead of using a fixed number of message-passing steps for every graph. For genus-g graphs, choose the horizon from the conservative slow-mode timescale n/(Delta g), while separately capping the step size to keep high-frequency modes stable.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace independently sampled random-walk paths used for GNN neighbor or subgraph sampling by persistent rotor walks on the training graph. Each node stores a pointer into a fixed cyclic ordering of its outgoing neighbors; every visit advances the pointer and selects the next neighbor, producing deterministic coverage with no repeated random choices. Use several short rotor trajectories per seed and periodically reinitialize only the rotors in an encountered subgraph.
Useful5/10
Difficulty4/10
Novelty6/10