✓✓ 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
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
Represent a neural controller as the projection of a learned Hamiltonian stable manifold rather than learning a state-to-action map without geometric constraints. Train a manifold chart together with its invariance equation, and reject or branch-switch near points where the manifold projection becomes singular. The resulting controller exposes a measurable boundary between single-valued smooth feedback and multivalued or hysteretic feedback.
Useful8/10
Difficulty6/10
Novelty7/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
Replace an unconstrained recurrent transition by a sequence of exact SU(1,1) hyperbolic updates. The layer processes each token with a 2-complex-dimensional state and preserves the indefinite energy |a|^2-|b|^2=1 exactly, preventing numerical drift while retaining non-unitary amplification and attenuation.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Initialize latent coordinate-frame parameters analytically from two temporally separated neural predictions instead of starting joint optimization from arbitrary translation and orientation. This removes the continuous gauge before backpropagation and should prevent EKF-like or gradient-based failures caused by large yaw and position initialization errors.
Useful7/10
Difficulty4/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Monitor the ratio between gradient norm and square-root loss suboptimality, and use it to distinguish the far-from-optimum linear-decay regime from the near-optimum exponential regime predicted by semiglobal PŁI. Apply conservative updates or gradient clipping while the ratio is small, then switch to a larger stable learning rate, reduced gradient noise, or early stopping once the local PŁI regime is detected.
Useful7/10
Difficulty4/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a kernel aggregation layer whose output is a tangent vector field on the unit sphere and whose surface divergence is identically zero by construction. For each source point, use a matrix kernel obtained by applying a surface-rotated gradient in the query variable to a scalar zonal kernel; this is a differential-form version of the paper's matrix-valued construction. The layer can replace attention or message passing when the target dynamics are incompressible, such as spherical fluid…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Construct hidden dynamics from permutation-equivariant vector fields and impose antisymmetry through an explicit antisymmetrizing readout. This prevents optimization from learning multiple equivalent copies of the same configuration and makes forbidden symmetry violations exactly zero, rather than merely penalizing them. The design applies to set models, particle systems, graph networks, and architectures handling unordered tokens.
Useful7/10
Difficulty5/10
Novelty4/10
✓✓ Beats tuned baseline
2026
Replace unconstrained softmax cross-attention with a many-to-many transport matrix whose row and column masses have explicit upper bounds. Compute the attention cost from both feature similarity and pairwise relational disagreement, so a token is attended to only when its relationships to other tokens are jointly compatible. The inequality constraints provide a principled dustbin-free mechanism for ignoring distractor tokens.
Useful7/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace a jointly optimized scalar electrostatic potential in a neural PDE solver with a dual flux represented by a Hodge curl correction. The resulting inner problem is a positive quadratic minimization with the divergence constraint satisfied exactly, avoiding unstable primal-dual training dynamics.
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace raw spatial coordinates supplied to a neural field or PINN by a learnable monotone radial coordinate generated from a positive neural density. The density is trained through the PDE energy or residual after solving for the network weights, allowing the warp to discover where resolution is needed without singularity labels or an analytic interior solution. Near a singular point, a factor s^(q-1) gives a controlled regularity gain, while a positive learned correction redistributes…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Represent hidden features with several local orthogonal or unitary frames, and let group-valued transition maps align neighboring experts. Instead of forcing every expert to learn a globally coherent coordinate system, train local experts independently and impose a patching constraint that produces a globally consistent feature field. This is especially suitable for graph neural networks on data with heterogeneous local geometries or mixture-of-experts models whose experts specialize by region.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add an integrability penalty to a multi-agent critic so that the players' entropy-regularized Gibbs best responses can be represented by one coherent joint policy. The penalty detects whether the learned action-value functions define a conservative joint action field, preventing independent agents from learning mutually incompatible conditional policies.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace raw molecular orientation vectors with local scalar features invariant under common three-dimensional rotations and the apolar transformation u_i -> -u_i. Feed these channels to a CNN autoencoder, VAE, or contrastive encoder so that configurations on the same physical symmetry orbit have identical inputs or latent codes. This should improve unsupervised phase discovery without supplying order-parameter labels.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace the usual projected gradient step with a relaxed projection in a positive-definite metric that changes with the current parameter state. The metric acts as a continuous preconditioner before projection, so updates can be large along poorly conditioned directions while remaining feasible.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace additive neural state updates for rotations or rigid poses with a learned forced dynamical system whose configuration is updated by Lie-group multiplication. The network predicts body-frame force or acceleration in the Lie algebra, while the exponential map guarantees that every predicted configuration remains on SO(3) or SE(3).
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Add a learnable cyclic-coordinate mechanism to latent dynamics so that selected latent coordinates do not enter the Hamiltonian and their conjugate momenta become conserved. This provides an explicit dimensionality-discovery and invariance bias, encouraging the model to represent nuisance or symmetry directions compactly instead of spending independent dynamics capacity on them.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a positively homogeneous convex network by representing every intermediate unit as a compact polytope and composing units with Minkowski sums, convex-hull unions, and positive dilations. This gives an explicitly convex and monotone architecture whose geometric complexity can be controlled independently of the number of sampled linear pieces, potentially producing smaller ICNNs for structured convex functions.
Useful7/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace the Euclidean hidden-state update of a recurrent or state-space neural network with a mixed manifold state containing a rotation component and Euclidean features. Propagate uncertainty with sigma points in tangent error coordinates, retract rotational perturbations through the exponential map, and compute the training loss from the predicted covariance. This avoids invalid rotations and captures second-order curvature effects that a first-order EKF-style recurrent cell misses at large…
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Route tokens to experts using Laguerre cells defined by the minimum control energy needed to move a token embedding to each expert prototype, rather than by Euclidean distance or an unconstrained learned router logit. Per-expert dual weights deform the cells so that minibatch routing follows prescribed expert capacities, giving a geometrically interpretable alternative to auxiliary load-balancing losses.
Useful7/10
Difficulty6/10
Novelty6/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
✓✓ Beats tuned baseline
2026
Replace a pointwise Gauss-equation penalty involving the determinant of a neural surface Hessian with a weak Cartan residual built from an orthonormal coframe and its connection 1-form. The residual is evaluated after integration against compactly supported test functions, making curvature supervision less sensitive to noisy second derivatives and compatible with rough neural surfaces.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Attach an analytic geometry gate to a KAN or MLP so that known feasible regions, exclusions, and unions are represented by differentiable implicit functions instead of being learned only from samples. Use R-conjunctions for intersections and R-disjunctions for unions, then convert the signed support score into a soft gate that modulates the prediction.
Useful7/10
Difficulty4/10
Novelty6/10