△ Mechanism confirmed, baseline not beaten
2026
Constrain a neural parameter block to a bounded open domain and replace its Euclidean optimizer with a Riemannian gradient induced by the Hessian of the logarithmic barrier g=-log(-rho). The metric diverges near the boundary, so updates automatically become small when parameters approach saturation or an invalid region, while the logarithmic exhaustion has bounded intrinsic gradient.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a dense channel or token-mixing matrix with a product of positive bidiagonal factors, so information propagates through a controlled sequence of local couplings rather than arbitrary signed interactions. Initialize the factors from the paper's barycentric-subdivision factorization, then learn positive diagonal and off-diagonal parameters; the resulting map is structured, parameter-efficient, and constrained to remain totally positive.
Useful6/10
Difficulty5/10
Novelty8/10
✓ Mechanism works
2026
Replace unconstrained per-frequency recurrent dynamics in a Fourier neural operator or spectral state-space model with oscillators initialized from the plasma dispersion relation \(\omega_k=\sqrt{\underline{b}^{2}+|k|^{2}}\). Each Fourier mode first undergoes a norm-preserving rotation at its prescribed frequency, while a small learned residual and optional nonnegative damping account for task-specific dynamics. This should reduce phase drift and exploding or vanishing activations when modeling…
Useful6/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Represent the PINN solution in a restricted polynomial or Taylor basis whose exponent set is supplied by tropical support analysis, instead of asking an MLP to discover the local series structure from scratch. The restriction removes coefficients that cannot occur in the formal solution, reducing trainable degrees of freedom and preventing spurious low-order or singular terms.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace a free-form order-dependent gate with a positive mixture of Mellin powers $(1+s)^{-a}$. This gives a small, interpretable module whose response across the order variable is automatically generated by a positive measure and therefore inherits complete monotonicity, log-convexity, and Hankel-moment structure.
Useful6/10
Difficulty4/10
Novelty8/10
✗ Mechanism failed
2026
Replace pointwise spectral normalization of an RNN transition with a stability constraint on the entire family of input-conditioned matrices. Use a learned positive-definite metric P so every transition contracts in the same state geometry, approximating the paper's uniform exponential stability and input-forgetting guarantee.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace scalar neural activations by pairs of nonnegative channels whose ratio represents the signed or unsigned activation. Implement multiplication and addition through pair algebra, and renormalize each pair because the representation is invariant under multiplying both rails by the same positive scalar. This creates an explicitly bounded, cancellation-aware arithmetic layer for deep multiplicative MLPs, rational networks, and neural fields.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a diagnostic and optional regularizer that measures whether a neural block's multi-step directed interactions differ strongly when traversed forward versus backward. This catches transient directional amplification in deep acyclic or nearly nilpotent networks, which eigenvalue or spectral-radius penalties can miss because all eigenvalues may be zero even though short directed walks are large.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2025
Replace a conventional scalar activation by a geometrically indexed family of affine pieces whose slope changes with the logarithmic magnitude of the input. The same two endpoint parameters are reused across all scales, giving a compact, explicitly scale-aware activation that can represent different responses for exponentially separated activation magnitudes.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use diagonal similarity scaling to reduce the induced infinity norm of a sparse recurrent transition or companion operator before or during training. Similarity preserves eigenvalues while changing coordinate-wise amplification, so the method can suppress non-normal transient growth without changing the represented linear dynamics.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Initialize directional prototypes, cosine-classifier weights, or angular attention directions with a spherical t-design rather than iid random vectors. Exact matching of spherical moments through degree t should provide uniform angular coverage and reduce initialization anisotropy, especially when the number of prototypes is small.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace independently random unit-normalized prototypes in a spherical classifier, vector-quantizer, or prototype contrastive head with prototypes selected to cover the sphere evenly. The method directly targets the paper's finding that weak-signal spherical K-means preserves initialization-induced Voronoi structure, reducing redundant prototypes and making early assignments less dependent on random seed.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Treat a finite shallow network as a discrete signed measure over ridge atoms and grow or prune neurons according to their contribution to total variation. This turns width selection into an atomic approximation procedure: add neurons correlated with the current residual and remove coefficients that consume budget without contributing materially.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace ordinary per-coordinate activation normalization or covariance whitening with a learned or frozen affine map based on a minimum-volume ellipsoid calibrated to the activation convex hull. Estimate the hull's Minkowski symmetry and use the bound \(\rho=\sqrt{d/\alpha}\) to set a principled clipping radius, where \(d\) is feature dimension and \(\alpha\) is the measured symmetry. This should reduce worst-case clipping of asymmetric activation distributions without requiring a much larger…
Useful5/10
Difficulty6/10
Novelty4/10
Unverified
2026
Replace raw polynomial features in a scalar MLP expansion with endpoint-weighted orthonormal Jacobi features. The paper's envelope gives a degree- and parameter-aware scale for each feature, preventing high-degree terms or endpoint behavior from dominating gradients while preserving a richer approximation basis than low-degree monomials.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add coefficient-spreading and moment-calibration mechanisms to binary or sign-noised linear layers. For each output neuron, normalize its real-valued weights and penalize large normalized coordinates, so its signed preactivation obeys the paper's quadratic Gaussian approximation rather than the weaker linear bound. This should make activation scales more predictable and reduce training instability caused by highly concentrated binary projections.
Useful5/10
Difficulty3/10
Novelty4/10
Unverified
2026
Replace a dense token- or channel-mixing matrix with a product of local braid generators acting on adjacent coordinates. Each generator is an exactly invertible 2-by-2 transformation, while the braid and far-commutativity identities give multiple equivalent factorizations of the same global operator. This creates a sparse, reversible mixer with O(kn) cost for a braid word of length k, rather than O(n^2) cost for a dense matrix.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a dense learned polynomial-feature transform with a d-orthogonal recurrence whose production matrix is constrained to a (d+2)-banded lower-Hessenberg form. The layer generates successive features using only local recurrence coefficients, giving O(dN) arithmetic and O(dN) parameters for N basis functions instead of O(N^2) dense mixing.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a classifier whose normalized class vectors form an explicit 2d-line equiangular tight frame instead of using independently initialized weights. The ETF gives every class the same norm, equal pairwise coherence, and an isotropic frame operator, which should make final-layer gradients better conditioned and reduce accidental class crowding. The classifier can be fixed, or restricted to a learned unitary rotation of the ETF so that its geometry is preserved during training.
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Initialize and train a linear recurrent or state-space transition using the stochastic Lyapunov operator rather than only constraining the drift matrix to be Hurwitz. Start from a controller that stabilizes the drift-only dynamics, then continuously increase the multiplicative-noise coefficient and update the controller while enforcing a positive-definite Lyapunov certificate. The resulting module should avoid exploding hidden states when process noise depends on the hidden state or input.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the first learned one-dimensional convolution or STFT-like feature extractor with a differentiable bank of time-frequency shifts of a totally positive window. Parameterize the temporal spacing \(\alpha\) and frequency spacing \(\beta\) so that \(\alpha\beta<1\) is always satisfied, giving a mathematically certified oversampled representation instead of an arbitrarily subsampled filterbank.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the layer at which persistent connected components and holes disappear to allocate capacity nonuniformly across a network. If representations simplify much earlier than desired, widen the responsible layers or insert an additional block; if simplification is excessively delayed, avoid spending parameters there. This turns persistent-homology COM into an actionable architecture-search signal rather than a post-hoc visualization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add an algebraic diversity barrier to a companion or polynomial state-space layer so that its coordinate projections do not become simultaneously degenerate. The barrier uses the paper's Schur-polynomial factorization instead of explicitly enumerating every maximal minor, and can be applied during initialization or training to improve multi-coordinate observability and reduce ill-conditioned state representations.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace or augment a singular scalar activation \(\sigma\) with a distributionally regularized activation \(g\) whose Fourier transform is multiplied by \((i\rho)^\alpha\). This suppresses the problematic low-frequency singular component and can produce better-conditioned random-feature or first-layer representations, while a residual raw-activation branch prevents loss of standard approximation behavior.
Useful5/10
Difficulty5/10
Novelty8/10