✗ Mechanism failed
2026
Replace a trainable shallow MLP hidden layer by a frozen bank of smooth sigmoid ridge functions and train only a linear output head. Choose the feature count and parameter sampling regime using the theorem's explicit dependence on input dimension d, target regularity k, evaluation norm m, and confidence delta. The construction is especially appropriate for smooth regression, scientific surrogate models, and PINNs, where derivatives of the network output are part of the loss.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a single smooth neural vector field with a finite collection of smooth subnetworks selected by learned affine hyperplanes. The architecture exposes switching geometry directly, allowing it to represent friction-like or threshold dynamics without approximating discontinuities using excessively steep activations.
Useful7/10
Difficulty5/10
Novelty6/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
△ Mechanism confirmed, baseline not beaten
2026
Freeze a wide neural spatial dictionary, then compress and whiten it using the quadrature mass matrix before solving for output coefficients or latent PDE states. The retained basis removes feature directions that are numerically invisible or nearly dependent under the actual domain discretization, while preserving the represented function space up to the chosen SVD rank.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a conventional linear decoder in an autoencoder or latent state-space model with an explicit quadratic manifold decoder, allowing a small latent vector to represent curved and transport-like state trajectories. Add a dynamics-aware invariance loss that penalizes the discrepancy between the time derivative of the quadratic manifold and the neural dynamics evaluated on that manifold.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Do not force Hodge dissipation onto harmonic edge modes, because these modes are precisely the obstruction to global coercivity. Split the latent state into dissipative coexact modes and a finite-dimensional harmonic branch, and use harmonic-decoupled interactions so each harmonic coordinate defines an invariant affine fibre with its own attractor.
Useful7/10
Difficulty6/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 failed
2026
Precondition activation or cache blocks with a fixed product U = A Sigma B of orthogonal transforms and a random signed permutation before quantization or coordinate sampling. The random permutation makes the product incoherent, so energy is less concentrated in a few coordinates and lossy compression should introduce less worst-case distortion.
Useful7/10
Difficulty5/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 failed
2026
Replace fixed random Fourier features in a coordinate network or PINN with a small complex Fourier dictionary whose propagation directions are learned from a weighted residual. Given directions, solve the linear feature coefficients exactly or by ridge regression, and optimize only the directions in the outer loop. This should represent low-directional-complexity fields with fewer features and avoid wasting gradient updates on coefficients that can be fitted analytically.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Attach a deterministic supervisory automaton to a neural policy or sequence model and mask every event disabled by the current supervisor state. Use a short receding-horizon planner over admissible events to resolve conflicts between neural preferences and shared-resource constraints. The network scores useful actions, while the automaton supplies an exact safety layer.
Useful7/10
Difficulty5/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
Use a learned scalar ordering function to turn a symmetric local Gaussian graph kernel into a directed, row-stochastic message-passing operator. The asymmetric tilt lets neighboring nodes communicate preferentially along an inferred dynamical direction, while the Gaussian factor retains locality and diffusion-like smoothing.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach an SU(2) transport matrix to every directed edge of a graph neural network and penalize nontrivial plaquette holonomies instead of penalizing individual edge transformations. The regularizer is invariant to arbitrary local changes of latent representation frame, encouraging path-consistent relational features without requiring all edges to share one global coordinate system.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace pointwise sequence reconstruction with reconstruction of overlapping past and future Hankel windows in a shared latent manifold. A first encoder compresses the delay-coordinate trajectory, while a second decoder or predictor reconstructs the future block from the latent state; training therefore penalizes representations that fit observations but do not preserve dynamical evolution.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a dense Haar or Gaussian random projection with a streamed product of random two-coordinate rotations followed by coordinate subsampling. The transform is exactly orthogonal before subsampling, requires only a list of rotation triples, and the paper's pseudo-mixing result predicts that degree-two statistics relevant to norm preservation and Johnson–Lindenstrauss embeddings become Haar-like after only O(n polylog(n)) rotations.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace signed-input aggregation in a spiking recurrent cell with a causal micro-event queue that processes excitatory and inhibitory arrivals in timestamp order, applying threshold and reset after each event. This preserves computations that disappear when all events in a timestep are replaced by one net current, particularly near threshold.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural transport layer by parameterizing a convex potential whose gradient maps a semi-log-concave latent distribution into a compact convex data domain. Use the paper's dimension-free Lipschitz certificate to set the layer's Jacobian scale, initialize the potential, and reject or regularize parameter updates that create excessive curvature. The goal is a bounded-output transport module that is less sensitive to latent dimension than diameter-based spectral heuristics.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Make a neural network predict a vector potential rather than a magnetic or velocity field, then obtain the physical vector field with a fixed differentiable discrete curl. The reconstructed field satisfies the discrete divergence-free constraint exactly, eliminating divergence-penalty tuning and preventing constraint drift during long rollouts.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a conventional whitening transform with a constrained whitening layer that minimizes cross-channel covariance while requiring every output channel to remain correlated with its designated input channel by at least a threshold \(\rho_{\min}\). The layer exploits the orthogonal freedom in whitening to find a rotation that preserves channel identity instead of arbitrarily mixing features. It can be inserted before an MLP, convolution, or attention projection and compared directly against…
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Add a weighted reflection symmetry to an attention or graph-propagation matrix instead of requiring ordinary permutation equivariance. For paired positions or graph nodes related by an involution, penalize the failure of the propagation operator to commute with the weighted reflection; this makes all geometric multi-step propagations symmetry-compatible. The method is suitable for data with mirror, reversal, paired-agent, or left/right structure where the two sides have unequal importance…
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Prune redundant attention heads using separate similarity scores for sink behavior and content routing. Two heads are considered safely redundant only when their normalized content compositions are close in Aitchison distance and their sink-mass trajectories are also close, avoiding pruning decisions dominated by a shared sink token.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Make a neural network predict a positive Gaussian-mixture representation of the distribution function rather than independent values on a momentum grid. Use the mixture parameters inside a differentiable Boltzmann collision operator, so training directly enforces the interaction mechanism and exposes the relaxation spectrum responsible for ballistic-to-hydrodynamic crossover.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a Bloch-conditioned neural model whose periodic-factor representation transforms covariantly when the supplied Bloch wavenumber is shifted by a reciprocal lattice vector. Either canonicalize q to the first Brillouin zone or augment training with mathematically paired examples whose outputs differ by the exact phase gauge. This prevents the network from learning inconsistent predictions for physically identical Bloch modes.
Useful7/10
Difficulty4/10
Novelty8/10