Unverified
2026
Build a one-dimensional recurrent or neural-ODE model whose global generator is a sum of translated nearest-neighbour operators H = sum_i h_(i,i+1), and penalize the three-site Reshetikhin residual. The resulting model is encouraged to conserve its total local energy current, which should reduce secular errors in long-horizon rollout while retaining a local, parameter-efficient interaction structure.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a distribution-level loss that encourages a model's improved outputs \(Q\) to compensate for any regressions relative to baseline outputs \(P\). A weighted attribute decrease is allowed only when the coupled batch contains enough weighted increases, controlled by tolerance \(\gamma\); this is more expressive than requiring every attribute to improve independently.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a conventional graph message-passing layer with a finite-horizon stochastic propagation process containing susceptible, infected, and removed feature states. Messages spread along active infected-to-susceptible edges, while infected nodes are simultaneously deleted at a rate proportional to their susceptible-neighbor count. This provides explicit propagation control and anti-oversmoothing dynamics instead of repeatedly averaging over every neighbor.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an expensive global resolvent calculation for a recurrent or state-space transition operator by measurements on overlapping finite patches. Penalize patches whose shifted operator has small minimum gain, while adding the paper's explicit O(1/n) truncation penalty so that increasing the patch size produces a predictable tightening of the stability certificate. This targets non-normal transient amplification that is invisible to ordinary eigenvalue or spectral-radius regularization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use three learned state-transition operators corresponding to three data axes, and train them to satisfy the paper's pullback-style interchange rule. For every local pair of axes, two successive updates should reach the same square state; for triples of axes, all six update orders should agree. This reduces sensitivity to scan direction and limits long-horizon drift caused by inconsistent local transitions.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace arithmetic averaging of feature covariances by the weighted Bures–Wasserstein barycenter of several SPD covariance matrices. The layer aggregates covariance statistics from augmentations, heads, channels, or local patches in a way that respects the geometry of centered Gaussian feature distributions and remains invariant under congruence changes of coordinates.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add an action-level exploitability penalty to alternating training of two neural policies that play against each other. For each observed state, estimate the value of forcing every available action against the opponent's current policy, then penalize positive gaps from the player's minimax value rather than relying only on the sampled action or episode return. This should expose locally exploitable decisions earlier and reduce oscillation between adversarial policies.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Insert an additive noise layer on a discrete latent space G, choosing the noise distribution g so that the convolved latent distribution f*g is symmetric under inversion while keeping H(g) small. For binary or nearly binary categorical latents, use the paper's explicit sparse cyclic-group construction instead of uniform augmentation, preserving symmetry with substantially less randomization.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained quadratic interaction between channel derivatives with a learnable combination of Lorentzian and antisymmetric null forms. For wave-equation surrogates, this enforces exact cancellation when two interacting features have parallel null directions, suppressing resonant derivative products that otherwise cause unstable long-horizon rollouts.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace static mixture-of-experts routing weights with positive expert abundances that undergo phase-dependent birth, death, and crowding. Each expert has an internal phase and natural frequency; experts aligned with the population order parameter receive larger effective abundance, while a logarithmic penalty prevents runaway replication. The mechanism creates a measurable synchronization transition and can serve as a differentiable alternative to hard top-k routing.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use normalized scheduling variables and explicitly cap the degree of their products in a neural LPV or mixture-of-dynamics model. Instead of allowing every multiplicative interaction between scheduling coordinates and past or future features, retain only monomials below a chosen degree threshold. This produces a controllable approximation knob between a purely linear model and a full lifted predictor, while avoiding unstable extrapolation caused by poorly scaled high-degree features.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace random edge dropout in a GNN with an order-aware filtration that removes edges in decreasing local spectral coherence. High-coherence edges are those whose rank-one Laplacian perturbations align strongly with the current local Laplacian, so their removal creates structured, spectrally meaningful augmentations rather than arbitrary damage. Train the GNN jointly on the original graph and several filtration states using supervised loss plus prediction or embedding consistency.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a directional optimal-transport penalty that discourages samples from a model distribution P from exceeding samples from a reference distribution Q in task-relevant coordinates, while allowing a calibrated amount of violation controlled by γ. Unlike symmetric Wasserstein matching, the loss distinguishes harmful upward or downward deviations and can encode that one predictive or reward distribution should dominate another.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Attach vector-valued local features to simplices, nodes, edges, or hyperedges and penalize violations of sheaf restriction maps that should make local predictions agree on shared higher-order structures. Evaluate the compatibility loss on progressively degraded subcomplexes, producing a persistence-style robustness objective that rewards features whose global consistency survives structural failures.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Compute a translation- and rotation-robust perimeter feature from the Euler Characteristic Transform and append it to learned shape features. Unlike a finite-radius ECT comparison, the point-anchor subtraction cancels the constant Euler-characteristic tail exactly, eliminating the need to tune a spatial cutoff.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Correct minibatch or trajectory-based categorical entropy estimates using the paper's power-law occupancy asymptotic. The corrected estimate adds back entropy lost through unseen rare categories, with the correction magnitude inferred from the number of distinct observed categories and an estimated tail index.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Apply the paper's mechanism-contrast idea to ReLU decoders by requiring each piecewise-affine branch to produce a detectable and distinctive change across at least one activation boundary. Penalize branches with vanishing Jacobian jumps or nearly identical boundary signatures, discouraging observationally interchangeable decoder mechanisms.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's derivative-dispersion mechanism as a neural regularizer: the input-dependent forcing should produce different derivatives in different hidden directions. Penalize collapse of the Jacobian of the forcing map while retaining a contracting recurrent transition, so hidden states do not converge to a low-dimensional manifold caused by nearly parallel inputs.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace unconstrained output coordinates with a neural parameterization whose outputs are valid monotone profiles by construction, analogous to representing a Young diagram through nonnegative ordered row increments. Train the network against an explicit energy or negative log-probability while preserving the feasible geometry, rather than relying on penalties that permit invalid intermediate states.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Use attractor separation and noise-induced basin coalescence as a robustness test for recurrent networks with multiple learned memories or modes. Estimate the smallest perturbation amplitude at which initially distinct hidden-state attractors become geometrically indistinguishable, then train or operate below that threshold with a safety margin.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a single recurrent transition with a finite bank of candidate positive linear transitions and use a minimax controller to choose the feedback action at every time step. The controller evaluates candidate successors, selects the action whose worst-case predicted cost is smallest, and clips the action to preserve nonnegative hidden states. This should make an SSM or RNN less sensitive to transition-matrix mismatch and long-horizon disturbances.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
When the Schrödinger generator is learned, regularize its spectrum and eigenvectors so that the magnitude trajectory remains well-conditioned for recovering hidden complex states. Penalize small singular values of the squared-eigenvector matrix and near-colliding eigenvalue pair sums, preventing a learned dynamical layer from becoming spectrally invisible or phase-ambiguous.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a degree-conditioned neighborhood-profile penalty to a GNN so that its effective message-passing graph has a controlled hub-neighborhood trend. The regularizer can either target a rank-one null profile, where neighbor degree is approximately independent of root degree, or deliberately target a learned/reference logarithmic trend when preferential-attachment-like structure is useful.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Compute one-dimensional persistent homology and minimum-norm harmonic representatives, then use their absolute edge coefficients as topology-aware saliency in a graph transformer. Add the saliency to attention logits or use it as a soft regularizer so the model preferentially propagates information along edges that are essential to persistent cycles.
Useful6/10
Difficulty6/10
Novelty7/10