✗ Failed on benchmark
2026
Construct a neural acceptance or abstention set from calibration samples together with an explicit boundary map selecting the samples that determine the set. If the map is proper projective and its cross-sample complexity profile is stable, the conditional violation risk has an exact beta law indexed by boundary size rather than network parameter count. This provides a falsifiable, distribution-free certificate for neural selective classifiers and learned safety filters.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace selected residual, recurrent, or state-space blocks by modules whose input-output Jacobians satisfy an IODP inequality throughout a prescribed activation domain. The constraint controls incremental amplification between two trajectories without requiring either trajectory to remain near one fixed equilibrium, so it should improve robustness to changing contexts and prevent exploding long-horizon sensitivities.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Distill the expensive inner minimization over state-estimation errors into a neural correction term that predicts the robust barrier drift, then fine-tune the correction using differentiable closed-loop rollouts. This retains the robustness mechanism while reducing the repeated optimization cost and allowing less conservative behavior than fixed analytic uncertainty bounds.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace the global EMA update for each linear-layer momentum matrix with a delta-rule update that learns the current output-side gradient value only along the current input-key direction. Frequently occurring directions are corrected repeatedly, while rarely visited directions are not unnecessarily overwritten or uniformly decayed. Use the resulting matrix as the ordinary momentum buffer in SGD, AdamW, or another optimizer.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained scalar MLP certificate with an anchored positive-definite network whose value and gradient are fixed at the equilibrium. Train it so that its Lie derivative along a neural or physical vector field is strictly negative on a prescribed region of attraction. The construction makes stability robust to approximation error: a certificate remains valid whenever the value, gradient, and Lie-derivative errors stay below the target's strict-decrease margin.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a single recurrent state update with fast feature relaxation, activity evolution, and a slow adaptive state that modulates the activity vector field. Tune the activity subsystem near a controllable saddle-node so that it retains a useful transient regime for a predictable number of steps, enabling delayed switching and long-horizon memory without requiring a large hidden state.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace full-precision communication in decentralized or federated optimization with a sparsified uniform quantizer whose scale decreases geometrically, while maintaining an error state at each worker. Choose the scale so that quantization disturbance decays at least as fast as the contraction of the gradient-tracking dynamics; this should preserve linear convergence instead of creating the usual fixed-quantization error floor.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace periodic all-reduce in federated or distributed training with local broadcasts triggered by a prescribed parameter-disagreement envelope. Each worker maintains held copies of the latest parameters received from neighbors and applies a consensus correction to its local optimizer update. After an asynchronous reception causes a discontinuous change in sampled disagreement, a receiver-side exponentially decaying correction temporarily enlarges the allowable envelope, preventing false…
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace the pointwise strong-form PINN loss with a vector of localized weak residuals generated by fixed compactly supported polynomial test functions. Use a neural network or KAN as the trial function, integrate by parts once, and evaluate each test residual with Gauss–Legendre quadrature; this lowers the required derivative order and prevents a few high-curvature collocation points from dominating training.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace pointwise high-order PINN residuals with a stochastic one-step residual evaluated on Brownian transitions. A single scalar network produces the value, gradient, and Hessian by automatic differentiation, and the quadratic centered increment supplies a stochastic probe of the Hessian. Add a terminal gradient penalty so the learned full jet is constrained at the terminal boundary, not only the scalar value.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
For a neural ODE, residual flow, or deep equilibrium model with a dominant polynomial component, compute the directional dynamics induced by its highest-degree homogeneous term on the unit sphere. Penalize or reject parameter regions containing radially growing attracting directions, preventing finite-time activation blow-up while preserving nonlinear dynamics in safe directions.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Attach a cheap risk score to each neural-network prediction and skip an expensive verifier, ensemble, diffusion refinement, retrieval call, or human review when the score is below a calibrated threshold. Independently audit a random subset of skipped examples using the expensive ground-truth procedure, and select the largest skip threshold whose exact confidence bound keeps the violation rate below a target budget.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Model a residual network, recurrent update, or optimizer as a switched linearized system in which each layer type, token, data batch, or optimizer regime selects a matrix mode. Constrain the worst-case product growth over admissible switches, rather than merely constraining every individual Jacobian, so arbitrary mode sequences remain contractive.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Partition a neural network into independently trained or independently monitored modules and constrain their cross-module interaction gain using a compositional contraction certificate. This enables stable deep modular MLPs, graph blocks, or recurrent modules without estimating the full network Jacobian, while providing an explicit coupling threshold for when the architecture loses contraction.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace unconstrained residual updates with blocks whose Jacobian is monitored through a Davis–Wielandt shell. The shell simultaneously measures directional dissipation and non-normal amplification, yielding a per-block step-size or residual-scale bound that is stronger than checking only the largest eigenvalue or spectral norm.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Compress each hidden layer by retaining directions that are simultaneously reachable from the observed input distribution and observable at the network output. Unlike PCA or SVD, the retained subspace is weighted by downstream task sensitivity, so high-variance but output-irrelevant directions can be removed while low-variance predictive directions are preserved.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Compress a trained wide analytic-activation MLP by fitting a narrow same-depth student to the teacher's function values and input derivatives, rather than matching only outputs on a calibration dataset. Choose the student width from the input dimension and target error, with a target scaling m = O((log(1/epsilon))^d_in), and use sequential layer fitting plus channel reweighting to limit error accumulation through depth.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Initialize each row of a neural weight matrix as a stationary correlated Gaussian process instead of using independent entries, but constrain its correlation tail to remain on the finite-fourth-moment side of the transition. This creates controllable structured spectra while avoiding the heavy-edge regime predicted for correlations slower than \(t^{-1/2}\).
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
For a neural network with a trainable linear head or low-rank adapter, store feature vectors from recent minibatches and select a finite set that is sufficiently independent. Apply Modified Gram-Schmidt to obtain orthonormalized memory directions, then add residual corrections along these directions so the local parameter-error dynamics have an identity coefficient matrix rather than a poorly conditioned empirical Gramian. The method predicts a sharp transition after the buffer first contains…
Useful7/10
Difficulty5/10
Novelty7/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
✗ 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
✗ Failed on benchmark
2026
Replace the Euclidean Polyak step in an optimizer with a mirror-descent step whose length is chosen by projecting onto the current affine lower-bound halfspace in Bregman geometry. This permits entropy geometry for simplex-valued router probabilities, log geometry for positive parameters, and other mirror maps without reducing the method to a norm-based learning-rate rule.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Insert a linear Johnson–Lindenstrauss bottleneck around a set of jointly processed representations, choosing its width from the sharp finite-set dimension bound rather than from the model's nominal hidden size. The projection should preserve pairwise distances between tokens, patches, or retrieved items, allowing a downstream attention or MLP block to operate at lower width while retaining the geometry relevant to similarity computations.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a wide collection of interchangeable near-zero branches with a module whose output is explicitly a quadratic form in the branch-weight Gram matrix. The module preserves the paper's leading-order behavior while making the relevant collective variable explicit and allowing low-rank parameterizations.
Useful7/10
Difficulty5/10
Novelty7/10