Unverified
2026
Replace independent token scores with a query-conditioned positive-semidefinite low-rank quadratic score over a fixed-size selected subset. Repeatedly convert the quadratic objective into a linear exposure vector and apply a cheap top-k oracle, allowing the selector to model joint token interactions without constructing an n-by-n attention matrix. The margin between the current low-dimensional shadow and alternatives provides a practical confidence or early-stopping signal.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent the hidden state of a recurrent or implicit neural block by a convex reachable set and encode its recursive constraints as containment inequalities rather than unrolling a fixed number of steps. Eliminate the set variables to obtain the smallest representable invariant set, which can be used as a tighter robustness certificate, a training regularizer, or a principled initialization for equilibrium solvers.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Construct a symmetric feature-interaction or Jacobian matrix A_theta whose desired rank is t, then regularize its t-th compound matrix toward rank one. This transfers the paper's identity that a rank-t matrix has a rank-one t-th compound, while the rank-one factor encodes Plucker coordinates of the kernel subspace.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Augment gradient descent with a directional-search step when the gradient norm is small or the loss has stalled. In each parameter block, evaluate a small positively spanning set of normalized perturbations, use their directional loss slopes to identify descent directions, and combine them through nonnegative coefficients so that the update remains inside their positive span. The cosine measure supplies a quantitative trigger: low directional coverage means the current perturbation pool is not…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace soft pairwise repulsion between learned prototypes or codebook vectors with an active-set feasibility layer based on the paper's first-order admissible cone. Pairs exactly at the minimum distance contribute linear half-space constraints to the update, while separated pairs do not unnecessarily restrict motion. This should reduce prototype collapse and make constrained embedding or quantization training less sensitive to penalty weights.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Regularize an encoder so that geometrically equivalent augmentations preserve the colored interaction profile across scales. Unlike a scalar overlap loss, the objective penalizes changes in connected overlap and alternating higher-dimensional topology simultaneously over a radius grid.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add a measurement-conditioned attention layer with two explicitly separated fields: a geometry-only inverse-temperature profile that controls interaction strength and an outcome-dependent chemical-potential bias. For a region bounded by coordinates a and b, force the interaction gate to vanish as the square root of the distance from either boundary, while allowing a separate potential channel to encode measured values.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Represent each class or concept by a convex latent body containing the origin, and penalize violations of the paper's sharp Gaussian Brunn–Minkowski inequality when two bodies are interpolated by Minkowski addition. This regularizes latent supports toward geometries whose Gaussian probability mass remains predictable under interpolation, potentially improving interpolation robustness and out-of-distribution behavior.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace a dense channel-mixing matrix in a sequence layer with alternating diagonal propagation and sparse unipotent Stokes jumps. The diagonal part carries independently controlled exponential phases, while the unipotent factors implement cheap residual-like mode conversion without changing determinant or requiring a dense matrix multiply. Constrain the phase magnitudes and jump coefficients during training to obtain a reversible, norm-monitorable mixer.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a softmax transition or mixture-of-experts router by probabilities obtained from squared amplitudes of an isometric latent transition. Each input state is mapped to an orthogonal latent subspace, and summing probability over the latent index produces the desired expert or next-state distribution. The latent amplitudes can retain information that would be destroyed by directly averaging expert outputs, while normalization is guaranteed by construction.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Build a parameter-free spectral channel mixer whose channels are arranged as components of an l-form and whose multiplier is the trace-free Beurling--Ahlfors transform. At every nonzero spatial frequency it mixes the exact and coexact channel subspaces with opposite signs, preventing a uniform channel-direction bias and preserving a structured cancellation property. Insert it as a residual branch before a convolution, MLP, or attention block, with one learned scalar gate controlling its…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's lower bound on nearest-correlation repair cost to detect when a neural network's pairwise similarity predictions contain too much globally incompatible off-diagonal energy. Instead of projecting every predicted matrix onto the correlation cone, train the network to reduce the repair-risk statistic or trigger expensive repair only when a cheap diagnostic predicts substantial distortion.
Useful5/10
Difficulty4/10
Novelty6/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
Replace fixed-radius image blur or pooling with disk averages whose radius is proportional to the distance from each pixel to the image boundary. Compute the transform at every spatial location and train a lightweight decoder to reconstruct the pre-transform feature map, using reconstruction error as an anti-collapse regularizer. This creates a scale-adaptive smoothing layer with an injectivity motivation in the continuum while providing larger context in the image interior.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a positive multiplicative perturbation to the node or token measure of a symmetric neural operator and use the paper's eigenvalue-response matrix to identify nearly degenerate eigenspaces. Train the perturbation or its scale so that repeated eigenvalues split with a controlled minimum gap, making spectral positional encodings and eigenvector-based message passing more stable.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the Lovász-style prescribed inner product as a differentiable regularizer on node embeddings. Positive and negative signed relations are compared through the identity or the involution respectively, encouraging a representation whose geometry respects signed colouring constraints and remains invariant to switching gauges.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Use the paper's explicit square insertion surgery to generate new quad-mesh examples with altered local valence patterns but unchanged genus, unchanged non-target vertices, and unchanged rotational-holonomy subgroup. Train a mesh GNN with consistency loss or label-preserving augmentation across the original and surgically modified meshes, forcing predictions to depend on global structure rather than accidental local tessellation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add an exact angle-aware support-function penalty to a network that predicts a convex region around points, trajectories, or latent embeddings. For each triangle orientation, the penalty checks the paper's weighted support inequality rather than sampling many boundary points, encouraging globally valid geometric coverage with only three directional support evaluations.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent or state-space transition with a complex-orthogonal flow generated by a skew-transpose matrix. The transition preserves a bilinear quadratic quantity exactly, preventing repeated application across long sequences from causing norm explosion or decay in the linear dynamics.
Useful5/10
Difficulty5/10
Novelty5/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
Add a multiscale Hamming-ball discrepancy penalty to a learned discrete codebook or tokenizer. The penalty forces the selected codewords to distribute their mass so that every center and radius sees approximately the global expected fraction of codewords, discouraging collapsed or highly clustered codebooks and potentially improving robustness to symbol substitutions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a large flat positional-embedding table with a recursively decoded nine-way address whose child transformations contract coordinates by exactly 1/3. Encode an input position using features attached to the address prefix at several depths, guaranteeing that increasing depth produces a geometrically localized representation and that an infinite valid address cannot ambiguously represent two distinct points. This is especially suitable for 2D vision tokens, maps, point clouds, or…
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Replace or augment LayerNorm on a hidden representation by a learned volume-preserving linear map that minimizes the representation cloud's spherical mean width relative to a volume proxy. The determinant constraint prevents trivial shrinking, so the module targets anisotropy and elongated activation clouds; the expected benefit is a tighter geometry that is easier to quantize or cover with a small codebook.
Useful5/10
Difficulty6/10
Novelty7/10