Unverified
2026
Replace or augment standard sinusoidal or RoPE position features with bracket-quadratic phases $e(-\theta n\lfloor\beta n\rfloor)$ generated by a Heisenberg nilmanifold orbit. Multiple irrational coefficients and output frequencies produce a cheap deterministic encoding whose empirical cross-position correlations should exhibit cancellation instead of the periodic aliasing of rational or finite-frequency encodings.
Useful5/10
Difficulty3/10
Novelty7/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
Construct positional or relative-position features as a nonnegative mixture of lattice cosine functions instead of independently signed sinusoidal features. The resulting bias is the Fourier transform of a positive discrete measure with explicitly bounded spectral support, while the mesh and degree can be initialized in the paper's dense-but-controlled frequency regime.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the paper's multicycle result to distinguish useful parameter motion from internally circulating optimizer activity. Add an auxiliary two-cycle diagnostic to an optimizer or recurrent training loop: one cycle represents net loss-improving motion, while another represents momentum or noise circulation that can remain active even when the net parameter update is nearly zero. Penalize or throttle this hidden circulation to prevent apparent convergence from masking high update variance and…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace or augment a scalar periodic positional coordinate with a normalized bank of odd Fourier harmonics, keeping every position on the same-radius sphere. The resulting representation has an explicit translation-invariant similarity kernel, allowing the frequency count and spectral weighting to control how sharply attention distinguishes nearby versus distant phases.
Useful5/10
Difficulty3/10
Novelty3/10
Unverified
2026
Restrict a fine-tuning adapter or output head to the subspace invariant under a prescribed monodromy, analogous to the paper's unbroken flavor lattice. This removes update directions intentionally changed by the domain-loop transformation, producing a parameter-efficient adapter with an explicit algebraic constraint.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Insert a fixed reversible lattice shear into a residual network so successive blocks follow a structured monodromy orbit rather than using unrelated learned transformations. Apply the transformation to a small learned subspace of hidden channels while leaving the remaining channels unchanged. This creates deterministic phase-dependent feature mixing with no additional trainable parameters.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Design sparse attention masks using a graph discrepancy criterion rather than selecting only local or nearest-neighbor edges. A mask with approximately uniform edge counts between every pair of token subsets spreads information globally, while the rigidity consequence provides a principled way to preserve enough independent pairwise constraints for latent geometric features.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained three-token interaction block by three distinct pair maps constructed from anticommuting channel generators. For every token triple, enforce equality of the two composition paths A12 B13 C23 and C23 B13 A12, while retaining different parameters for the three edges. This creates a globally consistent three-way interaction without collapsing to a single shared pair operator.
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Interpret successive neural representations as an RG flow and constrain coarse-graining layers to remove unstable or redundant information monotonically. The paper reports monotonic decrease of an effective central charge along measurement-induced RG flows; a neural analogue can use a measurable information-complexity proxy and reject compression steps that increase it while preserving task-relevant information.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Regularize learned skew generators so that their iterated Lie brackets span many independent feature-mixing directions rather than collapsing to commuting or redundant matrices. This turns the paper's controllability family into a differentiable diversity objective for structured neural layers.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace dense attention on tree-structured inputs with stochastic attention neighborhoods formed by metric balls of sampled radii. Use the paper's exact trimming rule to ensure that every sampled cover remains valid while its total radius budget is bounded, then average predictions over several independent covers during training. This creates sparse, globally covering attention masks with an explicit locality-versus-coverage control.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Regularize hidden activations or per-example gradients with a discrete version of the paper's Z_E^2 norm. Apply an E-norm to the largest fraction of coordinates and an L2 norm to the remaining tail, allowing the model to preserve a few large responses while discouraging widespread heavy-tailed noise.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Build a binary hierarchy over tokens by recursively splitting each active block with a beta-splitting rule, then perform dense attention only inside small leaf blocks and communicate between leaves through learned summaries at internal nodes. The beta parameter controls how balanced the partition is, while the paper's maximum-depth asymptotic supplies a principled depth budget and a way to detect pathological trees.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add an auxiliary loss that makes selected representation coordinates insensitive to all subsets of fewer than d variables while retaining a d-way parity statistic. The objective discourages the network from solving a task through pairwise shortcuts and explicitly rewards a controlled high-order interaction.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the ordinary triangle-inequality budget for merging m linear residual branches or LoRA updates by the sharp quasi-reverse Minkowski certificate. During training, penalize or constrain the Schatten norm of the aggregate absolute update, which certifies the norm of the actually merged update with factor C_{p,m} rather than the loose factor m. This is especially attractive for p=2, where the certificate controls Frobenius energy and can be implemented with standard matrix operations.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a positivity-preserving fractional Schrödinger resolvent into a 1D neural sequence block. Given a nonnegative learned potential V, the layer transforms an input signal f using V^a(-Delta+V)^(-a)f, allowing the network to learn where to smooth or suppress features while retaining an L1 bound independent of the potential magnitude. Use a in (0,1] as a fixed hyperparameter or a clipped learned scalar.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper's eventual path-length bounds to constrain an order-invariant routing graph to a constant-hop communication budget. A learned sparse attention or graph-neural-network layer can explicitly route information through at most three admissible hops, while a more conservative auxiliary route permits at most five minimal-path hops, preventing increasingly long and unstable dependency chains as sequence length grows.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace dense token-to-token attention on a 2D token grid with local attention plus sparse horizontal and vertical communication axes. Tokens at intersections of selected axes receive extra cross-axis attention edges, creating a reinforced sparse graph that can transmit information across large blocks while using far fewer edges than dense attention. The mask should use light-tailed, approximately geometric spacing in both directions rather than heavy-tailed spacing in one direction.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct multiplicative neural gates directly on encoded tensors so that operands are multiplied coordinatewise without decoding between every operation. Polynomial evaluation makes this operation algebraically consistent with multiplication, allowing redundant gated MLPs or bilinear layers to retain fault tolerance while reducing the frequency of expensive correction steps.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the lifted convex hull as a training-time regularizer for pairs of nonnegative neural features, encouraging their empirical second- and third-order interaction statistics to lie in the paper's moment cone. This constrains correlations, squares, and cubic cross-moments jointly through PSD inequalities instead of merely penalizing large activations.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Apply a weighted Caffarelli–Kohn–Nirenberg deficit to selected intermediate feature channels. The penalty discourages features that obtain large weighted responses only by becoming sharply localized or highly sensitive to small input perturbations. It can be evaluated with input-Jacobian estimates and added to the ordinary task loss.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace ordinary isotropic residual noise in a normalized continuous-depth block with projected Brownian forcing on the unit sphere. Apply a shared random symmetric quadratic drift to all tokens, plus a small token-specific tangent perturbation; the shared term preserves structured antipodal dynamics while the independent term removes persistent symmetry and cluster degeneracy. This is intended as a controlled stochastic regularizer, not merely additive Gaussian noise.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the finite-order characterization to learn a nonlinear similarity function for token, patch, or graph-node Gram matrices while preserving PSD by construction or by a differentiable certificate loss. This creates a kernelized attention or graph-readout mechanism in which nonlinear affinity transformations cannot introduce indefinite similarity geometry.
Useful5/10
Difficulty6/10
Novelty6/10