✓✓ Beats tuned baseline
2026
Replace ordinary depth-wise feature propagation by a ternary hierarchical block that recursively aggregates three child representations while maintaining separate neutral and defect channels. The block is initialized from the Sierpinski six-vertex recursion, then optionally learns a bounded correction. The neutral channel preserves the paper's cubic mixing law, while the defect channel provides a controlled route for long-range and nonlocal interactions.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Inject weak, unpostselected stochastic perturbations into activations, attention links, or recurrent transitions, but scale their strength according to effective computational size. The schedule is designed so that noise is initially a weak perturbation and becomes dominant only beyond a controlled depth or sequence length, producing a measurable crossover rather than uncalibrated constant dropout.
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace dense pairwise interactions between all forecast horizons with nested time-shell summaries. For sorted horizons, the readout at shell j receives a cumulative embedding of all coefficients or queries assigned to later horizons, reproducing the paper's dependence on products such as \(\Pi_j=\prod_{l>j}e^{\alpha_l}=e^{\sum_{l>j}\alpha_l}\). This gives an \(O(Kd)\) multi-horizon interaction instead of an \(O(K^2d)\) temporal attention block and should work best for weak-memory…
Useful7/10
Difficulty5/10
Novelty8/10
Unverified
2026
Construct a residual neural network or graph message-passing layer whose skip edges are sampled with probability proportional to their distance as $|i-j|^{-(1+\sigma)}$, while retaining a small local backbone. The paper's mechanism predicts that coarse-grained propagation is governed by the long-range kinetic operator and is therefore asymptotically insensitive to the particular Bernoulli graph realization, yielding controllable superdiffusive information transport without dense all-to-all…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace unrestricted global attention or purely local convolution by a sparse distance-dependent interaction graph on a two-dimensional feature map. The edge probability or attention prior decays as \(r^{-(2+\sigma)}\), and \(\sigma\) becomes an explicit architectural control knob: small \(\sigma\) supplies mean-field-like global mixing, intermediate \(\sigma\) supplies long-range Wilson–Fisher behavior, and \(\sigma>2\) approaches a short-range model. The architecture should be evaluated not…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a single local message-passing or convolution operator by a spectrally controlled mixture of fractional and ordinary diffusion. The exponent σ is learned or scheduled, while a crossover gate forces the model to change parameterization near the renormalization-group threshold σ*=2, allowing long-range propagation when useful without retaining an unnecessarily nonlocal operator at short scales.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Augment a sequence model with a scalar phase-like latent field and several coupled channel fields, then add a KPZ-style nonlinear gradient drift between neighboring sequence positions. The coupling is made dimension-aware: it can remain active in effectively one- or two-dimensional latent dynamics, but is annealed toward zero in higher-dimensional dynamics where the paper predicts that weak nonequilibrium perturbations become irrelevant.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace or augment a residual neural layer with a Fourier-domain scale-selective flow containing a learned second-order term and a fourth-order stabilizer. The block permits controlled low-frequency amplification, as required by the KS infrared mechanism, while damping high-frequency feature noise and preventing unbounded spectral growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Interpret successive neural representations as an RG flow and constrain coarse-graining layers to remove unstable or redundant information monotonically. The paper reports monotonic decrease of an effective central charge along measurement-induced RG flows; a neural analogue can use a measurable information-complexity proxy and reject compression steps that increase it while preserving task-relevant information.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct augmented sequences by tiling long contexts with large finite blocks sampled from a library whose local-pattern frequencies match a target dataset, replacing only block interiors and leaving boundary zones untouched. This produces globally coherent synthetic contexts while controlling the distortion of short-range statistics through an explicit boundary-to-volume ratio.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use effective coupling and field values from a local coarse-grained motif to decide whether a neural network should operate at fine or coarse resolution. Near the continuous critical boundary, retain fine-scale features because correlations become long-ranged; away from criticality, aggregate aggressively. Near discontinuous or reentrant boundaries, hysteresis prevents rapid switching between resolutions.
Useful5/10
Difficulty6/10
Novelty8/10