Unverified
2026
Replace an unconstrained latent-to-data map in a small generative model with a learned Brenier map T equal to the gradient of a convex potential, transporting a Gaussian latent distribution toward a density proportional to exp(-B) times the Gaussian density. Constrain B to be globally L-Lipschitz and use the resulting dimension-free Jacobian ceiling as an adaptive stability target. This should reduce pathological local expansion without requiring B itself to be convex or its Hessian to be…
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Modify a diffusion sampler over a complete scenario trajectory z by exponentially tilting its prior toward a learned failure score s(z), rather than conditioning independently on environment and execution variables. The resulting sampler spends more evaluations in rare failure regions while preserving an explicit importance weight for estimating probabilities under the original distribution.
Useful6/10
Difficulty5/10
Novelty4/10
Unverified
2026
Use the OU process driven by multiple dichotomous noises as a bounded colored-noise module for latent-variable or diffusion sampling. Its stationary forcing is compactly supported for fixed amplitudes, while heterogeneous amplitudes and switching rates create controllable non-Gaussian structure before the large-K Gaussian limit.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use a fixed learned energy or score network but search over inference protocols with different mobility, temperature, and duration. Select the shortest protocol that reaches a target accuracy without exceeding a prescribed entropy-production budget, exploiting the paper's observation that computational accuracy does not uniquely determine the thermodynamic path.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a temperature-response constraint to stochastic neural predictors so that changes in inverse temperature cannot produce disproportionately large changes in expected loss or energy. This converts the nonequilibrium fluctuation-response inequality into a measurable robustness monitor and a regularizer for beta-conditioned stochastic representations.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Approximate an expensive neural objective as a local second-order Hermite polynomial over a symmetric action stencil, then optimize the fitted polynomial rather than repeatedly evaluating the original objective. Unlike a Taylor model, the coefficients are obtained from function values and do not require reliable action derivatives through a simulator or learned environment.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a learned dividing surface between two modes or basins of a neural energy model, and regulate Langevin or diffusion noise using the measured one-way crossing flux. The surface should be aligned with an estimated saddle direction and should reject immediate recrossings, so the controller responds to genuine mode transitions rather than local oscillations.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Partition a long integration interval into M short segments and assign one neural trajectory approximator to each segment. Instead of asking a single network to satisfy the ODE and initial condition over the entire horizon, construct every segment so that its value at the left boundary is exactly the terminal value predicted by the previous segment. This removes interface discontinuities from the optimization problem and should improve long-horizon trajectory accuracy and gradient stability.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Parameterize a periodic neural vector field as the sum of a harmonic global drift, an exact gradient field, and a co-exact divergence-free field. This gives separate control over conservative attraction/repulsion, rotational transport, and domain-wide drift, potentially preventing one unconstrained MLP from entangling incompatible dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Turn the paper's self-fictitious-play process into a learned sampler for latent training examples or diffusion states. A controller network generates trajectories using a best response to a slowly updated occupancy belief, and the belief is updated from the controller's own states with an exponential occupation-measure update. The slow update prevents abrupt feedback loops while the controller continually adapts toward underrepresented regions.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace backpropagated gradients in a Langevin sampler with a simultaneous-perturbation estimate obtained from two noisy evaluations of a neural energy or simulator-defined negative log-density. This enables posterior or latent-space sampling when the energy contains nondifferentiable code, stochastic simulation, discrete operations, or an inaccessible neural-network gradient.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Inject scale-mixture noise into SGD by sampling the perturbation magnitude from an inverse-gamma distribution rather than using fixed-variance Gaussian noise. The resulting gradient updates have kappa or Student-t tails, allowing rare large exploratory steps while retaining an explicit control parameter for the Gaussian limit and for the existence of noise moments.
Useful6/10
Difficulty3/10
Novelty6/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 isotropic particle noise or unconstrained pairwise graph updates by antisymmetric, relative-velocity-tangential noise. For each pair of particles, the update lies approximately in the hyperplane orthogonal to their relative displacement and has variance determined by a regularized soft-potential kernel. This should produce stochastic exploration while reducing center-of-mass drift and violations of kinetic-energy-like invariants.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an O(N^2) kernel-density interaction in a particle neural SDE or diffusion sampler with a clipped, randomly shifted histogram density estimate. Feed the local estimated density into the particle drift as a multiplicative gain, preserving density-dependent dynamics while evaluating all particles through occupied-cell hashing in expected O(N) time for fixed dimension and number of shifts.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Augment diffusion score matching with a penalty on the exponential moment of the score residual, targeting the sub-Gaussian error regime identified as necessary for tractable sampling. This penalizes rare, catastrophic score errors much more strongly than an L2 loss and should improve robustness of reverse-time sampling in low-density regions.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace the explicit Euler, Heun, or fixed-step midpoint update used for a neural ODE or diffusion probability-flow trajectory with a two-stage randomized SDIRK step. Draw one random scalar per time step, use it in both implicit stage equations, and solve each stage with Newton or damped fixed-point iteration. The randomness targets quadrature error caused by nonsmooth score networks, while the singly diagonal structure permits reuse of the same Jacobian preconditioner for both stage solves.
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Choose the diffusion noise schedule to maximize the minimum DSM sensitivity to important distribution parameters, such as mixture weights. This should reduce mode amplification and improve recovery of rare modes without changing the score-network architecture.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build the diffusion drift as a contractive linear term plus a spectrally controlled residual, so trajectories are pulled toward a state-dependent center while retaining nonlinear expressivity. This directly targets the paper's sharper one-sided dissipative regime rather than hoping that ordinary weight decay produces dissipativity.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a rare transition in a neural latent space by a controlled path whose drift is optimized directly, instead of obtaining it by reversing the relaxation dynamics. Learn a state-dependent mobility or diffusion matrix so that the sampler allocates noise and control effort according to the local stochastic geometry. This should improve generation of low-probability transitions in nonequilibrium world models and reduce the number of failed trajectories.
Useful6/10
Difficulty6/10
Novelty5/10
✗ Mechanism failed
2026
Replace a time-dependent neural velocity field with a neural initial phase whose evolution is determined by the Madelung equations. Particles are sampled once from a reference density and then moved deterministically along the characteristic velocity field, while the quantum potential supplies a density-dependent smoothing and curvature correction.
Useful6/10
Difficulty7/10
Novelty6/10
✗ Failed on benchmark
2026
Add the paper's local Sine_beta fusion law as an analytic score prior for diffusion models that generate unordered point configurations. The model is trained to match both the usual diffusion score and an explicit short-range repulsion score, including the second-order correction that describes finite-scale fused configurations.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a score-based diffusion model on a domain with partially reactive constraints, replacing hard rejection or large boundary penalties by a Robin boundary condition. Samples approaching the constraint boundary acquire a hazard proportional to accumulated boundary local time, giving a continuous interpolation between reflection and absorption.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace nearest-center or k-modes assignment on a pool of binary neural-network samples with responsibility thresholding followed by a coordinate-wise dominance screen. Only retain a candidate mode when its assigned samples are sufficiently explained by that mode and, at every bit position, the responsibility-weighted majority agrees with the proposed center; otherwise mark the mode unreliable or discard it.
Useful5/10
Difficulty4/10
Novelty7/10