✗ Mechanism failed
2026
Represent a solution on an unfitted domain with local neural subnetworks and train them using one augmented energy containing the bulk physical energy, symmetric Nitsche boundary or interface terms, and a derivative-jump ghost penalty. Automatic differentiation of this scalar objective supplies all gradients and avoids independently tuning inconsistent PDE residual, flux, and boundary losses. The method is especially suited to moving geometries, cut-cell domains, and domain-decomposed neural…
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace an unconstrained softmax gate over a finite set of neural experts with exponential weights whose temperature is chosen to satisfy the paper's explicit stability condition. The goal is to prevent low-temperature expert collapse while retaining the model-selection rate when the expert losses are bounded and strongly convex in the prediction.
Useful6/10
Difficulty4/10
Novelty3/10
✗ Mechanism failed
2026
Replace the ordinary gradient of a spatially indexed parameter tensor by a Fourier-domain inverse-metric gradient. FFT the gradient over its spatial dimensions, divide every frequency by a positive spectral symbol, inverse FFT, and then apply the optimizer step. Use a Bessel/Sobolev symbol as a parameter-free baseline and optionally estimate a task-specific symbol from gradient power spectra.
Useful6/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train an unconstrained branch and a geometry-aware branch in parallel, then learn how much to trust the analytic branch. This preserves the benefit of explicit geometry on correctly specified tasks while allowing the model to ignore a misleading or irrelevant prior.
Useful6/10
Difficulty3/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a generic neural constitutive law or energy model with an ICNN that consumes the positive singular values of a deformation-like matrix and is convex and coordinatewise nondecreasing in those inputs. Train it as a lower approximation to a nonconvex target energy, so the network acts as a computationally cheap sufficient polyconvex-envelope surrogate rather than merely interpolating unstable samples.
Useful6/10
Difficulty4/10
Novelty4/10
✗ Mechanism failed
2026
Track the implicit l2 regularization induced by adversarial SGD and explicitly correct it when the optimizer drifts toward an undesirable ridge strength. Apply the correction first to the final linear head or a low-dimensional adapter, where feature covariance and ridge estimates are tractable.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's edge-to-area incidence structure to choose a small set of geometrically independent simplices instead of processing every possible hyperedge. A greedy rank-increasing router retains a triangle only when its Jacobian adds a new direction, reducing higher-order message-passing cost while preserving diverse geometric information.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Insert a scalar flux-correction-style limiter after a neural operator predicts a conservative state or residual. Interpolate between a known-admissible baseline state and the learned high-order candidate, choosing the largest coefficient that satisfies a geometric family of linear inequalities encoding positive density, positive pressure, and subluminal velocity. This retains as much of the neural prediction as possible instead of independently clipping physical variables.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace fixed-strength projection or constraint-repair steps during low-rank neural fine-tuning with a regularized affine subproblem whose damping is proportional to the current distance from the model manifold. Use strong damping when a gradient update leaves the low-rank manifold substantially, then automatically remove the damping near a clean intersection so that the method can recover higher-order local convergence. This is suitable for LoRA-style updates, structured matrix compression…
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Add a two-sided cone-restricted spectral penalty to a recurrent or state-space model. Instead of estimating growth using a symmetric singular-value surrogate, jointly optimize a positive right vector and positive left vector in the extended quotient from the paper, targeting a real generalized eigenvalue of the learned non-selfadjoint transition operator.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a parameter objective locally as a difference of convex terms, compute approximate proximal points for both terms, and update parameters using the difference of their high-order Moreau-envelope gradients rather than the raw DC gradient. Start with the quadratic case p=2, then test p=4 as a sharper penalty for large proximal residuals; solve each proximal subproblem with a small fixed number of inner steps and decrease the smoothing scale during training.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a time-dependent neural velocity field with a neural initial phase whose evolution is determined by the Madelung equations. Particles are sampled once from a reference density and then moved deterministically along the characteristic velocity field, while the quantum potential supplies a density-dependent smoothing and curvature correction.
Useful6/10
Difficulty7/10
Novelty6/10
✗ Mechanism failed
2026
Replace Euclidean covariance matching with a discrepancy that identifies covariance matrices differing only by per-channel positive rescaling. Apply it to minibatch feature covariances in a representation-alignment, domain-adaptation, style-transfer, or multi-view objective so that the network is penalized for changing correlation structure but not arbitrary channel units.
Useful6/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add a regularizer that penalizes expensive component births and merges in an embedding when points are partitioned into multiple colors, such as classes, modalities, or augmentation identities. Unlike ordinary contrastive learning, it encourages local regions to contain all required colors and uses the full merge hierarchy rather than only selected positive and negative pairs.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace the usual softmax router or soft one-hot penalty with a vector-valued phase-field regularizer whose low-energy states are exactly the expert one-hot vectors. Component-wise barriers create stable categorical phases, while a weaker coupling term suppresses invalid states such as the all-zero vector or multi-expert activation; annealing \(\varepsilon\) produces increasingly discrete routing.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Estimate local curvature, third derivative, and gradient-noise variance, then compensate for the stationary displacement predicted by the paper rather than assuming client averaging removes all bias. The first implementation should operate coordinatewise on a one-dimensional or diagonal quadratic-plus-cubic federated objective, where the paper's coefficient has a direct interpretation.
Useful6/10
Difficulty5/10
Novelty7/10
✓ Mechanism works
2026
Given arbitrary pairwise preference logits, project their skew-symmetric part onto the additive-consistent subspace before converting logits into probabilities or rankings. This removes cyclic inconsistency using the Frobenius-nearest consistent matrix, guaranteeing transitive pairwise predictions while preserving the closest possible signal under squared error.
Useful6/10
Difficulty3/10
Novelty6/10
Audited (legacy)
2026
Use the attention probability distribution over an ordered context to choose contiguous token groups whose pooled attention masses have entropy as close as possible to a prescribed upper budget R. Replace the corresponding key/value vectors by one weighted representative per group, preserving token order and reducing the KV-cache length from n to m. Unlike unconstrained token merging, the entropy constraint gives a direct control knob over how concentrated or diffuse the retained attention…
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use a constant-sum point vector to encode ordered pairwise outcomes and train a neural scorer with an adjacent-categories ordinal likelihood whose slope parameters are tied to those points. The accumulated point score is then a theoretically motivated compressed statistic for repeated comparisons, rather than an arbitrary regression target or one-hot label.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace Gaussian perturbations in a low-dimensional neural-network optimizer with independent double-geometric integer mutations and adapt each mutation scale using its exponential-family natural gradient. Apply the method to layerwise quantization scales, adapter coefficients, pruning thresholds, or other integer/discrete hyperparameters rather than to every individual weight.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add a geometry-guided infill operator to a population optimizer used for black-box neural-network tuning. Fit a local Jacobian from recent parameter perturbations and validation-residual vectors, generate a damped Gauss-Newton candidate for exploitation, and sample exploratory candidates in the same Jacobian-derived metric. The host optimizer retains selection, population survival, covariance adaptation, and its total evaluation budget; only a configurable fraction of new candidates is replaced…
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observed label-availability indicator as an auxiliary supervision signal when labels are preferentially missing for uncertain or difficult examples. Train the classifier with a joint likelihood containing both the class-label likelihood for labeled examples and a missingness likelihood whose probability depends on the classifier's posterior uncertainty.
Useful6/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Replace AdamW or SGD updates on simplex-valued routing probabilities with a logarithmic-barrier mirror step. The update remains strictly positive, avoids projection-induced zero coordinates, and can approach a boundary solution asymptotically while retaining the paper's theoretically motivated O(log k/k) convex convergence behavior.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Represent an intermediate feature as a low-rank PSD matrix and compress it using nonnegative measurements \(\langle A_i,X\rangle\), while penalizing the empirical ratio between maximum and minimum measurement distortion over low-rank feature pairs. This directly discourages collapsed directions and excessively amplified directions in a covariance or Gram-feature bottleneck.
Useful6/10
Difficulty5/10
Novelty6/10