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
Translate a recursive neural architecture grammar into a combinatorial specification and use its generating function to sample architectures uniformly conditional on size. This removes the severe shape and branching biases of naive random tree generation, producing a better-covered architecture-search population at the same evaluation budget.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained positive higher-order gating function by a factorially normalized homogeneous polynomial whose coefficients are trained toward the Lorentzian Hessian signature. This gives multiplicative routing or attention interactions a controlled curvature pattern instead of allowing arbitrary unstable higher-order amplification.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace unconstrained momentum updates for selected neural-network parameter blocks by damped second-order motion on a unit sphere. The update learns directions while preserving the block norm exactly, and includes the centripetal term required for a valid acceleration constrained to the sphere rather than merely projecting gradients after an unconstrained step.
Useful6/10
Difficulty5/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
Replace an untied stack of recurrent or polynomial-filter blocks with a delayed recurrence whose coefficients repeat with period r and whose characteristic polynomial has exact (r+1)-fold rotational symmetry. The resulting layer couples the current state to a state r steps back, producing a structured spectrum rather than arbitrary eigenvalues and potentially improving long-horizon propagation with fewer parameters.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a scalarized multi-task loss with an adaptive projected update that chooses a regularized convex combination of task gradients at every step. The combination is conservative when task gradients conflict, while the regularization is adapted from the actual projected step length rather than from loss values or a line search.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace isotropic neighbor aggregation in a graph or point-cloud neural network with a local anisotropic diffusion operator determined by empirical first and second moments of each neighborhood. Subtract the first-moment drift before aggregation, and use the normalized second-moment tensor to mix feature derivatives along the locally supported directions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an arbitrary graph spectral filter with a constrained transition-band filter that is exactly one on the lowest L graph frequencies and zero above frequency N. Train or initialize the transition coefficients to minimize the induced infinity-norm excess above one, which controls amplification and sign overshoot while retaining low-frequency information exactly. The paper predicts that widening the transition band reduces the best achievable excess quadratically rather than linearly.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace isotropic optimizer noise with a bounded, state-dependent temperature field along a scalar progress or basin-transition coordinate. Inject more noise when the update must climb an estimated loss barrier and less noise while descending toward a promising basin, transferring the paper's hot-uphill and cold-downhill efficiency optimum into stochastic neural optimization.
Useful6/10
Difficulty5/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
Unverified
2026
Replace a single recurrent hidden state by reciprocal forward and backward feature fields whose product defines a positive feature density. Feed the associated Bohm/Fisher potential back into both streams, creating adaptive curvature feedback that suppresses sharp incoherent relative structure and can localize the learned representation.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unrestricted recurrent state with a current input-driven state coupled to a fading average of its own history. The memory coupling provides a distributed dissipative channel, while the recurrent Jacobian is constrained below a measurable contraction boundary. This creates a recurrent or state-space block whose long-horizon sensitivity can be tested against explicit characteristic roots.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent per-sensor temporal encoders with a shared two-dimensional transform whose temporal and spatial phase channels remain algebraically distinguishable. Train a neural residual detector and localization head on the transformed coefficients, forcing perturbations with the same temporal signature but different positions to differ primarily in their spatial phase.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace instantaneous confidence-based routing with a temporal conjunction: enable a learned policy only if its probability and recoverability estimates satisfy their thresholds at every one of the last \(K\) observations. This suppresses brief optimistic critic errors and can wrap RL actions, diffusion trajectories, or MoE expert selection.
Useful6/10
Difficulty3/10
Novelty5/10
Unverified
2026
Construct each hierarchy transition as a coarse-graining map together with a local decoder that recovers the retained local representation. This creates a reversible-information path for features needed by later computation while still allowing high-frequency or locally irrelevant components to be discarded.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace a dense Gaussian random-feature layer by a sparse Poisson-chaos layer with the same learned kernel, and penalize the layer's normalized fourth add-one energy. The penalty suppresses rare single-atom jumps, so the sparse layer approaches the Gaussian same-kernel representation in Wasserstein distance while preserving computational advantages from sparse Poisson sampling.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace independent softmax routing or attention normalization with a differentiable approximate distribution over one-to-one assignments, using the Bethe permanent as the partition-function surrogate. Constrain the allowed token-to-expert or query-to-key support graph to have high girth, which gives an explicit bound on the approximation error and reduces short-cycle-induced correlations.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace ordinary dropout or soft sparsity penalties on a nonnegative spatial or token activation field with sublinear multiplicative stochastic dynamics. The field receives local diffusion or graph smoothing, while noise amplitude u^gamma vanishes at zero but is relatively strong near zero; this creates an absorbing zero state and may produce exact contiguous inactive regions. The module is suitable for feature maps, graph-node fields, token routing scores, or continuous neural operators.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Parameterize a scalar or vector implicit neural field on each spatial cell with Bernstein polynomials and constrain its coefficients instead of sampling many points to enforce output bounds. The Bernstein convex-hull property gives a deterministic pointwise bound everywhere in the cell, making the method useful for neural fields representing densities, concentrations, masks, or material parameters.
Useful6/10
Difficulty4/10
Novelty7/10