✗ Failed on benchmark
2026
Replace a dissipative optimizer update with a canonical discrete flow on the extended state $(\theta,p,t,e)$, where $\theta$ are network parameters, $p$ is momentum, $t$ is training time, and $e$ is its conjugate energy variable. Use a symmetric composition of exact Hamiltonian subflows for kinetic energy, loss, and time translation; this preserves the extended symplectic form and avoids artificial phase-volume collapse. Weak restarts or occasional damping can be added separately if convergence…
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a neural feedback law together with explicit well-posedness barriers, then certify the resulting closed loop using a common quadratic Lyapunov and activation-sector certificate. The controller is deployed only if the certificate proves exponential decay or a discounted quadratic-cost bound, converting training into a falsifiable stability-constrained synthesis procedure.
Useful8/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained stack of learned vector-field or tensor-field maps by a short neural complex whose fixed differential operators satisfy D_{k+1}D_k=0. The network predicts potentials or quotient representatives, making curl-of-gradient, divergence-of-curl, compatibility, and gauge constraints exact rather than penalty-based.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained neural flux Jacobian with a matrix of the form \(A(u)=H(u)^{-1}S(u)\), where \(S(u)\) is symmetric and \(H(u)\) is the positive-definite Hessian of a strictly convex entropy. Because \(A(u)\) is similar to a symmetric matrix, every characteristic speed is real. Reconstruct the flux by integrating this Jacobian along a fixed path from a reference state, and use the resulting module inside a differentiable finite-volume solver or learned dynamical model.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained RNN or state-space layer with an implicit recurrent cell whose nonlinear algebraic loop is well posed and whose forward dynamics are contracting and strongly input-output monotone. The same certificate guarantees a causal inverse with bounded gain, so sequence predictions should be insensitive to initial-state mismatch while remaining responsive to input perturbations.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent or state-space transition with a finite set of mode matrices selected by a Markov routing process, while explicitly constraining the associated Kronecker operator to have spectral radius below one. This targets exploding hidden-state variances caused by rare but repeatedly visited unstable modes, a failure mode not detected by average spectral radius or ordinary Lyapunov stability.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace scalar FedAvg synchronization with matrix-weighted synchronization that averages only a designated shared parameter subspace and leaves client-specific directions unconstrained. Use the paper's cut condition to detect whether every client partition has enough communication support to synchronize the shared directions; this prevents apparently connected federated graphs from silently failing to align important low-rank parameter modes.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent or state-space update with a block whose state Jacobian is contractive and whose input Jacobian has a controlled gain. This should make hidden-state discrepancies caused by initialization, quantization, or input noise decay geometrically rather than explode, while retaining a finite and predictable response to persistent input perturbations.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace the ordinary average of task or client gradients with an iterative spectral filter that removes tasks whose gradient vectors explain an anomalously large covariance direction. The global model uses the filtered gradient, while each task still maintains its own personalized parameters and local optimizer state. Unlike parameter-center regularization, the robustification acts directly on the vector messages and is designed to avoid an additional \(\sqrt d\) contamination penalty.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Use the behavior-subspace gap as a trust-region constraint when applying a shared update to multiple recurrent modules or experts. A proposed common update is accepted only when post-update behavior subspaces remain close to their leader and their graph subspaces remain sufficiently transverse, preventing one shared optimizer step from destabilizing dynamically different members.
Useful7/10
Difficulty6/10
Novelty9/10
△ Mechanism confirmed, baseline not beaten
2026
Run several heterogeneous recurrent or state-space network copies and couple their hidden states through a directed hypergraph with proportional and integral feedback. The proportional term contracts disagreement, while the integral state rejects persistent replica-specific biases that ordinary consensus coupling can only bound. This creates a controllable synchronization-versus-divergence transition rather than an unstructured regularization coefficient.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Train a low-dimensional projection of embeddings against centered pairwise geometry instead of only using raw-distance preservation or a JL-style guarantee. The loss removes the population or minibatch distance baseline before comparing distances, forcing the bottleneck to retain the fluctuations that carry ranking and task information.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
When a model, dataset, or parameterization has an involutive symmetry, transform gradients and curvature into symmetry sectors before applying adaptive updates. The Hessian and optimizer can then be handled as independent even and odd blocks, preventing curvature from one sector from forcing an unnecessarily conservative learning rate in the other.
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace independent feature, expert, or edge dropout by sampling subsets from a forest-induced strongly Rayleigh distribution. The distribution is multiaffine and negatively dependent, so selecting one computational route suppresses redundant correlated routes without the positive correlations created by independent or blockwise heuristics. Use the sampled subset as a structured mask during training and compare it against Bernoulli dropout at equal expected sparsity.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Train a recurrent neural network or state-space model using a Poincare-style event loss: identify two consecutive latent alignment events and require the latent position and velocity at the second event to equal a transformed version of the first. Evaluate the Jacobian of this return map and penalize unstable non-neutral Floquet multipliers, producing long-horizon trajectories that are both periodic or symmetry-periodic and locally stable.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary row-softmax attention with a doubly stochastic Sinkhorn attention plan W, and periodically recover a gauge-fixed pairwise cost from W using the exact double-centering identity. Use this recovered cost to initialize or regularize a structured attention score, making the attention geometry identifiable despite arbitrary query and key row and column offsets.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Support conjunction queries over multiple roles without explicitly storing a huge tensor of repeated objects. Represent the required higher-order memory through query-dependent contractions, enabling compositional retrieval with memory that scales linearly in the number of objects.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add a resonance-estimation module to a recurrent network or state-space model and regularize the decay spectrum of its observable correlations. Instead of using eigenvalues of a small projected recurrent matrix as memory timescales, estimate dominant poles from multi-step correlations and a resolvent/Krylov fit, thereby remaining valid when projection eigenvalues are ill-conditioned or hidden resonances occur. The method is intended to preserve useful long memory while suppressing unstable or…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat a recurrent or state-space network as a locally linear dynamical system and select a small set of hidden-state or module coordinates that have unusually high leverage on a target output through a dominant unstable or weakly damped eigenmode. Use the ranking both for red-team targeted perturbations and for defense: penalize, prune, or damp selected coordinates so that target amplification is reduced without uniformly shrinking all recurrent dynamics.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition by a ring-coupled cubic vector field whose radial component drives hidden states toward a prescribed sphere. The angular component remains trainable and can encode information, while the radial Lyapunov dynamics suppress exploding and vanishing state norms during long rollouts.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed learning-rate and momentum rule with a low-order dynamic feedback controller mapping gradients, optimizer state, loss trends, and parameter statistics to the update magnitude. Synthesize or fit the controller against structured uncertainty in curvature, gradient noise, minibatch delay, and layerwise scaling, then enforce a worst-case closed-loop gain below one. This targets catastrophic optimization failures caused by combinations of uncertainties that are not visible in a…
Useful7/10
Difficulty8/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a multi-input interaction by several single-input edge channels and enforce conservation only after their signed contributions are summed at the vertices. This provides a neural architecture for composite interactions in which different channels have different drivers, while preventing the node update from inventing or destroying net internal flow.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Constrain recurrent preactivations to remain nonnegative so that ReLU acts as the identity along realized trajectories. The hidden dynamics then admit a classical linear observability matrix, allowing principled hidden-coordinate selection and conditioning control instead of relying on potentially destructive activation masks.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a dense Koopman autoencoder latent with a sparse code whose active-coordinate support can represent the local dynamical regime or basin. Train reconstruction, latent linear prediction, and multi-step rollout losses jointly; use the learned support as a label-free regime variable and optionally select a local transition matrix for forecasting.
Useful7/10
Difficulty5/10
Novelty5/10