△ Mechanism confirmed, baseline not beaten
2026
Attach a graph-Laplacian penalty to predictions on all labeled and unlabeled examples, with graph edges determined by augmentation-induced representation similarity. The supervised head is encouraged to vary smoothly along reliable augmentation edges, enabling labels to propagate through the unlabeled pool while preserving the paper's explicit augmentation-boundary diagnostic.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained overcomplete linear measurement or embedding matrix by one trained to remain well-conditioned after deletion of a prescribed number of rows. The objective explicitly targets the smallest singular value over sampled row subsets, preventing a layer from relying on fragile combinations of features that disappear under channel, sensor, token, or measurement erasures.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the fixed numerical stabilizer in signSGD by an exponentially decaying stability path, so the optimizer remains sign-like for a controllable duration instead of eventually reverting toward ordinary gradient descent as gradients become small. Sweep the decay rate as an explicit implicit-bias parameter: slower annealing should retain the non-Euclidean, barrier-like bias, while faster annealing should approach the sign endpoint more closely.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Use the paper's parameterized invariant-torus residual and pseudo-arclength Newton correction to train a neural ODE across a continuous family of latent dynamical regimes. The continuation constraint allows the solver to pass through saddle-node folds, where stepping a physical control parameter alone would fail or jump to a different branch.
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained one-step transition network with a symmetric damping–symplectic-core–damping composition. The damping strength is one learned scalar rate and is applied through positive exponential diagonal factors, so every step has a known contraction law while the neural core models nonlinear conservative transport.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Build a recurrent or state-space layer whose transition matrix depends on a scalar pooled from the current hidden state. Estimate the local derivative of the scalar closure and penalize feedback gains that approach the fold threshold, preventing abrupt branch changes and excessive sensitivity.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a pointwise Gauss-equation penalty involving the determinant of a neural surface Hessian with a weak Cartan residual built from an orthonormal coframe and its connection 1-form. The residual is evaluated after integration against compactly supported test functions, making curvature supervision less sensitive to noisy second derivatives and compatible with rough neural surfaces.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add conformal prediction sets for every action of a contextual policy, then select the action maximizing its worst-case utility over the corresponding set. Calibrate the sets using the outcome generated by this same max-min policy, rather than calibrating each action independently; this directly targets reliable utility under deployment decisions.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a positive learning-rate schedule offline by minimizing the worst residual of every prefix on a normalized curvature interval, rather than optimizing only the final training horizon. The schedule is evaluated through the exact quadratic residual polynomial p_n(lambda) = product_{k=1}^n (1 - eta_k lambda), so every prefix is constrained to make progress across multiple curvatures.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace unconstrained final classifier prototypes with an equiangular tight frame (ETF), or initialize them as an ETF and softly preserve the structure during training. The frame gives every class the same norm, an isotropic aggregate geometry, and equal pairwise interference, which should improve conditioning and reduce class-prototype collapse in normalized-softmax or contrastive models. For arbitrary class counts where an exact ETF is unavailable, optimize differentiable tight-frame and…
Useful7/10
Difficulty4/10
Novelty5/10
✓ Mechanism works
2026
Search for a compact symbolic optimizer instead of selecting among fixed AdamW-like formulas. Encode optimizer programs as token sequences, learn a continuous variational representation of those sequences, and use a Gaussian-process Bayesian optimizer to propose promising update rules based on short neural-network training rollouts.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Attach an analytic geometry gate to a KAN or MLP so that known feasible regions, exclusions, and unions are represented by differentiable implicit functions instead of being learned only from samples. Use R-conjunctions for intersections and R-disjunctions for unions, then convert the signed support score into a soft gate that modulates the prediction.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Add a fractional Laplacian penalty to neural functions over binary inputs so that high-order coordinate interactions are damped according to \(|S|^\alpha\), rather than treating all Fourier degrees equally. The penalty is estimated with random continuous-time bit-flip perturbations, requiring only extra forward passes and no explicit Fourier transform. It is especially suited to models that overfit through high-order Boolean interactions while retaining useful low-order structure.
Useful7/10
Difficulty4/10
Novelty8/10
✓ Mechanism works
2026
Replace orthogonal Procrustes alignment between two latent dynamical systems with a learned bijection h that makes their transitions commute: h(f(z)) approximately equals g(h(z)). Parameterize h as an invertible affine map or coupling flow, allowing the correspondence to be non-orthogonal while retaining an exact inverse. The same constraint can be applied over multiple rollout steps, encouraging two models to represent the same computation even when their latent coordinates differ…
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a neural controller as a uniformly accurate surrogate of a trusted but expensive controller, and use a measured small-gain condition to decide whether the surrogate is safe for closed-loop deployment. The approximation tolerance becomes an interpretable residual-state budget instead of an opaque validation metric.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a two-dimensional neural deformation map with the paper's Lp conformal-distortion energy instead of using only a determinant or smoothness penalty. The resulting barrier penalizes near-folds and directional collapse while permitting useful nonrigid deformation, making it suitable for spatial transformers, image registration, and learned coordinate warps.
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace isotropic input-Jacobian regularization with a positive semidefinite, input-dependent metric learned jointly with the network. The metric uses diagonal scaling to suppress sensitivity in nuisance directions and a structured orthogonal rotation to discover combinations of input coordinates in which smoothness is task-useful.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace soft boundary penalties in neural operators with a hard projection onto a finite-dimensional span of homogeneous Dirichlet Laplacian eigenfunctions. Every projected hidden field is identically zero on the boundary, while increasing the number of retained eigenfunctions recovers the expressive capacity needed for operator approximation.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a conditional generator or set-valued predictor so that stochastic target refinements preserve the barycentric representation required by the source while allowing valid target-side diversity. The regularizer discourages collapse of multiple legitimate outcomes to one point without treating mean-preserving spread as semantic misalignment.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Build a sequence or graph module whose state is a canonical set of affine tropical pieces rather than an opaque hidden vector. Compose consecutive segments by Minkowski addition of their lifted supports, merge alternatives by union followed by lower-hull reduction, and evaluate the resulting piecewise-linear function with a minimum.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Replace a Euclidean embedding bottleneck with a simplex-valued KL transport layer. The encoder maps each input to a positive probability vector, which is compared against learned positive stochastic prototypes through a c-convex log-sum-exp potential; the resulting barycentric or projected representation should suppress nuisance directions while retaining the topology of the data manifold.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace ordinary momentum with a semi-implicit velocity update containing viscous damping and a proximal dry-friction step, while evaluating the gradient at a look-ahead parameter point. The dry-friction proximal operator exactly zeros sufficiently small velocities, which may suppress late-training oscillations and create finite-time stationarity instead of merely asymptotic velocity decay.
Useful7/10
Difficulty4/10
Novelty7/10
✓ Mechanism works
2026
Replace an unconstrained nonlinearity on hyperbolic pairwise similarities with a function from the paper's exact Lorentz–Gram preserver family. The transformed similarity matrix remains realizable as Lorentz inner products of future-directed unit timelike vectors, allowing a network to sharpen or smooth hyperbolic neighborhoods without introducing geometrically impossible pairwise relations.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Regularize a recurrent or state-space model using finite-time Lyapunov exponents of its actual hidden-state transition products. Penalize collapsed adjacent exponents while also controlling the largest exponent, encouraging several useful state directions instead of one dominant direction or universal contraction.
Useful7/10
Difficulty6/10
Novelty6/10