Architecture ideas

Attention variants, state-space and recurrent cells, normalization and token-mixing schemes — each tested against the standard block it replaces.

△ Mechanism confirmed, baseline not beaten 2026

Positive Curvature Mirror-Descent DEQ

Replace the black-box equilibrium denoiser in an image-restoration DEQ with a positivity-preserving mirror-descent equilibrium driven by the exact Gamma likelihood and a discretized surface-area/mean-curvature regularizer. The equilibrium layer has a small number of learned scalar or channel-wise parameters instead of a large implicit CNN, while the exponentiated update prevents negative intensities and naturally matches multiplicative noise.

Useful8/10
Difficulty6/10
Novelty6/10
Paper: A geometry-based deep equilibrium model for image restoration under multiplicative Gamma noise arXiv:2608.04944
△ Mechanism confirmed, baseline not beaten 2026

Certified contraction implicit layer

Replace a deep feed-forward block by the fixed point z=phi(Wz+Vx+b), with the recurrent weight W constrained so that the fixed point is unique for every input. The same condition makes forward fixed-point iteration stable and makes implicit differentiation well-conditioned, allowing depth-independent memory usage while providing a measurable spectral failure boundary.

Useful8/10
Difficulty5/10
Novelty4/10
Paper: Implicit Neural Networks as Static Controllers: Certificates and Performance Separation arXiv:2607.11122
△ Mechanism confirmed, baseline not beaten 2026

Quadrature-Whitened Neural Feature Subspace

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
Paper: Evo-GTransNet for Parabolic PDEs: A Fixed-Feature Galerkin Method of Lines with Quadrature-Mass Orthonormalization arXiv:2608.19615
✗ Failed on benchmark 2026

Confidence-Tested LoRA Pruning

Replace deterministic LoRA importance scores with one-sided tests of whether each rank-one update has population contribution at least a user-selected threshold. Maintain empirical contribution samples during fine-tuning, estimate their uncertainty, and prune the components with the weakest statistical evidence while respecting the target rank budget. The method should avoid deleting components merely because their latest minibatch gradient was small.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Statistical Inference for Rank Allocation in Low-Rank Adaptation arXiv:2607.20205
Unverified 2026

Spectral Sign-Balanced Update Blocks

Represent a block of candidate neural updates or adapter components by symmetric influence matrices and select one sign for each component so their aggregate spectral effect is small. This imports matrix discrepancy into low-rank adapters, expert aggregation, or structured quantization, where controlling the worst direction of interference may be more useful than minimizing entrywise error.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: A Proof of the Matrix Spencer Conjecture arXiv:2608.28816
Unverified 2026

Hessian-guided orthogonal sparsification

Train a square orthogonal neural mixer while maximizing its entrywise fourth-power concentration. When optimization reaches a non-permutation stationary configuration, explicitly test rank-two row or column rotations and take a rotation with positive exact second variation, using the paper's constructive saddle-escape mechanism.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Local Maxima of the Entrywise $\ell_4$ Norm on the Orthogonal Group arXiv:2607.12431
Unverified 2026

Monotone Resolvent Elimination Layer

Build an implicit layer from a piecewise-linear maximal monotone operator on visible variables z_* and auxiliary variables z_**, then eliminate the auxiliary block rather than exposing it in the network output. Compute the layer through a fixed point of the eliminated component of a nonexpansive resolvent, with damping when the auxiliary map is not strictly contractive.

Useful5/10
Difficulty6/10
Novelty6/10
Paper: Maximal monotonicity of piecewise polyhedral mappings arXiv:2607.07358