✓✓ Beats tuned baseline
2026
Augment a neural dynamics model with a sparse local Taylor residual whose coefficients are updated online by recursive least squares. Use the neural model for global behavior and the Taylor model for short-horizon prediction, where local adaptation can correct payload, friction, actuator, or environment changes without retraining the network.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace direct action imitation with a causal recurrent estimator of the inverse input gain. The neural network predicts the latent quantity needed by the expert controller, and a fixed algebraic wrapper converts that prediction into an action using the measured state difference and tracking error, thereby removing the additive disturbance exactly under the sampled timing model.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add a differentiable uncertainty state to a learned world model and optimize action sequences using both predicted task reward and the covariance of the latent or target-state estimator. The policy should move or attend toward states that make observations informative, rather than selecting actions only from mean-state predictions.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Augment a learned neural state-space model with an online regularized least-squares confidence set for its local linearization or last-layer dynamics, then propagate a homothetic uncertainty tube around every predicted trajectory. Use the tube to tighten RL action constraints, reject unsafe imagined rollouts, or weight training examples by certified prediction reliability. The mechanism should improve long-horizon behavior specifically when model uncertainty is large, rather than acting as an…
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a low-width network by repeatedly selecting a normalized neuron that is maximally correlated with the current residual, then refit all output coefficients jointly. This gives a constructive alternative to random initialization of all hidden units and exposes an empirical width-versus-error curve that can guide early stopping or architecture selection.
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace raw spatial coordinates supplied to a neural field or PINN by a learnable monotone radial coordinate generated from a positive neural density. The density is trained through the PDE energy or residual after solving for the network weights, allowing the warp to discover where resolution is needed without singularity labels or an analytic interior solution. Near a singular point, a factor s^(q-1) gives a controlled regularity gain, while a positive learned correction redistributes…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace full-history backpropagation through time for an online recurrent or state-space neural network with a fixed-length batch protocol. An encoder maps the most recent input-output window to the latent state at the beginning of each batch, after which the learned dynamics are rolled forward and updated recursively from the new batch only. This should prevent state drift across long streams while retaining adaptation to changing dynamics.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Treat unresolved inference items as active threats and allocate a fixed budget of C module evaluations per round. Each evaluation has an item-dependent probability of completing the item, while the scheduler observes only completion or failure after the round. Use fair allocation when completion probabilities are unknown or nearly homogeneous, then switch to a marginal-success greedy policy as feedback estimates become reliable.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use a bounded stochasticity control during an initial preparation window to shape the gradient or parameter-update distribution before ordinary training. The control is restricted to its minimum or maximum value, with at most one switch, because the reduced moment dynamics are affine in the control; this gives a falsifiable alternative to smooth noise or learning-rate annealing.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace ordinary randomized coordinate descent inside a least-squares neural subproblem with RPLSS's projected direction update. Each sampled parameter coordinate generates a Jacobian column, while the stored matrix P removes components already covered by previous updates; this should reduce redundant coordinate steps and improve convergence for linear heads, LoRA modules, and locally linearized fine-tuning.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use the differentiable covariance chart to construct a Fisher-information preconditioner for the edge and innovation parameters of a linear-Gaussian neural module. Instead of applying an isotropic Euclidean update, whiten parameter steps according to how strongly they change the predicted Gaussian distribution. This targets ill-conditioning caused by redundant paths, correlated latent nodes, and badly scaled innovation covariances.
Useful7/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Add an online low-rank reconstruction layer before a recommender or ranking MLP. It estimates a latent action-feature subspace from masked candidate vectors, freezes that subspace for an epoch, reconstructs each partially observed candidate in the latent coordinates, and feeds only those coordinates to the predictor. The method is most promising when the ambient candidate dimension d is large but the effective rank m is small and missingness is not too severe.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add a preprocessing or differentiable synchronization layer that estimates one unit-modulus complex phase per graph node or data view from noisy pairwise relative-phase observations. Initialize the phases with a leading-eigenvector method, fix the global phase gauge, and allow nonlinear refinement only when the estimated perturbation is small relative to the observable Jacobian margin. This replaces random initialization for rotation-alignment modules and should reduce bad local minima caused…
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Choose gradient clipping thresholds from an explicit worst-case tail probability implied by an observed kurtosis bound, rather than using a fixed norm threshold or an empirical percentile. For a standardized centered gradient coordinate, the threshold achieving target outlier probability \(\delta\) is obtained by analytically inverting the paper's sharp tail formula.
Useful6/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Add a geometry-guided infill operator to a population optimizer used for black-box neural-network tuning. Fit a local Jacobian from recent parameter perturbations and validation-residual vectors, generate a damped Gauss-Newton candidate for exploitation, and sample exploratory candidates in the same Jacobian-derived metric. The host optimizer retains selection, population survival, covariance adaptation, and its total evaluation budget; only a configurable fraction of new candidates is replaced…
Useful6/10
Difficulty5/10
Novelty7/10