✗ Mechanism failed
2026
Replace or augment a deterministic recurrent hidden state with a stochastic Markov transition, then explicitly measure its entropy production and output memory time. Penalize operating points where the target changes faster than the hidden state can track at the available dissipation, while allowing the model to satisfy the bound either by increasing transition activity or by developing a longer-lived memory mode.
Useful8/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observability margin to choose which delay taps to retain under a fixed memory or computation budget. Add a candidate delay only when it substantially increases the smallest singular value of the delay map, converting the paper's large-delay asymptotic result into an adaptive receptive-field construction for sequence models.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace magnitude pruning in a trained recurrent network with stochastic pruning probabilities computed from weight magnitudes and the covariance of neuron activities under injected noise. Connections whose endpoints fluctuate in a sign-compatible way receive higher retention probability, while retained weights are rescaled to preserve average recurrent strength. The method uses local weights and activity covariance, avoiding Hessian construction and expensive global saliency optimization.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace fixed PCA-rank selection in a hidden layer with a renormalization-group-inspired gate over covariance eigenvalue bands. The gate retains modes whose effective quartic interaction remains unstable or strongly scale-dependent, while pruning bands that flow toward the Gaussian noise fixed point. Unlike top-eigenvalue truncation, this is designed for extensive-rank signal distributed throughout the bulk spectrum.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace an opaque MLP vector field with a stack of trainable symbolic primitives that can express linear terms, monomials, products, and related analytic operations. Apply an L1 penalty and prune small primitive coefficients after rollout training, yielding a compact dynamics module that is cheaper to evaluate and easier to inspect.
Useful7/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace ordinary dropout or soft sparsity penalties on a nonnegative spatial or token activation field with sublinear multiplicative stochastic dynamics. The field receives local diffusion or graph smoothing, while noise amplitude u^gamma vanishes at zero but is relatively strong near zero; this creates an absorbing zero state and may produce exact contiguous inactive regions. The module is suitable for feature maps, graph-node fields, token routing scores, or continuous neural operators.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Impose a screened pair-correlation dynamics on stochastic neural replicas so that correlation fluctuations relax locally instead of propagating across the entire representation. The key control knob is a learned or scheduled relaxation rate \(\mu_{FB}\), which predicts a measurable correlation length \(\xi_{FB}=\sqrt{D_{eff}/\mu_{FB}}\). This can be used as a locality regularizer for token representations, diffusion trajectories, or recurrent hidden states.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace ordinary stride-2 pooling by a stochastic block-to-center map that is equivariant under global sign reversal and monotone in every input spin. For a binary feature channel, the layer computes the probability of a positive coarse feature from the number of positive fine features, samples or relaxes the resulting Bernoulli variable, and learns only a constrained scalar rather than an unconstrained pooling kernel. The same construction can be applied independently to channels or to graph…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained message-passing or recurrent propagation matrix by a directed-edge operator with non-backtracking connectivity and orientation-dependent turning phases, inspired by the Kac–Ward construction. During training, monitor and control the zero-momentum spectral gap of \(\mathcal A(0)=I-K(0)\), keeping the model near but on the stable side of the critical surface to obtain long memory without uncontrolled amplification.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a sparse recurrent network with positive edge weights and Leaky-ReLU updates so that one selected hidden node, observed over a finite time window, contains enough information to reconstruct the full hidden state. Add an auxiliary decoder from the observed trajectory to the initial state or current state, and use graph rewiring or edge-growth until every hidden node has a directed path to the sensor within the observation horizon.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Attach a small dynamical observer to a neural ODE, RNN, or state-space model and make it estimate only a task-relevant functional of the hidden state, such as logits, value features, or control-relevant projections. Use an incremental quadratic constraint and a bounded-real penalty to make the observer robust to hidden-state nonlinearities and input disturbances, instead of reconstructing the full latent state.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace forward activation dropout in a deep residual network with an unbiased multiplicative mask applied only to gradients entering each residual unit or branch. The forward representation remains deterministic for a given minibatch, while the update receives zero-mean stochastic perturbations that are predicted to reproduce dropout-like limiting dynamics in large-width, large-depth ResNets.
Useful6/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Use sign choices over redundant gradient or adapter proposals to keep the accumulated residual update small in the coordinatewise maximum norm. Constrain the sign controller to preserve a positive projection onto the desired descent direction, so it suppresses coordinate spikes without completely canceling optimization progress.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace or augment the transition map of a recurrent state-space model with bounded analytic maps of a latent complex coordinate, using several finite Blaschke generators that share a fixed point. Enforcing a superattracting fixed point of local degree p creates a tunable hierarchy of memory erasure: the theory predicts double-exponential decorrelation with exponent log p, while a merely attracting fixed point gives ordinary exponential decay.
Useful5/10
Difficulty7/10
Novelty9/10
Unverified
2026
Use the signed-base expansion as a compact discrete-continuous latent parameterization for a VAE or autoencoder. A short binary sequence produces exponentially refined coordinates, while a learned Markov prior captures correlations between successive latent bits. The decoder receives the resulting bounded real coordinates instead of an unconstrained Gaussian latent vector.
Useful5/10
Difficulty5/10
Novelty6/10