✗ Failed on benchmark
2026
Replace dense coarse-to-fine cross-attention at multiresolution interfaces with a sparse, nonnegative overlap operator whose weighted feature average is exactly conserved between the two resolutions. Use this operator as a low-order path and blend it with an unrestricted neural cross-attention path through a convex limiter that keeps features inside a box or simplex domain. The construction is especially suitable for adaptive token grids, hierarchical graph neural networks, neural operators…
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a dense multiresolution voxel or hash-grid encoder with an omnitree-like anisotropic feature partition. Each cell stores a vector-valued scaling feature and its children are introduced only when local Haar detail energy is large; coarsening replaces children by their mean, so compression does not introduce an arbitrary offset. Splitting can be restricted to the coordinate whose one-dimensional detail coefficient is largest, allowing thin structures to receive resolution only in the…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained one-step transition network with a symmetric damping–symplectic-core–damping composition. The damping strength is one learned scalar rate and is applied through positive exponential diagonal factors, so every step has a known contraction law while the neural core models nonlinear conservative transport.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add conformal prediction sets for every action of a contextual policy, then select the action maximizing its worst-case utility over the corresponding set. Calibrate the sets using the outcome generated by this same max-min policy, rather than calibrating each action independently; this directly targets reliable utility under deployment decisions.
Useful7/10
Difficulty5/10
Novelty7/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 works
2026
Replace orthogonal Procrustes alignment between two latent dynamical systems with a learned bijection h that makes their transitions commute: h(f(z)) approximately equals g(h(z)). Parameterize h as an invertible affine map or coupling flow, allowing the correspondence to be non-orthogonal while retaining an exact inverse. The same constraint can be applied over multiple rollout steps, encouraging two models to represent the same computation even when their latent coordinates differ…
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a neural controller as a uniformly accurate surrogate of a trusted but expensive controller, and use a measured small-gain condition to decide whether the surrogate is safe for closed-loop deployment. The approximation tolerance becomes an interpretable residual-state budget instead of an opaque validation metric.
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
△ Mechanism confirmed, baseline not beaten
2026
Represent a predicted convex object by one point per prescribed unit direction and decode it as the convex hull of those points. Enforce direction-wise maximizer inequalities so every point is a genuine vertex, then use the covering-radius bound to choose the number and placement of directions according to the desired geometric accuracy.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a network to predict the context-dependent observation matrix rather than the latent inverse parameters themselves, then compute the latent parameters with a differentiable ridge-regression solve. This gives one model that can assimilate arbitrary observation vectors, exposes the conditioning of the inverse problem, and avoids forcing an MLP to learn the entire map from observations to parameters.
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 an opaque MLP vector field with a stack of trainable symbolic primitives that can express linear terms, monomials, products, and related analytic operations. Apply an L1 penalty and prune small primitive coefficients after rollout training, yielding a compact dynamics module that is cheaper to evaluate and easier to inspect.
Useful7/10
Difficulty6/10
Novelty6/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
Unverified
2026
Build a recurrent or state-space model with latent coordinates split into tangent variables that carry the modeled dynamics and transverse variables that contract toward a learned invariant manifold. Penalize violations of invariance and enforce a spectral gap between tangent and transverse Jacobian dynamics, preserving useful noncontracting behavior while suppressing off-manifold drift during long rollouts.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace dense aggregation over patches, points, or graph neighbors with a state-dependent positive quadrature rule. A latent encoder produces the current manifold coordinate z, a small controller chooses a subset of entities, and a convex redistribution step assigns nonnegative weights so that the subset preserves the full aggregation on a learned feature basis. The method is especially suitable for neural operators and vision attention where many spatial entities are redundant along the data…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Build a recurrent or state-space layer with fixed, spatially heterogeneous relaxation rates and measure its steady response to positive versus negative input offsets. Unlike a homogeneous linear state-space model, an individual heterogeneous realization can generate a controlled even response, allowing directional transport, asymmetric temporal context, or hysteresis-like sequence transformations without inserting an explicit quadratic input feature.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a Cartesian grid or singular polar convolution near the center of a disk with a hierarchy of polar-spline coefficient features. Use separate coefficient spaces for scalar fields, vector 1-forms, and 2-forms, together with sparse derivative matrices satisfying the discrete complex identity D1 D0 = 0. Refine only cells with large learned or physics residuals, while retaining the pole constraints that make the representation smooth despite the collapsed angular boundary.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a recurrent or state-space world model as a semiconjugate factorization: the high-dimensional state dynamics \(G\) must project through an encoder \(E\) to a lower-dimensional latent map \(F\), satisfying \(E\circ G\approx F\circ E\). Add a connected-fiber regularizer so states with the same latent code form geometrically coherent sets, allowing the model to discard redundant microscopic motion without discarding the entropy-carrying macroscopic dynamics.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a separately identified constant or slowly varying force channel to a neural dynamics model, analogous to the paper's online gravity-trim and mass adaptation. This isolates persistent low-frequency prediction bias from state-dependent dynamics, reducing repeated corrective action by the planner and avoiding expensive network retraining after a systematic shift.
Useful6/10
Difficulty3/10
Novelty5/10
Unverified
2026
Attach a small, online-adapted Taylor-polynomial residual model to a neural dynamics model instead of adapting all network weights. Construct the dictionary from the local Taylor structure, remove monomials forbidden by known joint-odd symmetry, and update its coefficients with recursive least squares. This yields fast adaptation with an interpretable parameter count and a direct test of whether the assumed symmetry is valid.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a finite-dimensional latent prior for fields or trajectories with a continuous flow acting on function coefficients in a separable Hilbert space. A Gaussian reference with an explicit covariance spectrum is transformed by a learned vector field, so the model can represent smooth, non-isotropic function distributions while sharing parameters across discretization resolutions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a post-processing or differentiable output layer that first matches each predicted marginal distribution to the data marginal and then corrects the remaining joint dependence by transporting the predicted copula to the observed copula. This directly targets the discrepancy that sequential marginal or quantity-of-interest constraints cannot remove.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a compact latent basis for a parameter-conditioned neural operator by repeatedly adding the parameter sample with the largest normalized prediction residual. This replaces uniform parameter coverage with adaptive basis growth and supplies a stopping rule for when the latent approximation is sufficiently accurate.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add an explicit memory field to a recurrent or state-space model and make the memory feedback act through a discrete biharmonic operator, producing the paper’s characteristic \(z=4\) long-wavelength relaxation. This should preserve slowly varying sequence structure while damping high-frequency hidden-state noise, potentially improving long-horizon prediction without requiring a very large recurrent state.
Useful6/10
Difficulty5/10
Novelty7/10