Unverified
2026
Construct a recurrent state-space model with a neutral quasiperiodic phase variable and transverse amplitude variables whose non-autonomous coupling decays polynomially in inference time. The phase subsystem provides persistent torus-like memory, while the transverse subsystem receives only a vanishing perturbation, limiting long-horizon drift caused by continual corrections.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Represent the predicted solution as $u_{\theta}(x)={\rm d}_{\Omega}(x)^s v_{\theta}(x)$, where $v_{\theta}$ is an unconstrained neural network and ${\rm d}_{\Omega}$ is the distance to the boundary. This builds the fractional Dirichlet boundary layer into the architecture and leaves the network to learn the smoother quotient $u/{\rm d}_{\Omega}^{s}$, which the paper proves extends Hölder-continuously to the boundary when the reaction has sufficient integrability.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent a token sequence or image region partition by a pair of planar rooted binary trees and a permutation of their leaves, following the tree-pair model of Thompson-type groups. Train the mixer to produce the same output whether a leaf is left intact or refined into two child leaves that are immediately merged by a matching inverse refinement. This creates a variable-resolution hierarchical module with an explicit consistency constraint instead of relying on an arbitrary fixed tree depth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Modify the probability-flow ODE of a reflected diffusion so that its learned velocity is tangent to the constraint boundary. Use an exact tangent projection for box or sphere constraints, or a smooth boundary-collar correction for general domains, and train with an additional penalty on the predicted normal flux. This prevents numerical trajectories from leaving the domain and targets the no-flux structure directly instead of clipping samples after each solver step.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace random edge dropout in a GNN with an order-aware filtration that removes edges in decreasing local spectral coherence. High-coherence edges are those whose rank-one Laplacian perturbations align strongly with the current local Laplacian, so their removal creates structured, spectrally meaningful augmentations rather than arbitrary damage. Train the GNN jointly on the original graph and several filtration states using supervised loss plus prediction or embedding consistency.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a single graph or token-mixing operator with two coupled channels: an antisymmetric, coherence-preserving transport channel and a state-dependent dissipative diffusion channel. The local feature state controls the dissipative edge rates, so strongly occupied or conflicting regions are smoothed while weakly interacting regions retain rapid coherent propagation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a directional optimal-transport penalty that discourages samples from a model distribution P from exceeding samples from a reference distribution Q in task-relevant coordinates, while allowing a calibrated amount of violation controlled by γ. Unlike symmetric Wasserstein matching, the loss distinguishes harmful upward or downward deviations and can encode that one predictive or reward distribution should dominate another.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace random or degree-based graph positional anchors with a greedy set chosen to maximize the entropy of the graph's Weisfeiler-Lehman equivalence partition. Give each selected anchor a unique trainable embedding, then run several WL-inspired refinement rounds to produce positional cell features. The resulting positional signal should distinguish nodes that ordinary message passing treats identically while using only a small anchor budget.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Attach vector-valued local features to simplices, nodes, edges, or hyperedges and penalize violations of sheaf restriction maps that should make local predictions agree on shared higher-order structures. Evaluate the compatibility loss on progressively degraded subcomplexes, producing a persistence-style robustness objective that rewards features whose global consistency survives structural failures.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Compute a translation- and rotation-robust perimeter feature from the Euler Characteristic Transform and append it to learned shape features. Unlike a finite-radius ECT comparison, the point-anchor subtraction cancels the constant Euler-characteristic tail exactly, eliminating the need to tune a spatial cutoff.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat the hidden-state Jacobian of an RNN, SSM, or graph neural network as a directed matrix-weighted network and decompose repeated block couplings into scalar interaction layers. Use layer-specific structural controllability to select input, skip, reset, or readout channels that can reach all hidden dimensions, and reject architectures with structurally unreachable states before training.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense token or state-mixing matrix with an inverse-capacitance operator whose couplings decay with graph distance, while introducing trainable heterogeneous diagonal capacitances to break spatial symmetries. The layer is cheap because the capacitance matrix is sparse and banded, but its inverse produces global responses with controllable locality.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Correct minibatch or trajectory-based categorical entropy estimates using the paper's power-law occupancy asymptotic. The corrected estimate adds back entropy lost through unseen rare categories, with the correction magnitude inferred from the number of distinct observed categories and an estimated tail index.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a sparse expert cascade whose router uses empirical progress, uncertainty, and compute cost to construct an efficient frontier of experts. Instead of always choosing the expert with the largest immediate gain per FLOP, route different confidence states through an ordered sequence of frontier experts, allowing cheap high-variance experts early and safer or more cost-effective experts near the final decision.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a refined Freudenthal-Kuhn simplicial graph over mesh vertices or geometric samples and inject its piecewise-linear metric into attention logits. Refinement is increased until the explicit distortion target is met, making attention scores less sensitive to arbitrary mesh resolution, triangulation, or local curvature.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent each Euclidean input point by its responses to randomly sampled half-spaces, then center those responses by the minibatch or source-distribution half-space occupancy. Use squared distances between these representations as a geometry-preserving substitute for raw Euclidean distances in graph-NN edge construction, cross-domain retrieval, or geometry-aware attention. The layer can compare point clouds from different ambient dimensions because each domain has its own half-space dictionary…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace direct source-to-target attention connectivity by two sparse incidence relations through a set of latent witness tokens. A source token attends only to a small set of witnesses, and each witness attends only to a small set of target tokens; the composed relation is trained to contain exactly one witness for desired pairs and no witnesses for undesired pairs. This produces a controllable sparse attention pattern whose errors can be measured entrywise against a dense teacher or known mask.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Apply the paper's mechanism-contrast idea to ReLU decoders by requiring each piecewise-affine branch to produce a detectable and distinctive change across at least one activation boundary. Penalize branches with vanishing Jacobian jumps or nearly identical boundary signatures, discouraging observationally interchangeable decoder mechanisms.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's derivative-dispersion mechanism as a neural regularizer: the input-dependent forcing should produce different derivatives in different hidden directions. Penalize collapse of the Jacobian of the forcing map while retaining a contracting recurrent transition, so hidden states do not converge to a low-dimensional manifold caused by nearly parallel inputs.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace unconstrained output coordinates with a neural parameterization whose outputs are valid monotone profiles by construction, analogous to representing a Young diagram through nonnegative ordered row increments. Train the network against an explicit energy or negative log-probability while preserving the feasible geometry, rather than relying on penalties that permit invalid intermediate states.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Use attractor separation and noise-induced basin coalescence as a robustness test for recurrent networks with multiple learned memories or modes. Estimate the smallest perturbation amplitude at which initially distinct hidden-state attractors become geometrically indistinguishable, then train or operate below that threshold with a safety margin.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace uniform or random landmark selection in low-rank attention with approximate greedy pivoted QR selection on the attention matrix. At each step, select the key whose residual attention column has the largest norm, orthogonalize it against previously selected columns, and stop when the residual energy falls below a target tolerance. Use the selected columns as an adaptive attention basis and reconstruct the full attention output through a small coefficient matrix.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace a single recurrent transition with a finite bank of candidate positive linear transitions and use a minimax controller to choose the feedback action at every time step. The controller evaluates candidate successors, selects the action whose worst-case predicted cost is smallest, and clips the action to preserve nonnegative hidden states. This should make an SSM or RNN less sensitive to transition-matrix mismatch and long-horizon disturbances.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
When the Schrödinger generator is learned, regularize its spectrum and eigenvectors so that the magnitude trajectory remains well-conditioned for recovering hidden complex states. Penalize small singular values of the squared-eigenvector matrix and near-colliding eigenvalue pair sums, preventing a learned dynamical layer from becoming spectrally invisible or phase-ambiguous.
Useful6/10
Difficulty6/10
Novelty7/10