✓✓ Beats tuned baseline
2026
Replace a purely nonlinear recurrent transition with a learned observable map followed by an explicitly linear latent evolution model. Include the original latent state and a small set of nonlinear observables, and update the linear transition online with forgetting-factor recursive least squares when the environment or task dynamics change.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build a shallow neural model whose input at every discretization level is embedded into a common Hilbert space with uniformly bounded norm, and constrain every neuron parameter in the corresponding dual norm. The statistical complexity then depends on the Hilbert norm bound rather than the number of retained coordinates, allowing one model design to operate across increasingly fine measurements.
Useful8/10
Difficulty4/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace pointwise prediction of the next field with prediction of a learned flux followed by a discrete divergence. Combine Fourier spatial mixing with a causal temporal kernel over the recent resolved-history slab, so the model learns finite-memory closure effects while preserving local conservation exactly under periodic or compatible boundary conditions. The architecture should reduce spurious mass drift and improve autoregressive rollout stability on coarse-grained PDE data.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Represent a scalar energy or free-energy functional of a three-dimensional neural field using translation- and rotation-equivariant convolutions, and produce the field prediction by minimizing the total functional rather than by a direct decoder. The same functional can then generate equilibrium states, forces, and response observables under new external fields, resolutions, and system sizes.
Useful8/10
Difficulty7/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build a latent continuous-time neural model with dynamics \(\dot{z}=Az+f_\phi(z)\), where \(f_\phi\) is known, separately computed, or frozen, and \(A\) is learned exclusively from the derivative residual after subtracting \(f_\phi(z)\). Parameterize \(A\) with a truncated SVD or low-rank factorization so its eigenvalues directly predict local stability and long-horizon growth.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace direct action imitation with a causal recurrent estimator of the inverse input gain. The neural network predicts the latent quantity needed by the expert controller, and a fixed algebraic wrapper converts that prediction into an action using the measured state difference and tracking error, thereby removing the additive disturbance exactly under the sampled timing model.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a full-resolution neural operator with an explicit multiscale reconstruction: a coarse predictor produces a low-resolution field, and a small corrector module combines its gradients and Hessians with learned rapidly varying basis functions. The model should recover fine detail without running the expensive backbone at fine resolution.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Represent each neural module as a Hamiltonian storage system and connect modules through a state-dependent skew or Dirac interconnection instead of arbitrary residual additions. The coupling may change with the hidden state, but its internal power contribution cancels exactly, so total stored energy is controlled only by external inputs and explicitly added dissipation.
Useful8/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition with a decaying symmetric memory operator plus a skew-symmetric rotational operator. The skew component creates phase-shifted cross-channel memory and can represent oscillatory or circulatory temporal dependencies without requiring eigenvalues with large positive real parts.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace dense self-attention by a sparse attention graph whose neighborhoods satisfy the paper's size-dependent expansion condition. This preserves a logarithmically controlled route for every token subset to communicate with the rest of the sequence, reducing quadratic attention cost without allowing disconnected or poorly mixed token groups.
Useful8/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace full-state quantized write-back in a deep low-bit residual stack with quantized increment error feedback. The residual branch quantizes the proposed increment after adding the previous carry, while the carry stores the exact discrepancy; this makes the total error telescope instead of accumulating approximately once per layer.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Partition graph nodes into backward-equivalent classes and run message passing on the K-node quotient graph instead of the original N-node graph. If every node in a class receives the same aggregate message from every source class and shares the same local update map, class-constant node representations remain class-constant at every layer, making the quotient computation exactly equivalent to the full GNN on that invariant subspace.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent hidden-state update by a fast redistribution state with a dissipative Jacobian and a slow conserved state. The network computes an equilibrium state and a first-order pseudoinverse response correction, transferring the paper’s separation between local relaxation and macroscopic transport into a stable recurrent or state-space layer.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace uniform graph-convolution aggregation with a distance-aware message transform whose strength decays as \(\gamma^k\). At hop \(k\), transform the learned local evidence with \(2\operatorname{artanh}(\gamma^k z)\) before summation, so distant nodes have a provably shrinking influence window rather than accumulating unbounded noisy evidence.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace a single neural representation of a rapidly oscillatory PDE solution by a macroscopic network plus an explicitly oscillatory corrector network. Feed the network both the slow coordinate $x$ and fast coordinate $y=x/\varepsilon$, and train the resulting composite field in a variational energy objective. This targets the paper's scale-robust approximation bound rather than forcing the optimizer and finite sample set to discover oscillations of wavelength $\varepsilon$.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an autoregressive rollout of a learned dynamical model with a branch-trunk factorization that predicts all future steps simultaneously. The branch network encodes the future action sequence, while the trunk network encodes the current state and query coordinates; their inner products produce the complete horizon. This removes repeated state updates during inference and gives a compact differentiable model for planning.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a categorical denoiser for the clean token but convert its output analytically into the reverse CTMC jump rates using the exact forward transition kernel. This separates the easy-to-learn clean-token posterior from the quantity required by the reverse process and should keep the uniform-diffusion ELBO finite at initialization, unlike direct denoiser substitution.
Useful8/10
Difficulty4/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Give every possible pairwise relation its own recurrent latent state, stored in a dictionary keyed by stable node identities, instead of discarding the state whenever the edge is absent from the current graph. At each timestep, active edges retrieve their old state, update it with the current pair features and neighborhood messages, and write it back after message passing. This should improve predictions in dynamic graphs with intermittent interactions and reduce the burden on node states to…
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Modify a point-cloud message-passing or neural-operator layer so that scalar gradients, vector features, and vector-to-vector interactions are computed only in the estimated tangent plane of the surface. Projecting both feature values and derivative directions prevents the network from using arbitrary ambient-space normal directions and should improve transfer across differently embedded but intrinsically similar surfaces.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Represent communicating layers, experts, or distributed workers as nodes of a weighted graph and apply strong corrective updates only to a small pinned subset. Select pins by the increase they produce in the grounded Laplacian smallest eigenvalue, because this spectral gap predicts the decay rate of representation disagreement.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use a cyclic forward-neighbor recurrent or state-space layer and regularize its coupling so selected discrete Fourier modes are contracting while task-critical modes remain weakly damped. The paper's exact mode factors make instability falsifiable: a mode becomes unstable when its scalar factor changes sign, producing a measurable transition rather than a vague smoothness prior.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace dense graph self-attention with two parallel branches: exact softmax attention only over graph neighbors and a global linear-attention branch that summarizes all nodes through feature-space statistics. A learned node-wise gate interpolates between the branches, allowing locally structured nodes to use sparse attention while retaining a global-information path.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace a dense graph embedding table or end-to-end GNN encoder with a fixed-width binary SDR learned from streaming random-walk context pairs. Use PPMI to amplify informative node-context pairs and a local BCM update to learn detector columns, followed by k-winner-take-all binarization. The resulting sparse code can be used directly for node classification, link prediction, retrieval, or as input to a small downstream predictor.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace per-particle message evaluation in a point-cloud or particle-based neural layer with exact box moments. Particles inside a box are compressed into a fixed tensor of monomial sums, and every query in that box evaluates the same piecewise-polynomial interaction from those moments, reducing work from particle-query pairs to particles plus occupied boxes.
Useful7/10
Difficulty5/10
Novelty7/10