✓✓ Beats tuned baseline
2026
Use the paper's below-threshold bistability mechanism to distinguish local stability from actual recovery: a recurrent network may have a locally stable nominal state while a second stable state still captures trajectories. Add a perturbation-based basin test and retain stronger damping or reset actions until the network demonstrably returns to the desired branch, rather than disabling intervention immediately when the spectral threshold is restored.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Wrap the nominal forward or optimization dynamics of a neural network in a propagated uncertainty tube representing bounded disturbances in activations, gradients, or parameters. Penalize or reject updates whenever the tube radius exceeds an allowed task-dependent margin, thereby converting the paper's robust path-following construction into a contraction-aware training rule.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace independent feature, expert, or edge dropout by sampling subsets from a forest-induced strongly Rayleigh distribution. The distribution is multiaffine and negatively dependent, so selecting one computational route suppresses redundant correlated routes without the positive correlations created by independent or blockwise heuristics. Use the sampled subset as a structured mask during training and compare it against Bernoulli dropout at equal expected sparsity.
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace the final layer of a neural predictor with Bayesian linear regression over deterministic trigonometric features, retaining a computable posterior variance and a high-probability confidence envelope over the full bounded input domain. Use this envelope to reject unsafe actions, downweight uncertain training targets, or restrict optimizer updates in regions where the network is extrapolating.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Wrap a recurrent, state-space, or implicit neural layer in an explicit structured uncertainty model for parameter drift, channel-wise gain error, quantization, or measurement noise. Train the layer to maintain a structured-singular-value margin, which can be substantially less conservative than an unstructured spectral-norm bound while correctly accounting for cross-channel coupling introduced by coordinate changes or feature mixing.
Useful7/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a single global learning rate with mode-dependent rates determined by the static correlation structure of recent parameter updates or hidden-state updates. Correlated modes are treated as collective diffusive modes: their effective relaxation rate is reduced in proportion to their structure-factor amplitude, so the optimizer accelerates weakly correlated modes while damping collective slow modes. The method also supplies a diagnostic for when the Markovian approximation is invalid and…
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Estimate the leading complex resonances of the noise-averaged hidden-state dynamics of a stochastic RNN and use them to detect or control statistically persistent oscillations. The key design principle is to treat resonance radius and Lyapunov growth as independent signals: hidden trajectories can be Lyapunov-stable while the annealed dynamics still produce narrow-band ringing because a transfer-operator eigenvalue lies close to the unit circle.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace raw molecular orientation vectors with local scalar features invariant under common three-dimensional rotations and the apolar transformation u_i -> -u_i. Feed these channels to a CNN autoencoder, VAE, or contrastive encoder so that configurations on the same physical symmetry orbit have identical inputs or latent codes. This should improve unsupervised phase discovery without supplying order-parameter labels.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Build a positively homogeneous convex network by representing every intermediate unit as a compact polytope and composing units with Minkowski sums, convex-hull unions, and positive dilations. This gives an explicitly convex and monotone architecture whose geometric complexity can be controlled independently of the number of sampled linear pieces, potentially producing smaller ICNNs for structured convex functions.
Useful7/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Treat recurrent or state-space network blocks as measured dynamical components and analyze their closed-loop interaction through frequency-domain gain, without requiring exact internal state-space equations. Estimate each block's local transfer matrix from perturbation-response experiments, assemble the block interconnection, and regularize training whenever the interaction approaches a small-gain or singularity boundary.
Useful7/10
Difficulty6/10
Novelty7/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