Unverified
2026
Apply consensus-based derivative-free optimization independently in parameter blocks that are expected to contribute additively to the objective, using noise projected into each block rather than isotropic noise over all parameters. The method is most suitable for low-dimensional trainable objects such as LoRA adapters, soft prompts, calibration vectors, or neural architecture hyperparameters, where maintaining a small population of particles is feasible.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a periodically driven hybrid recurrent state-space model whose vector field is piecewise smooth across learned switching surfaces. Engineer a transverse homoclinic intersection around a hyperbolic recurrent state; the resulting shift-like invariant set provides a controllable symbolic reservoir for sequence prediction and long-horizon generation.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Use the tropical dynamical degree as an analytic expansion budget for repeated neural blocks. Layers with $pq>4$ deliberately expand along a known tropical eigendirection, while layers with $pq\leq4$ avoid exponential asymptotic growth; a schedule can therefore increase representational mixing without allowing hidden-state norms to explode.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace an unconstrained latent ODE vector field with a contact-Hamiltonian flow whose velocities lie in a horizontal distribution spanned by a small set of vector fields. Couple the latent state to a scalar energy or confidence variable through a strictly decreasing value-dependent Lagrangian, giving expressive but dissipative dynamics rather than unrestricted feature drift.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the usual squared input-Jacobian penalty with a stochastic approximation of the affine Sobolev energy, which computes an inverse-power spherical average of directional derivative norms. The negative exponent emphasizes directions with unusually small sensitivity and prevents the regularizer from being represented only by the largest-gradient direction.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent transition on a state (q,p) with a discrete variational transition generated by a strictly convex distance-like function L(q,q_1). The next state is found from the implicit reflection equation L_2(q,q_1)+L_1(q_1,q_2)=0, while the induced two-form is preserved by construction; this should reduce energy-like drift and exploding or vanishing sensitivity over long sequences.
Useful5/10
Difficulty6/10
Novelty4/10
Unverified
2026
Replace independent per-task fine-tuning directions with a learned connection that transports shared network weights across a low-dimensional task or domain coordinate space. Penalize connection curvature so that adapting from task A to task C directly agrees with adapting through intermediate task B, reducing order-dependent drift and improving interpolation between sparsely observed tasks.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Augment pairwise attention on a set of n tokens with a rigidity operator derived from normalized pairwise directions. The operator couples infinitesimal node displacements through changes in pairwise distances, while the complete-graph theorem provides a geometry-independent eigenvalue target n/2 after spherical centering and normalization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a piecewise Möbius transformation as a deterministic latent mixing layer, using the paper's exact branch structure rather than a generic unconstrained MLP. The transformation repeatedly moves points between branches while preserving a known reference density, creating a cheap chaotic mixer with analytically computable Jacobian factors. Use a truncated, normalized version in practice so that the sigma-finite invariant measure becomes a valid finite training distribution.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Split the trainable state into an explicit scalar scale coordinate and a residual perturbation, then update them with separate time scales. Penalize residuals according to their distance from the scale-dependent core, so the optimizer cannot obtain apparent progress by destabilizing the scale mode. The method is a neural optimization analogue of the paper's modulation argument, not a direct consequence of the geometric singularity theorem.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the logarithmic exhaustion as a geometry for bounded hidden representations rather than only as a parameter constraint. A representation approaching the boundary receives an increasingly large metric, making ordinary Euclidean motion expensive and discouraging brittle saturation while preserving a bounded intrinsic gradient for the boundary coordinate.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use linking number as a diagnostic and optional regularizer for representations of paired closed data manifolds. The probe identifies layers that collapse or separate class geometry through collisions and folds, giving an architecture-selection signal beyond loss and Jacobian singular values.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Use the paper's asymptotic null law to decide when two minibatch covariance structures are statistically distinguishable, rather than applying a fixed covariance-matching weight throughout training. This creates a confidence-gated regularizer that is strong when discrepancies exceed sampling noise and weak when the observed difference is compatible with finite-batch variability.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Equip a learned embedding with a pullback Riemannian metric and regularize the bottom eigenvalue of the operator -Δ_g+γ scal_g. The regularizer searches for localized functions with low Dirichlet energy plus curvature potential, thereby penalizing unstable regions that ordinary Jacobian-norm penalties may miss.
Useful5/10
Difficulty8/10
Novelty8/10
Unverified
2026
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Useful5/10
Difficulty5/10
Novelty6/10