△ Mechanism confirmed, baseline not beaten
2026
Build an SPD classifier and residual head directly from Cholesky factors, using lower-triangular differences and matrix-power terms instead of generic eigendecomposition-based logarithm operators. This retains covariance geometry while making positive-definiteness automatic and backpropagation more numerically stable for minibatch training.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace Lorentz-hyperboloid tensors with proper-velocity tensors whose spatial coordinates can be transformed by standard Euclidean affine layers and activations. Reconstruct the Lorentz time coordinate only at manifold boundaries, preserving the hyperbolic representation while avoiding repeated projection, normalization, or fragile exponential-map calculations.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
For coupled recurrent or state-space modules that represent oscillatory or periodic signals, explicitly account for communication or attention delay in the characteristic equation. Tune the coupling gain or add a phase-lead compensator so that the desired latent frequency remains a closed-loop mode instead of being shifted by small delays.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Construct overlapping attention windows from a block design instead of using one dense sequence-by-sequence attention matrix. Every token appears in exactly $r$ windows and every token pair co-occurs in exactly $\lambda$ windows, giving uniform coverage and avoiding the uneven connectivity of arbitrary sparse masks.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a large diagonalizable recurrent or state-space transition operator by a sparse set of retained oscillatory modes selected according to their contribution to the output autocorrelation. Unlike magnitude-based pruning, the objective is to preserve the power-law return signal generated by pairwise spectral differences, enabling long memory with far fewer modes.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Split hidden dynamics into relaxation bands when the Jacobian spectrum has a gap, evolve each band with its own timescale, and retain an explicit cross-band exchange term. This yields a principled dual-timescale RNN or SSM rather than choosing fast and slow branches heuristically.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build an autoencoder whose decoder outputs a monotone quantile function rather than an unconstrained spatial field. The latent representation can be compressed with POD or a neural bottleneck in CDT space, while the decoder guarantees valid transport maps and therefore avoids negative densities, mass drift, and spurious oscillations common in unconstrained reduced-order neural decoders.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use small-gain diagnostics to jointly learn module normalization and a communication partition rather than imposing a fixed global spectral constraint. Clusters should be formed around high-gain feedback loops, because grouping weakly related modules cannot improve the certificate and only adds bookkeeping.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Modify a learned sparse encoder so that it distinguishes reliable group activation from unreliable child-ray identity. When test separation information is high but dictionary-orientation information is low, the model should output the active coherent group while abstaining on individual child labels, using a permutation- and sign-invariant support representation.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Grow a neural network by appending a trainable block together with an analytically initialized inverse block, so the newly added depth is exactly the identity at insertion time. After insertion, untie and optimize the two blocks independently; this preserves the current function while providing additional trainable degrees of freedom. For architectures with one expensive mixing operation followed by cheap channelwise blocks, the same construction can increase depth without repeatedly paying for…
Useful7/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Use the KS ratio to decide how many message-passing layers to execute per graph or per node, rather than selecting a fixed depth. In the subcritical regime, stop once the predicted remaining effect is below a tolerance; in the supercritical regime, continue until the observed logit change becomes small or a larger budget is reached.
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace raw molecular orientation vectors with local scalar features invariant under common three-dimensional rotations and the apolar transformation u_i -> -u_i. Feed these channels to a CNN autoencoder, VAE, or contrastive encoder so that configurations on the same physical symmetry orbit have identical inputs or latent codes. This should improve unsupervised phase discovery without supplying order-parameter labels.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a topology-controlled strategic communication layer into graph neural networks: each node maps a bounded latent scalar to either a clipped amplified signal or an interval-quantized message, with the amplification determined by how much influence the receiver exerts on the sender. Weakly influential communication channels should become aggressively quantized, while highly influential channels retain more resolution. This creates a principled variable-rate message-passing architecture…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a linear restoring drift in score-based sampling, latent dynamics, or stochastic regularization with a state-dependent nonlinear restoring term that is at least as contractive globally and more contractive away from the origin. This should reduce stationary variance without changing the worst-case local contraction certificate.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a complex-valued coordinate map q(x) whose components are harmonic and whose gradients are mutually null, then feed q(x) into an otherwise unconstrained neural function v. Any learned output of the form u(x)=v(q(x)) is analytically harmonic when the constraints are satisfied, so the network does not need to rediscover the Laplace structure from collocation data. This is especially suitable for two-dimensional elliptic PDEs, where q=x+iy is the canonical example.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent block with two coupled modules: a contractive perceptual estimator and an input-to-state-stable cognitive state transition. Spectral normalization and a controlled Euler residual step enforce a quantitative gain condition, preventing hidden-state explosion while retaining long memory when the contraction factor is chosen close to one.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace a fixed-depth all-accept verifier cascade with a depth controller calibrated to the latent distribution of per-instance false-accept rates. The controller should stop when the predicted reliability gain from another gate is smaller than its inference cost, avoiding the severe overconfidence caused by treating correlated verdicts as independent evidence.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a network head that independently predicts coupled physical source terms with a low-dimensional rate head followed by a fixed stoichiometric map. This makes conservation of total mass or other linear invariants exact by construction and leaves the network responsible only for learning the kinetics of admissible exchange channels.
Useful7/10
Difficulty3/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural dynamical block whose hidden state contains differential variables and Lagrange multipliers, with a singular descriptor matrix enforcing constraints during propagation. This avoids the drift and ill-conditioning that can arise when exact constraints are represented only by a penalty term.
Useful7/10
Difficulty6/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
✗ Failed on benchmark
2026
Constrain each member of a wide recurrent or neural-ODE population to use the same time-dependent vector field whose spatial components generate a finite-dimensional Lie algebra. Store m fundamental trajectories and one fixed invariant label per node, then reconstruct every node state with the Lie-Scheffers superposition map instead of integrating all n states independently. The resulting layer has an exact md-dimensional dynamical core and should preserve the full network trajectory up to…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Run the same neural decoder over several algebraically equivalent augmented graphs and aggregate their variable-level predictions. Each graph exposes different cycle structure and message routes, providing structured architectural diversity rather than ordinary random-seed ensembling.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Add auxiliary constraint nodes generated from linear combinations of existing constraints, creating a new message-passing graph while preserving the original feasible error set. Use a neural BP layer on the augmented graph so auxiliary nodes provide alternate paths around harmful cycles without changing the target constraints.
Useful7/10
Difficulty5/10
Novelty6/10