Unverified
2026
Replace an unconstrained recurrent transition with block-diagonal planar rotations whose angles are learned or conditioned on a slowly varying context variable. The resulting hidden-state norm and each two-dimensional block energy are exactly invariant in the ideal recurrence, preventing exploding or vanishing recurrent dynamics while retaining phase information over long horizons.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Constrain a recurrent latent state to the unit disk and learn an auxiliary Koenigs coordinate in which the recurrent transition is a scalar dilation. The nonlinear transition is trained to satisfy the conjugacy equation, so repeated application has a prescribed asymptotic rate instead of accumulating uncontrolled Jacobian errors.
Useful6/10
Difficulty7/10
Novelty8/10
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
Construct a neural mixing layer only from Brauer generators for the orthogonal group: identity, pairwise swaps, and pairwise contractions with the Euclidean metric. This gives an exactly O(2)-equivariant alternative to unconstrained tensor mixing, with trainable coefficients but fixed symmetry-preserving basis maps.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a hybrid geometric penalty between an attention distribution at one layer or training step and a reference distribution, such as detached attention from the preceding layer or optimization step. The penalty allows attention mass to move between nearby token positions at a transport cost while separately charging for local compositional changes, producing a structured alternative to KL or entropy regularization.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace a naively evaluated mixture of power-law experts with a Newton-envelope layer that computes all monomial magnitudes in log-space and subtracts their maximum before exponentiation. The layer exposes both a stabilized mixture value and soft dominance weights, allowing a downstream MLP to adapt to whichever scaling regime is active without overflow or hand-designed regime splits.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a conventional momentum update by a damped second-order trajectory with a configuration-dependent dense kinetic metric. Evolve two phase-space copies using symmetric split orderings, project both copies exactly back to their averaged physical state, and apply exact friction half-steps so momentum decay remains stable at large step sizes.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Attach two oscillator channels to each recurrent, state-space, or graph hidden unit and convert them into a phase field over nodes or spatial positions. Encode every overlapping triple of neighboring phases as one of the 13 weak ordinal patterns, including seven near-tie patterns, then use the resulting normalized entropy and pattern frequencies to detect hidden-state collapse, coherent clustering, or transient regime changes. During training, either use the entropy only as a controller for…
Useful6/10
Difficulty5/10
Novelty8/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 projected overdamped Langevin updates for constrained neural-network parameters with underdamped Langevin dynamics carrying an explicit momentum variable and specular reflection at the boundary of a convex parameter domain. The paper's hypocoercive result predicts a convergence rate proportional to the square root of the Poincare constant of the target position distribution, potentially giving substantially faster mixing in poorly conditioned constrained problems than overdamped…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a recurrent or generative network from finitely many contractive branches whose hidden-state attractor has a prescribed similarity dimension. The branch contraction ratios determine the target complexity through the equation sum_i r_i^s = 1, while a separation penalty approximates the open set condition and prevents branch collapse or excessive overlap.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a few implicit DLSS diffusion steps after a network produces a nonnegative spatial probability field, such as a segmentation map, density estimate, or normalized image likelihood. The layer is a nonlinear fourth-order smoother that preserves positivity and is contractive in square-root/Hellinger distance, potentially reducing prediction noise without ordinary Euclidean blurring.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Use two nested Riesz reconstruction spaces to estimate unresolved residual energy for every checkpoint. Under a measurable saturation assumption, convert the coarse and enriched monitors into lower and upper error bounds, and certify a unique checkpoint whenever its upper bound lies below every competitor's lower bound.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Train a neural PDE solver using collocation points sampled from a fixed reference diffusion and a time weight that compensates for the point-start singularity. Replace the Euclidean Hessian by the intrinsic tensor Gθ=σD²uθσ, and use source Picard updates so that nonlinear curvature coupling is iterated under an explicit contraction target.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a theorem-guided regularizer to neural optimal-transport potentials that limits curvature separately in each direction according to the target support width. Unlike an isotropic Hessian penalty, it permits larger curvature along directions where the target is wide and enforces stronger smoothing along narrow directions, preserving anisotropic structure while controlling the transport map's Lipschitz constant.
Useful6/10
Difficulty4/10
Novelty8/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 Euclidean updates and interpolation of probability vectors in a mixture-of-experts router or attention simplex with updates in square-root coordinates, where the Fisher–Rao geometry is spherical. If the task has a desired neutral or calibrated family of distributions, represent that family as a linear subsphere in square-root space and project router outputs onto it after every update.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Parameterize a periodic neural vector field as the sum of a harmonic global drift, an exact gradient field, and a co-exact divergence-free field. This gives separate control over conservative attraction/repulsion, rotational transport, and domain-wide drift, potentially preventing one unconstrained MLP from entangling incompatible dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a global attention truncation rule with a per-query local-tail budget. For each query token, retain nearby or high-priority keys until the estimated discarded interaction strength is below a target epsilon; this uses the paper's central distinction between local tail mass and the extensive norm of the discarded operator. The resulting attention pattern can allocate long-range computation only to tokens whose local tail is large.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the scaled-boundary radial coordinate to control collocation density near a known point singularity or sharp source located at the scaling center. Instead of sampling \(\rho\) uniformly, choose a transformed or Gauss-Jacobi radial rule whose weights analytically cancel the geometric factor \(\rho^{d-1}\), reducing gradient variance and resolving singular fields with fewer points.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace random interior collocation points in domain-integrated neural losses with deterministic points generated by scaling oriented boundary patches toward an interior center. The resulting quadrature exactly integrates low-degree polynomial integrands on affine polytopes and gives a mesh-free, geometry-aware loss for PINNs and neural fields.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a neural network head that predicts a covariance or other SPD matrix entrywise with regression in the matrix-log domain. The network predicts a symmetric matrix in unconstrained Euclidean coordinates, the matrix exponential guarantees an SPD output, and training can use intrinsic log-Euclidean or affine-invariant errors rather than Frobenius error on raw entries.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a standard graph-convolution propagation step with a short time integration of the nonlinear graph flow \(\partial_t u=\Delta_p(u^q)\). The pointwise power \(q\) and gradient exponent \(p\) create state- and edge-gradient-dependent propagation: small signals can be suppressed or amplified by \(q\), while large graph discrepancies receive nonlinear diffusion controlled by \(p\). Use nonnegative feature states and conservative edge fluxes so the layer inherits positivity and total-mass…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add a multiscale penalty to transformer token-mixing activations when they are simultaneously concentrated on a spatial or token subset and on a separated, irregular frequency subset. The penalty uses the fractal uncertainty scaling law to discourage hidden states from collapsing onto narrow token patterns and narrow spectral bands, potentially improving robustness to token masking and frequency-corrupted inputs.
Useful6/10
Difficulty5/10
Novelty7/10