△ Mechanism confirmed, baseline not beaten
2026
Use the paper's families of local graph embeddings to identify repeated occurrences of the same causal substructure across time steps, environments, or entities. Feed every aligned occurrence through one shared transition mechanism and impose an explicit equivariance penalty under the symmetry group acting on occurrence indices, rather than learning an independent predictor for every context.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace uniformly spaced history taps in a neural state-space encoder with a fixed or learned set of non-uniform delays. Regularize the resulting delay-observation matrix to have a large smallest singular value, which makes latent-state reconstruction less sensitive to irregular timestamps and observation noise. This is directly applicable to event-based data, missing timestamps, and systems with multiple time scales.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use discovered infinitesimal generators to create small continuous transformations of hidden states and force a neural predictor to commute with those transformations. This converts symmetry discovery into self-supervised augmentation without prespecifying a group, canonical coordinates, or hand-designed equivariant layers.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Parameterize an entropic OT cost only in directions that can change the transport plan, removing row-plus-column potential directions that are invisible because of OT gauge invariance. Whiten the remaining feature coordinates using their empirical covariance, producing an OT layer whose identifiable parameters have substantially more uniform sensitivity.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace deterministic binary-tree pooling or hierarchical feature aggregation by a stochastic merge that chooses either elementwise addition or elementwise minimum. The mixing probability p controls whether zero or sparse states proliferate or disappear, with a predicted absorbing-state transition at p = 1/2.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace the shared hidden trunk of a multi-output regression network with a small bank of differentiable symbolic units, then let every output use a sparse additive or multiplicative combination of the same units. The architecture explicitly tests whether outputs share a latent mechanism instead of merely sharing arbitrary neural features, improving identifiability and producing equations that can be inspected or exported.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Construct synthetic latent examples from an optimal-transport barycenter of several source domains, restricting the barycentric mass to the context region relevant to the prediction. The resulting representations preserve cross-source consensus while reducing domain-specific nuisance variation. Train on the original examples plus barycentric latent examples with transported soft labels.
Useful7/10
Difficulty5/10
Novelty4/10
✓✓ Beats tuned baseline
2026
Replace raw molecular orientation vectors with local scalar features invariant under common three-dimensional rotations and the apolar transformation u_i -> -u_i. Feed these channels to a CNN autoencoder, VAE, or contrastive encoder so that configurations on the same physical symmetry orbit have identical inputs or latent codes. This should improve unsupervised phase discovery without supplying order-parameter labels.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Represent the physical wavefunction as a fixed cusp factor multiplied by a neural residual, rather than forcing the network to learn Coulomb singularities from data. Use cutoff distance features so the factor is nontrivial only near coalescences and remains numerically bounded at long range. The residual should have substantially lighter Fourier tails and therefore require less network capacity to attain a given energy or local-energy accuracy.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace magnitude-based channel or expert pruning with a subset-selection objective that maximizes the weakest direction in the candidates' activation span. Relax the binary mask to continuous gates, optimize an entropic soft minimum eigenvalue, and round the gates to retain a fixed number of channels or experts. This should preserve diverse representations and reduce redundant feature directions.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independently normalized attention or routing weights with an entropic doubly stochastic transport plan, while choosing its regularization ε using the paper's explicit statistical-stability bound. Increase ε when residual inversion or minibatch fluctuations are amplified, and decrease it only when the estimated bound permits sharper assignments.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the first several convolutional blocks of a small image model with a finite-depth convolution-modulus scattering stem built from a Parseval filter bank. Enforce exact energy accounting and use the paper's polynomial residual law to choose the smallest depth that captures the desired fraction of input energy, avoiding unstable or redundant deep scattering paths.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a random cyclic filter bank or patch projection with the Weyl–Heisenberg orbit of one normalized learnable prototype. Regularize the prototype so that all nonzero shift and modulation correlations have a large and nearly equal magnitude, maximizing the smallest eigenvalue of the induced feature Gram matrix and preventing poorly observed feature directions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a deterministic latent state with a probability measure over latent states, represented by particles or weighted prototypes. Apply the learned latent transition to every particle, so one base trajectory map induces a dynamics on distributions; use an entropy-preservation or entropy-growth regularizer to prevent collapse of the ensemble. The mechanism predicts that any positive base-state trajectory entropy can generate unbounded distinguishability in the ideal measure space through…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace independent Gaussian attention noise or unconstrained token routing with a directed-polymer path distribution over positions and layers. The router aggregates exponentially many monotone paths through temporally correlated random edge scores, producing heavy-tailed but spatially coherent routing and preventing attention from collapsing onto a single token. The paper's t^{2/3} wandering and t^{1/3} free-energy fluctuations become measurable diagnostics and tunable targets rather than…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a routed neural state update from a collection of branch maps whose inverse-style refinement operators are uniformly contractive. The discrete routing sequence acts as an expandable symbolic code, while contraction makes the continuous state associated with a long routing history insensitive to initialization and earlier perturbations. Use a finite active top-\(K\) set during training, but retain an expandable branch table so the model can represent increasingly complex or rare modes.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace the first dense layer on q-ary categorical features by a Fourier interaction layer containing only monomials whose coordinate support is at most s. Use a Bohnenblust–Hille-inspired quasi-norm on coefficients, separately for each interaction order, to prevent a small number of high-order interactions from dominating the output. The resulting model has an explicit interaction-order knob and can be tested against a dense MLP at matched parameter count.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace an unconstrained high-order polynomial interaction module with features generated by Gaussian matrix contractions and their exact Wick expansion. The resulting interactions are sums of products of power-sum invariants, with coefficients fixed by perfect-matching counts, providing a low-parameter inductive bias for permutation- or orthogonal-structured data.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a time-dependent Hamiltonian system on the reduced state $(q,t,p_q)$ rather than on the redundant extended state $(q,t,p_q,p_t)$. A neural Hamiltonian section predicts one canonical representative of each affine cotangent fiber, while an optional symmetry loss enforces consistency under transformations that translate time.
Useful5/10
Difficulty5/10
Novelty8/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 reverse plane partitions of a minuscule heap as the discrete codebook for a VQ-VAE or discrete sequence model. Codes are not arbitrary indices: each code is an order-preserving array, and crystal raising/lowering operators define a sparse, semantically structured neighborhood graph for augmentation, routing, and metric regularization.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace independent Bernoulli branch dropout in a tree-structured mixture or hierarchical MLP with connectivity gates sampled from a q<1 wired random-cluster model. The q<1 law provides conditional negative association across branches, so increasing statistics of disjoint branches have nonpositive covariance; this should reduce redundant expert activation while preserving structured stochastic exploration.
Useful5/10
Difficulty6/10
Novelty6/10