Unverified
2026
Add a Jacobian cone-field regularizer to recurrent dynamics so that tangent directions expand and remain aligned with an unstable cone outside a designated critical neighborhood. The network is not forced to be uniformly expanding: the regularizer is disabled near the critical set, allowing controlled bifurcation-like behavior while exposing where long-horizon sensitivity changes.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
For a neural block with matrix-valued activations and transformation Y = A X B, regularize the exact coupled spectrum of the two-sided map instead of penalizing A and B independently. A large singular direction in A is penalized more strongly when the corresponding singular direction in B is also large, directly controlling joint feature amplification.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Treat the router state as a symbolic base process and expert transformations as nonstationary expanding fiber maps. Add a relative entropy/free-energy constraint so that the router's conditional entropy is calibrated against the empirically measured growth rate of distinguishable expert trajectories, preventing premature expert collapse while retaining useful specialization.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build each nonlinear correction in an inverse neural operator from explicit bilinear products of learned operator features, following the inverse Born expansion instead of using an unconstrained pointwise MLP. Use a square activation to implement multiplication exactly, and truncate the interaction order so the model has a controllable polynomial structure.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the first several convolutional blocks of a small image model with a finite-depth convolution-modulus scattering stem built from a Parseval filter bank. Enforce exact energy accounting and use the paper's polynomial residual law to choose the smallest depth that captures the desired fraction of input energy, avoiding unstable or redundant deep scattering paths.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use a window of observed neural-network update trajectories to identify the set of local quadratic objectives and preconditioners that are consistent with the observed optimizer behavior. Rather than selecting one arbitrary curvature model, retain the nullspace of compatible parameters and use its dimension or smallest singular value as an identifiability and stability diagnostic.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Attach a finite mixture of zonotopes to each uncertain neural input or hidden state, and propagate every mixture component through affine layers and conservative nonlinear relaxations. When the number of components grows, merge components only with an enclosing zonotope and sum their probability masses, preserving a formal lower bound on the probability that the true activation lies in the represented set.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent hierarchical or tree-structured hidden states on words over d symbols and replace a dense mixing layer by a noncommutative Toeplitz operator composed of shared word shifts. Coefficients are reused at every tree location, so the parameter count depends on maximum interaction depth rather than the number of nodes; an optional spectral penalty controls the amplification profile of finite-depth truncations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent top-k token selection by a quality-weighted determinantal subset objective based on the Hardy–Szegő kernel. Tokens with high learned quality are preferred, but geometrically redundant tokens have a small determinant contribution, encouraging diverse sets of routed experts, retrieved items, or attended context tokens.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Construct a contractive multi-branch recurrent or generative network whose branches define an iterated-function system, and regularize it so that branch entropy is high relative to average contraction while compositions remain exponentially separated. The target is a measurable attractor-dimension law rather than only a benchmark improvement: the invariant measure dimension should approach min(d, H divided by chi), where d is state dimension.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained message-passing or recurrent propagation matrix by a directed-edge operator with non-backtracking connectivity and orientation-dependent turning phases, inspired by the Kac–Ward construction. During training, monitor and control the zero-momentum spectral gap of \(\mathcal A(0)=I-K(0)\), keeping the model near but on the stable side of the critical surface to obtain long memory without uncontrolled amplification.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a neural-network update with an auxiliary, damped stochastic branch that acts like the paper's floating dissipative reservoir. A trainable mixing phase \(\phi\) combines the task-gradient branch and auxiliary branch; \(\phi\) is adapted to make the auxiliary response to a chosen control perturbation nearly zero while retaining a finite task-gradient response. The intended benefit is selective insensitivity to nuisance hyperparameters or perturbations, with a measurable response peak…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace unconstrained or entropy-regularized MoE routing with a minimally disruptive update that preserves a lower bound on the log-determinant of the experts' weighted output span. The router still tracks the desired mixture, but a projection prevents the active experts from becoming linearly redundant or collapsing onto a low-rank subset.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat a selected neural submodule as an open dynamical system embedded in the rest of the network. Regularize it to contain internal modes that are simultaneously reachable from many external features and observable through many external outputs, rather than behaving as a one-sided receiver, broadcaster, or disconnected read/write split.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained entrywise nonlinearity on a positive Gram or covariance matrix by a learned scalar function satisfying the paper's finite-order positivity-preserver conditions. The transformed matrix remains PSD for matrices of the target width n, allowing nonlinear Gram propagation without eigenvalue clipping or projection.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a conventional covariance or density-matrix discrepancy with the geodesic quantum f-divergence between an example's predicted positive-definite matrix and its target matrix. Use t as a controllable interpolation between the standard Petz divergence at t=0 and the maximal divergence at t=1, with f(x)=x log x or another operator-convex power generator. The loss is suited to covariance-predicting networks, SPD-valued embeddings, and matrix-valued classifiers where eigenvector alignment…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace ordinary Frobenius-norm clipping when merging rank-one LoRA or adapter updates with a Schatten-budget computed from the positive operators |A_k|. For p>=2, the paper's sharp rank-one inequality bounds the norm of the merged update, including interactions between updates that are missed by independent per-update clipping.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace fixed-path robustness testing with a coupled continuation procedure that increases an adverse perturbation while simultaneously optimizing a bounded corrective response, such as feature-gating, normalization, or a small adapter. Define the model's margin as the cumulative perturbation at which its equilibrium, prediction, or input-output Jacobian becomes singular or exceeds a prescribed gain threshold; train the corrective response to enlarge this margin subject to an explicit cost.
Useful6/10
Difficulty7/10
Novelty7/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
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
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
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