Unverified
2026
Given a learned recurrent dynamics map, estimate a state-dependent invariant measure from each trajectory and use integration against that measure as a projection onto long-term invariant features. Penalize discontinuities of this projection between nearby states and assign zero mass to trajectories whose feature norms escape, producing a principled distinction between convergent attractors and divergent rollouts.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a fixed KL or Jensen-Shannon penalty with a learnable Csiszár f-divergence whose generator is parameterized so that convexity is guaranteed. Apply it between teacher and student distributions, augmentation views, or intermediate representations; the loss cannot increase after a stochastic channel such as augmentation, pooling, token merging, or quantization, making the regularizer structurally compatible with information-discarding network operations.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Separate low-support monomials, which involve only a few distinct input coordinates, from high-support monomials in a high-degree symmetric interaction layer. Compute the low-support orbit features exactly and prune, sample, or factorize the high-support tail, using the paper's cutoff scale as the initial sparsity rule.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained Wasserstein representation-matching loss with a graph-causal transport loss whose coupling at node k is conditioned only on the representations of its parents. This forces domain alignment, distillation, or augmentation consistency to respect the information flow of the model's DAG, reducing spurious matches that exploit descendants or globally visible features.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize a neural encoder so its local pullback metric is bounded by the refined Schwarz-lemma constant instead of using a generic Frobenius Jacobian penalty. For an encoder into a negatively curved latent space, penalize only singular directions whose squared expansion exceeds the curvature- and dilatation-dependent threshold.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent recurrent hidden states as compact phases and monitor spacetime vortices, defined by wrapped phase differences around elementary space-time plaquettes. Add a feedback controller that increases relaxation toward the homogeneous phase when vortex activity becomes supercritical, while allowing larger recurrent gain when the system is excessively quiescent. This creates a falsifiable operating regime: useful computation should occur near, but below, the defect-proliferation transition…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Learn an endpoint-conditioned scalar potential whose level sets represent states with the same asymptotic behavior, analogous to the paper's stable magnetic orthospheres. Train the dynamics to contract differences within a level set while preserving differences between distinct endpoint classes, producing a latent representation organized by stable manifolds rather than Euclidean proximity.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace independent additive noise on spatial feature maps with stochastic advection by divergence-free vector fields. The perturbation preserves spatial volume and feature mass, while the associated Stratonovich-to-Itô correction provides a tunable diffusion that preferentially damps high-frequency spatial fluctuations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained deep residual recurrence by a discretized diffusion system over feature or token positions, with trainable source terms and analytically constrained boundary feedback. The state remains nonnegative under nonnegative inputs, while negative boundary gains enforce exponential decay of perturbations and prevent exploding activations in very deep stacks.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense translation-invariant interaction matrix with a positive-definite Toeplitz kernel K_n(e^f) whose log-spectrum is parameterized by a small number of Fourier coefficients with 1/|k| decay. Use the paper's explicit quadratic term as a spectral-volume budget, allowing long-range structure while discouraging uncontrolled determinant growth and ill-conditioning. Subtracting this term from a log-determinant regularizer leaves a residual intended to capture higher-order deviations from…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize neural features indexed by a compact transformation group using the three conditions from the vector-valued Pego theorem: nearby group transformations should produce nearby features, high group-Fourier coefficients should have small energy, and feature energy should remain concentrated in a fixed low-dimensional value-space subspace. The third term is important for large or effectively infinite-dimensional feature spaces, because translation and Fourier smoothness alone do not…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a sparse, interpretable fractional-dynamics layer to a neural world model: candidate terms are evaluated through weak projections, while both their support and continuous derivative orders are selected by validation error versus model complexity. This avoids forcing the model to choose from a dense fixed dictionary containing many nearly collinear fractional orders.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Apply the paper's weighted nuclear elastic-net principle to the transition matrix of a recurrent or linear state-space layer. Penalize low-rank structure after whitening by the observed hidden-state covariance, while retaining a ridge term that prevents poorly excited state directions from producing unstable or arbitrarily large transition weights.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add an asymmetric distillation loss that requires target or teacher observables to be approximable by source or student observables on only a 1-epsilon mass subset of a coupling. Unlike symmetric feature alignment, the student is penalized only for failing to reproduce target functions on well-matched mass, making the objective robust to outliers, label noise, and partial domain mismatch. The inner minimization allows each target observable to select its best source probe rather than forcing a…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a collection of neural directions as generators of a zonotope and reward the volume spanned by their subsets. The objective favors complementary, non-collapsed vectors rather than merely pairwise-separated vectors, making it suitable for attention heads, MoE expert signatures, or embedding prototypes. Use normalized generators and positive gates so the regularizer cannot be increased trivially by scaling.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train a constrained neural network on progressively larger data subsets rather than repeatedly solving the full constrained problem from scratch. At each stage, warm-start both the network parameters and constraint multipliers, and use a conservative augmented-Lagrangian gradient update; the paper's local-linear result predicts rapid refinement once the current iterate is near a strong second-order constrained solution.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Insert a proximal layer after a graph, mesh, or spherical convolution that groups all coordinates belonging to the same Laplacian eigenspace and applies one shared shrinkage gate to the whole group. Unlike coefficientwise spectral pruning, the result is unchanged if the eigenvectors inside a repeated eigenspace are rotated, preventing arbitrary basis-dependent feature selection.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build neural computation graphs with explicitly phase-budgeted serial and parallel branches, treating serial compositions as SRG products and parallel residual branches as SRG sums. Allocate phase centers theta_i so that every loop or branch aggregate stays away from -1, enabling stability-aware architecture search and constructive control of branch gains.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace an unconstrained q-way polynomial or tensorized feature layer with separate decomposable and primitive interaction channels. The decomposable channel models interactions explainable as products of lower physical-weight feature blocks, while the primitive channel captures residual factors that cannot be represented by those products. This should reduce redundant high-order parameters and provide a controllable inductive bias for compositional or disentangled representations.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a differentiable Fourier-domain layer after a network predicts a symmetric strain field, projecting every frequency onto the subspace satisfying isotropic mechanical equilibrium. The projection is a closed-form least-squares correction, so the network cannot spend capacity representing large equilibrium violations and the resulting field is physically admissible by construction.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the min-plus phase transition as a training-time controller: begin near p = 1/2 to preserve the initial active-state fraction across depth, then move above or below criticality to deliberately remove or create sparse pathways. The controller uses a measurable state variable, the activation zero fraction, rather than an arbitrary regularization coefficient.
Useful6/10
Difficulty5/10
Novelty9/10
Unverified
2026
Represent a nonnegative neural output as a homogeneous polynomial with coefficients indexed by count vectors, and penalize violations of the Lorentzian Hessian signature after factorial normalization. Add an M-convex support penalty so mass can move between coordinates through valid exchange operations rather than forming disconnected or brittle coefficient patterns.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's separated near-return criterion as a finite-data certificate that a recurrent or latent dynamical model contains positive-complexity behavior rather than merely noisy prediction error. Detect pairs of nearby trajectories that almost return to their starting points but separate at an intermediate time, then either flag the model for long-horizon unreliability or penalize the number and strength of such events. The monitor is suited to learned world models, RNNs, and neural ODEs…
Useful6/10
Difficulty5/10
Novelty6/10