△ Mechanism confirmed, baseline not beaten
2026
Use a bounded function of the response to form a supervised, label-weighted covariance of the input and initialize the first neural layer from its leading outlier eigenspace. For vector-valued responses, use a matrix-valued response preprocessing map so several label statistics are combined in one lifted spectral estimator.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace direct learning of a highly cancelling signed observable with a quotient-space model over symmetry orbits of inputs. Predict a physically constrained baseline for each family and use an LSTM or set/graph encoder only for the residual many-body correlation, then aggregate family predictions with known signed weights instead of forming a noisy sample-level ratio.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use neural networks to estimate outcome and treatment nuisances, then edit the resulting debiasing weights so that residualized treatment is conditionally orthogonal to an adversarial class of covariate functions. This should reduce coefficient bias when the two nuisance networks have strongly imbalanced approximation errors, without requiring either network to be correctly specified.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a cheap shared multi-task probe briefly, extract one semantic embedding per task, and use density-based clustering to determine which tasks should share a neural trunk. After clustering, replace the globally shared trunk by one trunk per discovered cluster, with task heads remaining separate; this preserves cooperation among related tasks while isolating destructive task interactions.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the raw DFA outer-product update with a damped left-right preconditioned update that whitens both presynaptic activity directions and local-error directions. The activity factor removes nuisance-dominated input anisotropy, while the error factor equalizes postsynaptic credit coordinates; separate damping prevents noisy error covariances from destabilizing training.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Train a neural surrogate to predict outputs in a source-domain ZCA-whitened space, then adapt to a shifted domain using only the shifted domain's output mean and covariance. At inference, transport the network prediction through the target covariance square root, yielding a weight-free correction that preserves output-coordinate semantics and can be applied to MLP, CNN, graph-NN, or transformer regressors.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a data-fitted PCA bottleneck followed by a sparse multivariate Hermite polynomial head for a Gaussian-like latent representation. The head explicitly represents low-order and selected high-order interactions, while PCA controls high-dimensional input and output truncation error instead of forcing a generic MLP to learn these structures from scratch.
Useful7/10
Difficulty5/10
Novelty7/10
Audited (legacy)
2026
Replace uniform embedding dimensions with a globally budgeted allocation based on the estimated spectral complexity of each categorical feature. Tables whose category representations have large leading singular-value energy receive more dimensions, while high-cardinality tables are penalized because each extra dimension consumes more parameters.
Useful7/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a Gaussian regression likelihood with a chart-pulled exponential-family head. The network predicts a natural parameter eta, while each target y is mapped to a bounded probability coordinate u=G(y). Because the sufficient statistic T(u) is bounded, extreme targets cannot create arbitrarily large parameter gradients. The chart determines the tail class, while eta controls the distribution in probability space.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a dense Gaussian random-feature layer by a sparse Poisson-chaos layer with the same learned kernel, and penalize the layer's normalized fourth add-one energy. The penalty suppresses rare single-atom jumps, so the sparse layer approaches the Gaussian same-kernel representation in Wasserstein distance while preserving computational advantages from sparse Poisson sampling.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct training and evaluation examples whose every (d-1)-variable marginal is exactly independent, but whose full d-variable distribution contains a parity interaction. This isolates genuine high-order reasoning from shortcuts based on pairwise or lower-order statistics and can expose whether attention or MLP architectures learn the intended interaction.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Augment a neural-network update with an auxiliary, damped stochastic branch that acts like the paper's floating dissipative reservoir. A trainable mixing phase \(\phi\) combines the task-gradient branch and auxiliary branch; \(\phi\) is adapted to make the auxiliary response to a chosen control perturbation nearly zero while retaining a finite task-gradient response. The intended benefit is selective insensitivity to nuisance hyperparameters or perturbations, with a measurable response peak…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace isotropic variance control in a bottleneck or router with a spectral polarization penalty that drives each latent direction toward either variance 0 or variance 1. The intended result is an automatically selected active subspace: inactive coordinates can be pruned or quantized aggressively, while active coordinates retain information instead of being uniformly attenuated.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use Survival-IDR as a nonparametric calibration teacher for a neural conditional survival model when a covariate, risk score, or one-dimensional learned index has a known monotone relationship with event-time distributions. The teacher corrects the biased behavior of naive pooled Kaplan-Meier estimates under censoring and supplies distributional targets that are monotone across the ordered axis and coherent across every partition scale. Fine-tune the neural head against these targets while…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Attach a predictor from each deeper representation to the representation immediately below it, and penalize the Gaussian KL divergence between the predicted lower-layer state and the actual lower-layer state. Learn or estimate one positive variance per layer so easy, low-noise layers receive high precision while intrinsically uncertain layers are not forced to fit their targets exactly.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Attach a symbolic sparse head to a neural encoder instead of using a dense final MLP. The head evaluates a library of learnable power-law and interaction terms on nonnegative learned features, jointly optimizes linear coefficients and exponents, and removes inactive terms with coefficient sparsity. This should provide a compact model with better relative-error behavior on positive targets spanning several orders of magnitude.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Generate many random symmetric decision trees and encode each input by the one-hot indicator of its reached leaf. Use the resulting fixed random feature vector as an additional input to an MLP, or train only a ridge/linear prediction head on it. The tree ensemble's Gaussian-process-limit interpretation predicts that increasing the number of independent trees should approximate a stable kernel while avoiding MCMC and difficult optimization over discrete split structures.
Useful6/10
Difficulty4/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
Unverified
2026
Replace the usual inverse-eigenvalue weights in a low-rank feature-covariance preconditioner by inverse weights with an estimated isotropic floor subtracted. Retain only the top r eigendirections and require every corrected denominator to exceed a margin, preventing the shifted inverse from approaching a pole. This should undo systematic under-updating of predictive directions when many weak feature directions inflate the empirical covariance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent input or parameter uncertainty locally by a low-order polynomial expansion of the network output, and compute only task-relevant directional third- and fourth-order moments. Add a penalty that calibrates or controls projected skewness and kurtosis, allowing the model to represent bent or elongated confidence regions without constructing a full dense moment tensor.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a fixed soft-threshold, ReLU-like gate, or manually chosen activation shrinkage with a monotone learned shrinkage function fitted by an observed-data quadratic-risk criterion. The gate can interpolate between identity, ridge-like attenuation, hard thresholding, and lasso-like soft thresholding, allowing each layer or channel group to adapt its bias–variance tradeoff from the current minibatch.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a binary classifier's unconstrained final logit with a differentiable likelihood-ratio head based on two squared Mahalanobis radii in a learned embedding space. Approximate the shared radial generator with a small fractional-power basis, allowing the head to model heavy-tailed class geometry that an affine QDA logit cannot represent while remaining much smaller than a generic nonlinear head.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add an auxiliary loss that makes selected representation coordinates insensitive to all subsets of fewer than d variables while retaining a d-way parity statistic. The objective discourages the network from solving a task through pairwise shortcuts and explicitly rewards a controlled high-order interaction.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use spatially correlated training points whose low-frequency structure factor vanishes instead of iid points. For neural fields, PINNs, image-coordinate MLPs, or spatially indexed minibatches, this should suppress long-wavelength quadrature and gradient-estimation noise while preserving the represented target dynamics. The finite-order prediction is that a design with structure factor S(k)=O(|k|^{2q}) produces lower variance for smooth losses than iid sampling, especially as the domain or batch…
Useful5/10
Difficulty5/10
Novelty6/10