✗ Failed on benchmark
2026
Replace an unconstrained graph-message-passing block with a port-Hamiltonian layer whose edge interactions are generated by a skew-symmetric formation-matrix coupling and whose node damping is positive semidefinite. The layer can model relative graph structure while preventing unforced hidden-state energy growth, reducing exploding activations and oversmoothing caused by arbitrary repeated propagation.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace selected residual, recurrent, or state-space blocks by modules whose input-output Jacobians satisfy an IODP inequality throughout a prescribed activation domain. The constraint controls incremental amplification between two trajectories without requiring either trajectory to remain near one fixed equilibrium, so it should improve robustness to changing contexts and prevent exploding long-horizon sensitivities.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace dense attention over structured object tokens with attention over role-filler tensor-product representations. A learned query specifies both a role and a filler, retrieves objects matching that binding, extracts a target role, and rebinds the extracted filler into an output object.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace derivative-based latent-dynamics fitting with an integral regression and maintain a history stack selected by the smallest eigenvalue of its information matrix. The model should perform aggressive parameter updates only when the estimated latent regressors are sufficiently exciting, while a perturbation bound prevents false excitation caused by inaccurate hidden-state estimates.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural barrier function that certifies a lower bound on the probability of reaching a target before entering an unsafe set, uniformly over an entire compact set of initial states. Add boundary and expected-drift penalties to a learned world model or policy, and enforce a positive slack margin rather than fitting only pointwise trajectories. The mechanism should improve safety under distribution shift because the certificate constrains one-step stochastic transitions throughout the…
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained graph residual update with a reversible master-equation update on a nonnegative latent mass vector. Each edge transfers mass in two directions with rates tied by detailed balance, so the layer preserves total mass, preserves nonnegativity under an appropriate discretization, and relaxes toward a learnable equilibrium while dissipating a specified free energy. This is suitable for iterative graph inference, diffusion-like architectures, and probability-valued hidden…
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add an observability objective to an RNN so that a finite trajectory of selected hidden coordinates preserves information about the initial hidden state. The regularizer maximizes the smallest singular value or log determinant of the finite-horizon observation Jacobian, counteracting ReLU activation masks that erase hidden-state directions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace single-Gaussian uncertainty propagation in a neural state-space or world model with a finite mixture of Gaussian latent states. Each component is propagated through the learned nonlinear dynamics, and components are merged or pruned only when their Wasserstein discrepancy is below a prescribed tolerance, preserving multimodal futures while keeping computation bounded.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural dynamical surrogate not only to reproduce measured trajectories, but also to reproduce the plant's economically optimal decision and objective value. Add a differentiable decision loss obtained by solving the surrogate's inner optimization problem, and reject models that fit observations while producing extra local optima or a shifted optimum.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a full-resolution global flow-matching or diffusion model with a hierarchy of local velocity fields operating on progressively finer grids. Coarse levels generate long-wavelength structure and pass it to fine levels through upsampling and residual conditioning, while every velocity network uses only a locality radius prescribed by the RG bound. This should preserve long-range correlations without quadratic global attention or a full-resolution global receptive field.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Augment an RNN or state-space model with a three-dimensional auxiliary spin updated by noncommuting rotations associated with event types or token classes. The ordered product preserves information that additive counters discard: two sequences with the same number of each event can produce different final spins when their event order differs. Train the spin axes, angles, and readout jointly with the task model while constraining every update to remain on the sphere.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Use the condition discriminator's residual and predictive variance to decide which unlabeled streaming samples may update a model at deployment. Only samples whose condition prediction is both calibrated and close to the currently expected condition are admitted, preventing unreliable operating regimes from causing catastrophic test-time drift.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Distill the expensive inner minimization over state-estimation errors into a neural correction term that predicts the robust barrier drift, then fine-tune the correction using differentiable closed-loop rollouts. This retains the robustness mechanism while reducing the repeated optimization cost and allowing less conservative behavior than fixed analytic uncertainty bounds.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace correlation-based memory pruning in an RNN or state-space model by measuring how hidden-state history changes the response to individual past input events. Train a compressed memory coordinate only if it preserves the event-consequence kernel for the target observable, such as future loss, prediction, or control return. A memory representation is accepted when the conditional variance of this kernel within compressed-state groups is small, even if dwell-time or autocorrelation…
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
At a learned switching hyperplane, replace ambiguous hard routing by a convexified vector field whose normal component is zero whenever neighboring vector fields point toward the surface. This gives a non-chattering approximation of Filippov sliding and can improve long-horizon integration near friction thresholds, impacts, and climate regime boundaries.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace the global EMA update for each linear-layer momentum matrix with a delta-rule update that learns the current output-side gradient value only along the current input-key direction. Frequently occurring directions are corrected repeatedly, while rarely visited directions are not unnecessarily overwritten or uniformly decayed. Use the resulting matrix as the ordinary momentum buffer in SGD, AdamW, or another optimizer.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach one neural value head to each generalized reach-avoid subtask and compose these heads into a critic for sequential or timed temporal-logic goals. The policy is trained to increase the composed value while an auxiliary Hamilton-Jacobi residual trains each local head against the learned or known dynamics. This replaces a single poorly conditioned long-horizon objective with short-horizon certificates whose composition has an explicit logical meaning.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a fixed robust-RL ambiguity radius with a radius computed from the agent’s current belief over environment models. High posterior entropy enlarges the Wasserstein uncertainty set and suppresses catastrophic actions; posterior concentration automatically reduces conservatism and approaches ordinary expected-reward planning.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Train or sample a neural state-space model in trajectory space rather than drawing complete rollouts independently. Construct a space-time path graph whose vertices are latent states and local transition events, then update connected clusters of the entire trajectory using conditional Gibbs or Swendsen-Wang-like moves while preserving fixed initial, terminal, or event-count constraints. This should replace exponentially small forward-rollout success probabilities with local conditional updates…
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Split a learned transition model into a contractive nominal branch and a high-capacity excursion branch, and blend them using calibrated epistemic uncertainty. The nominal branch is used exclusively in the well-supported region, while the excursion branch is activated when the current latent state leaves that region, preventing flexible model errors from being recursively amplified during ordinary rollouts.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train or evaluate a neural dynamical model using many independently restarted finite-precision trajectories instead of one very long rollout. Detect repeated hidden states or quantized state hashes and terminate a segment before its digital transient-plus-period scale, preventing duplicate futures from dominating Lyapunov, loss, and long-horizon forecast estimates.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Build a neural ODE or invertible transformation whose primitive layers are flows of learned gradient vector fields, then synthesize non-gradient directions using short Lie-bracket commutator products. The paper's bounded-bracket-generation result predicts that restricted gradient primitives can approximate a much larger class of diffeomorphisms than a plain stack of gradient flows.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single recurrent state update with fast feature relaxation, activity evolution, and a slow adaptive state that modulates the activity vector field. Tune the activity subsystem near a controllable saddle-node so that it retains a useful transient regime for a predictable number of steps, enabling delayed switching and long-horizon memory without requiring a large hidden state.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace Euler-Maruyama in a reverse diffusion sampler with an interval transition that freezes the neural posterior-mean prediction but integrates the known linear drift and Gaussian noise exactly. The resulting exponential integrator should tolerate larger timesteps, particularly when the reverse dynamics are stiff in high-noise or strongly anisotropic directions.
Useful8/10
Difficulty5/10
Novelty5/10