△ 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
Use the paper's stable periodic orbits and border-collision transitions as an intentional memory mechanism in a recurrent module. Different input-dependent parameter settings can place the same cell in fixed-point, period-2, or higher-period regimes, allowing a compact state to encode discrete modes without allocating one separate neural attractor per mode.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Regularize a neural continuous-time drift by the quadratic control energy required to move it away from a reference drift. Girsanov’s identity makes this an interpretable path-distribution constraint: expected normalized drift energy equals the relative entropy between controlled and reference trajectory laws.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Maintain a posterior over heterogeneous neural policies, simulate each policy on the same revealed disturbance sequence, and track a posterior-weighted counterfactual reference instead of directly switching among deployed policies. A stabilizing feedback correction keeps the physical state close to the reference, while exponential-weights updates favor policies with low counterfactual cost.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a neural policy with differentiable environment or data-generation parameters and optimize both using the environment-parameter policy-gradient theorem. The current transition is differentiated with respect to the design parameter, while the continuation value is evaluated under a frozen copy of that parameter; this isolates the local causal effect and avoids repeatedly differentiating through arbitrarily long rollouts. Suitable applications include learnable domain randomization…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Construct a periodic neural integral layer whose fixed singular kernel behaves like |y|^{-s} near the origin, but whose samples on the uniform grid are replaced on a small symmetric stencil by SinCoTrap correction weights. The correction cancels low-order Taylor errors caused by sampling the singularity, while all nonlocal grid points remain unchanged. Increasing the correction order from p=0 to p=1 or p=2 should reduce discretization error without increasing global grid resolution.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Modify deterministic actor-critic training so the critic receives an empirical joint state-action distribution and the actor gradient includes both the usual action derivative and the effect of the actor on that distribution. This targets multi-agent or population environments with crowding, consensus, congestion, or mean-field rewards where ignoring distribution dependence creates a systematically biased policy gradient.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Insert a differentiable discrete-time control-barrier correction into the reverse diffusion process for action or trajectory generation. At each denoising step, roll out the candidate trajectory through a learned or known dynamics model, compute the minimum collision margin against all obstacles, and modify the denoising output toward trajectories satisfying one-step barrier inequalities. Unlike rejection sampling, this uses barrier gradients to repair unsafe samples before the final action is…
Useful7/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Initialize a recurrent or state-space transition matrix with weak Wigner noise plus a shared cumulative-sum correlation structure. Increasing the correlation strength produces recurrent eigenmodes one at a time at analytically predicted BBP thresholds, yielding a controllable hierarchy of short- and long-memory modes. The matrix should then be globally rescaled or constrained so that all active modes remain inside the desired stability radius.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Train a policy network and separate multiplier networks to minimize Bellman, stationarity, feasibility, and complementarity residuals instead of relying on fixed penalties for constrained actions. The multipliers can turn on only when an inequality constraint binds, allowing one actor to learn both interior and boundary behavior without manually tuning penalty weights.
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace interpolation of heterogeneous sensor streams by a phase-indexed recurrent or state-space network with period M, where M is the least common multiple of the sensor sampling periods. The network applies a distinct transition for each phase while using a fixed cyclic phase update, preserving timing structure and allowing missing observations to enter only when their phase-specific sensor is available.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train a neural state-space model using all replayed transitions, but assign larger weights to samples near the current operating context rather than discarding distant samples. Add a strictly positive weight floor so local adaptation cannot eliminate global coverage or make the regression problem rank-deficient. This should improve prediction across nonlinear regimes while retaining the numerical robustness of full-data training.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Equip a neural policy or learned world model with an MPPI-style rollout planner whose perturbation covariance is conditioned on a discretized latent-state cell and updated from observed transition residuals. Apply spatial diffusion to neighboring covariance estimates using a kernel matched to the empirical visitation distribution, so covariance adaptation is smoothing rather than an unstable independent estimate at every state.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace the unconstrained transition of a recurrent or state-space neural network with a DMDc-initialized linear latent transition plus a learned nonlinear residual. Estimate the transition from a short warm-up dataset using Hankel delay coordinates, retain eigenmodes with decay rates near the unit circle for long-term memory, and let the neural residual model dynamics not explained by the linear backbone. This should make long-horizon prediction and slowly varying signals easier to learn while…
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Make a diffusion policy or MPPI-style action-sequence sampler less committed to model-predicted cost rankings when the learned world model is inaccurate. Estimate a normalized prediction residual or ensemble disagreement, increase the sampling temperature with that residual, and retain ordinary low-temperature exploitation when the model is accurate.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Separate a pretrained sequence model's passive prediction from the causal effect of an action, and learn only the latter with a compact monotone adapter. The adapter receives the current latent state and an action deviation, but its action-to-output Jacobian is constrained to have the physically correct sign, preventing intervention predictions that move opposite to the applied control.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Train an encoder and decoder whose latent observables evolve through one shared linear Koopman matrix, while directly penalizing the empirical invariance residual of the learned observable subspace. This discourages latent coordinates that fit one-step transitions but continually leave the representational subspace, improving long-horizon rollout stability.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Attach a sampling-based rollout correction head to a neural policy or learned world model, and adapt its temperature and number of rollouts so that approximation error stays within the contraction margin of a nominal policy. The controller should spend samples only when the local state-dependent error gain is close to violating the small-gain condition, instead of using a fixed MPPI sample count everywhere.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the paper's parameterized invariant-torus residual and pseudo-arclength Newton correction to train a neural ODE across a continuous family of latent dynamical regimes. The continuation constraint allows the solver to pass through saddle-node folds, where stepping a physical control parameter alone would fail or jump to a different branch.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use a maximal-volume cross approximation of the parameter-by-space transport-signature matrix to select informative training conditions and compact spatial features. This provides an active-learning alternative to random snapshot selection or ordinary PCA, targeting parameters that are difficult to interpolate from the current reduced representation.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Add a deterministic complex-valued state-space bank whose mode detunings become progressively smaller with mode index, Delta_n=c n^{-p}, while input couplings decay as B_n=b n^{-kappa}. For slowly varying or constant forcing, the summed state follows the paper's subresonant response and grows like t^{1-alpha}, providing controllable power-law memory with only O(N) recurrent state updates. This should improve long-context retention compared with a same-size unconstrained RNN or uniformly spaced…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a latent mode bank whose coordinates are learned by neural power iteration on observed state transitions rather than by jointly fitting an unconstrained latent dynamics model. Each mode is repeatedly regressed toward its one-step pushforward, normalized under the data distribution, and deflated against previously learned modes. The resulting latent coordinates are constrained to have approximately linear, diagonal dynamics, which should improve long-horizon prediction and make the…
Useful7/10
Difficulty5/10
Novelty7/10
Audited (legacy)
2026
Replace independent per-action distributional value heads with a critic whose shared latent particle produces a vector of return samples for all actions simultaneously. Train the predicted joint return vector against a Bellman target vector formed from coupled counterfactual reward-transition samples, using a sliced Wasserstein loss. The greedy action is selected by the mean of the corresponding marginal particles, while shared particles retain cross-action dependence for learning and…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a directed sequence-memory chain with a circular recurrent state propagated by a learned delayed convolution. The same learned kernel can support forward and reverse replay because replay direction is a dynamical mode of the ring, rather than requiring plasticity to explicitly learn both forward and backward synapses.
Useful7/10
Difficulty5/10
Novelty8/10