△ Mechanism confirmed, baseline not beaten
2026
Attach a learned controller to a physical or simulated plant and use a continuous safety certificate to compute a conservative remaining-time budget before the current action or latent prediction can become unsafe. Compile this spatial margin into a unit-rate temporal contract, allowing asynchronous inference, batching, or early execution without online rollout integration; trigger a new network evaluation only when the countdown reaches a guard threshold.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Treat a change in a neural network mask, expert set, layer width, or adapter configuration as an optimal transition problem rather than an instantaneous switch. A cheap planner proposes a short sequence of topology masks and parameter interpolations, while an expensive forward-pass feasibility filter rejects each candidate intermediate model if it violates accuracy, activation, norm, latency, or memory limits. This permits dynamic pruning and MoE reconfiguration with a certificate that the…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Embed every variable-domain sample into one fixed ambient hyperrectangle and append its signed-distance function as an additional channel to the operator input. Deterministically extend fields outside the physical domain, resample them onto a shared latent grid, apply standard Fourier layers, then interpolate and mask the output on the requested target discretization. The network learns the operator rather than a separate geometry encoder, so the same weights can be used across shapes and mesh…
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace selected dense neural-network operators by low-rank factors whose rank is selected by a randomized residual test at a user-specified tolerance. Construct candidate bases in large blocks for efficient matrix operations, then prune the block to the smallest rank that passes the residual criterion instead of treating the block size as the final rank.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Remove a latent relay or hub token from an attention or graph layer and replace its two-hop influence by direct effective edges between retained tokens. The correction is a normalized rank-one update, so it can preserve hub-mediated communication while reducing the number of stored and processed states.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace explicit thresholding of a large structured routing-logit tensor with the paper's cubic sign iteration applied directly to its TT cores. The resulting approximate sign field can be converted into binary expert gates or binary activation masks without materializing all tensor entries, enabling routing over exponentially large Cartesian index spaces. Use TT rounding after each Hadamard product to prevent rank explosion, and compare the method against dense thresholding on smaller…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense block of a large neural-network weight matrix with an adaptively constructed cross approximation, but prevent premature termination using residual checks on O(m+n) additional diagonal-like entries. Accept a rank only after the probe residual has remained below tolerance for several consecutive iterations; otherwise continue adding pivots.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Compress the hidden state of a stable neural state-space layer using low-rank controllability and observability Gramians. States that are difficult to excite from the input or weakly visible at the output are removed, producing a smaller recurrent state with a principled input-output preservation criterion.
Useful6/10
Difficulty5/10
Novelty6/10