✗ Failed on benchmark
2026
Partition neural-network parameters into competing blocks, such as LoRA adapters, mixture-of-experts heads, or task-specific heads, and update each block by minimizing its local quadratic model while holding the other blocks fixed. Use the exact Jacobi coupling spectral radius to decide whether simultaneous updates are stable; near the boundary, apply damping or fall back to sequential Gauss-Seidel updates.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Apply the paper's compositional PAS idea to recurrent or state-space networks by propagating a polytope of possible hidden states and input perturbations over multiple time blocks. Instead of validating one hidden trajectory at a time, maintain a trusted convex family and re-linearize only when its nonlinear-fidelity tolerance is exceeded. This creates a runtime monitor and adaptive horizon mechanism for long-sequence inference, forecasting, and learned world models.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Construct deep or recurrent networks whose layer weights are correlated across depth with a prescribed power-law covariance, rather than either fully tying or fully independently sampling layers. The paper predicts two usable design boundaries: \(\gamma=1/2\) for divergence of correlation-induced fourth moments and \(\gamma=1\) for loss of summable-correlation flatness.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a large linear map acting on a Cartesian 3D grid and multiple physical channels as a TT-matrix, while retaining separate TT blocks for channel couplings that have different semantics. Apply the layer by sequential contractions with TT cores rather than materializing a dense matrix or a full 3D convolution kernel. Rank truncation provides an explicit accuracy-versus-memory knob and can be applied after optimizer updates.
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace dense graph self-attention with two parallel branches: exact softmax attention only over graph neighbors and a global linear-attention branch that summarizes all nodes through feature-space statistics. A learned node-wise gate interpolates between the branches, allowing locally structured nodes to use sparse attention while retaining a global-information path.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Construct an efficient recurrent or state-space layer whose impulse response follows Mittag-Leffler relaxation instead of a single exponential. A bank of stable diagonal state channels approximates the long power-law tail, allowing the layer to retain information over widely separated timescales with only \(K\) states per feature.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the renewal Age of Information model to schedule refreshes from heterogeneous federated clients, sensors, retrieval indexes, or world-model observation streams. Sources with high downstream importance and reliable, cheap updates receive shorter refresh periods, while unreliable or expensive sources are refreshed less often. Pack the resulting requests into a non-overlapping communication schedule.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace flat all-pairs attention with attention neighborhoods induced by a compatible tree over tokens, patches, nodes, or retrieved items. Retain exact or approximate attention inside nearby tree subtrees and add a path-monotonicity regularizer so semantically distant endpoints are not more similar than intervening tree neighbors.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Build a label-free router for a finite library of neural operators by estimating one shared physical target response from an anchor prediction and using it to rank every candidate through inner products with candidate differences. The method avoids running a full residual-based diagnostic independently for every expert and can be used either to select the best expert or to form a corrected weighted combination.
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace per-particle message evaluation in a point-cloud or particle-based neural layer with exact box moments. Particles inside a box are compressed into a fixed tensor of monomial sums, and every query in that box evaluates the same piecewise-polynomial interaction from those moments, reducing work from particle-query pairs to particles plus occupied boxes.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add an interacting-multiple-model monitor to a recurrent or distributed neural training loop, with one state estimator for each candidate feedback delay. The monitor detects when gradients, hidden-state feedback, or parameter acknowledgements become stale, allowing the system to reduce the learning rate, discard delayed updates, or switch to a safe synchronous mode before delayed feedback destabilizes training.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Insert channelwise normalization whose mean and variance are pooled over the full sequence, allowing a small-receptive-field convolutional labeler to access global sequence statistics without adding dilated convolutions or attention. Use this only for tasks where labels occur in long runs or depend on coarse global composition; retain per-position normalization for tasks requiring strict locality.
Useful7/10
Difficulty3/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed-size learned latent for an array-valued complex tensor with a variable-length list of continuous rank-one spectral atoms. An encoder predicts candidate receive direction, transmit direction, residual off-grid offsets, and complex gains; the decoder reconstructs the tensor analytically from the array-response formula, so changing the antenna dimensions does not require changing the decoder weights.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the unstable classical derivative of a discretized rough energy component with a matched dilation quotient derived from its intrinsic scale recursion. Use this field inside kick-drift-kick proposals and apply an exact Metropolis correction, allowing the proposal field to be measurable and nonconservative rather than an exact neural-energy gradient. The experiment should test whether acceptance rates and posterior samples remain stable as the rough-energy resolution increases.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Train one prompt-conditioned controller to solve a distribution of stochastic control tasks directly from the control objective, instead of generating an optimal trajectory dataset for every task. Use the probability-flow velocity to evolve particles deterministically, evaluate running and terminal costs on those particles, and backpropagate through the rollout to learn a reusable operator.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained trajectory or density network with a stack of RealNVP-style triangular coupling layers whose inverse and log-volume change are analytic. Condition the coupling subnetworks on the task prompt and time, so the same invertible module represents task-specific population states while providing an exactly computable density and score surrogate.
Useful7/10
Difficulty5/10
Novelty4/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a batch of token or feature directions as columns of a matrix X, and construct a complementary feature basis Y whose columns are annihilated by X under a diagonal gauge. Use Y as a second algebraically complementary channel for attention or token mixing, either replacing redundant feature projections or regularizing them toward an exact nullspace relation.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Approximate the exact event-by-event lifted sampler by drawing independent Poisson jump counts over a short interval and applying compatible discrete moves in parallel. This converts sequential neighbor events into batched GPU-friendly updates while retaining the Hamiltonian rate structure; the step size controls the error-versus-throughput tradeoff.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Add sparse directed coupling between parallel neural modules, recurrent states, or distributed replicas so that each module is driven toward a common trajectory without forcing an undirected or balanced communication graph. Select n-1 directed paths per strongly connected component and assign gains using the estimated Lipschitz bound of the uncoupled module; activate the coupling only when its graph-certified strength exceeds the predicted synchronization threshold.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace the final layer of a neural predictor with Bayesian linear regression over deterministic trigonometric features, retaining a computable posterior variance and a high-probability confidence envelope over the full bounded input domain. Use this envelope to reject unsafe actions, downweight uncertain training targets, or restrict optimizer updates in regions where the network is extrapolating.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Represent a stochastic recurrent or state-space model as an event trajectory and train it with trajectories conditioned on a rare terminal event, such as a catastrophic state, a constraint violation, or an unusually large prediction error. Instead of simulating forward until the event occurs, update connected spacetime clusters while holding the initial state and terminal event boundary fixed, so every retained trajectory is useful for rare-event learning. This provides a principled alternative…
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition by a sequence of exact SU(1,1) hyperbolic updates. The layer processes each token with a 2-complex-dimensional state and preserves the indefinite energy |a|^2-|b|^2=1 exactly, preventing numerical drift while retaining non-unitary amplification and attenuation.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment each recurrent or state-space hidden channel with a two-dimensional oscillatory state and periodically compute a pseudo-phase from its Cartesian coordinates. Use sparse event-triggered feedback to reduce the squared phase order parameter, preventing hidden channels from synchronising while avoiding the computation and communication cost of continuously recomputing the control signal. The controller acts as a tangent rotation of each two-dimensional hidden state, changing phase diversity…
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace a stack of independently parameterized residual or MLP blocks with a small latent grid or vector repeatedly updated by one shared transition rule. Let the number of updates depend on the current latent state, so easy examples terminate early while hard examples receive more computation, potentially improving parameter efficiency and extrapolation.
Useful7/10
Difficulty5/10
Novelty6/10