Unverified
2026
Represent the predicted solution as $u_{\theta}(x)={\rm d}_{\Omega}(x)^s v_{\theta}(x)$, where $v_{\theta}$ is an unconstrained neural network and ${\rm d}_{\Omega}$ is the distance to the boundary. This builds the fractional Dirichlet boundary layer into the architecture and leaves the network to learn the smoother quotient $u/{\rm d}_{\Omega}^{s}$, which the paper proves extends Hölder-continuously to the boundary when the reaction has sufficient integrability.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace stepwise gradient evaluation in a Bouncy Particle sampler over neural-network parameters with deterministic windows. At the start of each window, compute one gradient and use smoothness to upper-bound the event intensity along the ballistic trajectory; candidate events are generated analytically from the integrated envelope and accepted using a gradient evaluation only at candidate locations. This gives an exact sampler under a certified global smoothness bound and a controllable…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Modify the probability-flow ODE of a reflected diffusion so that its learned velocity is tangent to the constraint boundary. Use an exact tangent projection for box or sphere constraints, or a smooth boundary-collar correction for general domains, and train with an additional penalty on the predicted normal flux. This prevents numerical trajectories from leaving the domain and targets the no-flux structure directly instead of clipping samples after each solver step.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace random edge dropout in a GNN with an order-aware filtration that removes edges in decreasing local spectral coherence. High-coherence edges are those whose rank-one Laplacian perturbations align strongly with the current local Laplacian, so their removal creates structured, spectrally meaningful augmentations rather than arbitrary damage. Train the GNN jointly on the original graph and several filtration states using supervised loss plus prediction or embedding consistency.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a standard preconditioned gradient update by a scalar-auxiliary-variable update that evolves both the parameters and a scalar representing the nonlinear part of the loss. The discrete-gradient/SAV construction gives an exact decrease of a modified training energy for each deterministic batch, preventing overshoot and long transient energy growth while requiring only a diagonal or block-diagonal linear solve.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Correct minibatch or trajectory-based categorical entropy estimates using the paper's power-law occupancy asymptotic. The corrected estimate adds back entropy lost through unseen rare categories, with the correction magnitude inferred from the number of distinct observed categories and an estimated tail index.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent each Euclidean input point by its responses to randomly sampled half-spaces, then center those responses by the minibatch or source-distribution half-space occupancy. Use squared distances between these representations as a geometry-preserving substitute for raw Euclidean distances in graph-NN edge construction, cross-domain retrieval, or geometry-aware attention. The layer can compare point clouds from different ambient dimensions because each domain has its own half-space dictionary…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace Euclidean momentum updates on simplex-valued neural variables with entropy mirror descent when the variable dimension is large and the loss is naturally smooth relative to negative entropy. The lower bound predicts that Nesterov-style acceleration cannot guarantee an asymptotic improvement in this geometry, while the geometry-matched update preserves positivity and can reduce boundary instability.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Train a recurrent or state-space neural model with an information regularizer that uses trajectory-dependent predictive information at low observation noise but switches toward instantaneous mutual information as sensor noise increases. The switch is driven by an online estimate of the relative reliability of transfer entropy and instantaneous dependence, rather than by a fixed hyperparameter. This should prevent noisy histories from forcing the latent state to memorize unreliable temporal…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace one spatial convolution block by a recurrent Fourier-domain layer that couples every mode k to its opposite mode -k and gives the strongest amplification to a nonzero selected wave number k*. The layer crosses a controlled Turing-like instability at k* and uses cubic saturation to produce bounded structured features instead of unbounded activation growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent every predicted displacement and velocity as the sum of a prescribed boundary lift and a learned residual that is identically zero on the Dirichlet boundary. Feed the boundary velocity into the model through an explicit distributed-port feature and train an energy-balance residual so that the learned interior dynamics cannot inject arbitrary energy at the constrained boundary. This should eliminate boundary drift and reduce the burden on penalties or projection layers.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a conventional point-cloud decoder or density head with a concave tropical potential represented as a minimum of affine functions. Train the potential so that its Monge–Ampere mass matches the empirical point measure, encouraging a structured geometric representation that can handle variable numbers of points and atomic distributions. Use a differentiable soft-min during training and anneal its temperature toward a piecewise-affine model.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a single hidden state or a finite-order covariance/cumulant closure by an ensemble of independently propagated mean-field particles. The network output is reconstructed from particle averages, allowing bimodal and strongly non-Gaussian hidden-state distributions without explicitly evolving third- and higher-order tensors.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a multiplicative renewal clock to decide when a neural module is updated, rather than updating at every wall-clock tick or using a fixed iteration schedule. The resulting computation allocates many updates early and increasingly long intervals between later updates, while preserving a tunable stochastic distribution of update times; this is intended for anytime recurrent refinement, continual learning, or adaptive inference where late updates have diminishing marginal value.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Learn a low-dimensional active frame for a neural scalar quantity on a curved latent manifold, rather than averaging gradients in unrelated ambient tangent spaces. Use the frame as the only input to a low-rank adapter or as a constraint on fine-tuning updates, with parallel transport making gradient statistics comparable across samples.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace node-restricted graph prototypes by centers that may lie at arbitrary coordinates on graph edges. For each prototype, hold its assigned points and shortest-path branches fixed, then update its edge coordinate by an exact clipped weighted least-squares formula; recompute branch changes only at arc bottleneck points. This creates a graph-aware vector-quantization or retrieval module that can represent semantic locations between existing nodes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Select the coordinates of a sparse adapter or sparse fine-tuning mask using both Fisher width and inverse-Fisher width. The mask should avoid parameter subsets that are cheap in the Fisher geometry but extremely large in the inverse-Fisher geometry, or vice versa, thereby controlling both prediction sensitivity and estimator-like uncertainty.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a coordinate MLP or neural operator using locations selected by an ordinary-kriging estimate of the unresolved field rather than by uniform random sampling. At each acquisition round, estimate the local reconstruction variance from the current labeled set and query points with the largest variance, optionally weighted by their application importance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a low-rank trilinear attention module in which query, key, and value factors are constrained to the unit sphere and refined through a few proximal alternating sweeps. The proximal terms suppress factor oscillation and make each sweep improve a well-defined tensor interaction objective, offering a stable alternative to unconstrained tensor-power iterations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train a primal neural PDE solver and a separate physical-adjoint neural solver, then use their first-order-system residuals to adaptively allocate collocation points toward regions that control a chosen quantity of interest. Instead of minimizing only the primal residual uniformly, prioritize points according to a balanced combination of primal and adjoint local residuals, because the target-output error is controlled by their global product.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Condition a temporal neural network on a tempo or dilation ratio through a homomorphism from multiplicative positive scales to additive latent shifts. A ratio composed from several scale changes then produces the sum of their learned effects, allowing interpolation and extrapolation to rates absent from training instead of using an independent embedding per rate.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Train a population controller as a convex mixture of neural trajectory policies, using a Frank-Wolfe step to add a new policy that minimizes the current population-cost linearization. The resulting mixture operates as a structured policy ensemble and can retain feasibility when each oracle policy satisfies the same support, action, and obstacle constraints. This is a principled alternative to directly optimizing one highly nonconvex multi-agent policy.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Wrap a neural estimator with V leave-fold-out refits and use the dispersion of fold pseudo-values to produce uncertainty intervals without deriving an influence function or relying on unstable parameter-space Hessians. The same construction can be applied to scalar metrics, predictions at fixed inputs, dose-response curves, or vectors of logits and probabilities.
Useful6/10
Difficulty5/10
Novelty6/10