Sampling ideas

Diffusion step schedules, solvers, guidance and stopping rules that cut function evaluations or improve sample quality.

△ Mechanism confirmed, baseline not beaten 2026

Dissipation-Budgeted Nonreversible Sampling

Add a controlled nonreversible drift to a Langevin or score-based diffusion sampler so trajectories reach a target high-probability region faster, while constraining pathwise entropy production or excess heat. The paper predicts that hazard-rate improvement has a thermodynamic ceiling: general time-dependent survival acceleration is at most linear in perturbation strength and prior entropy production, while rare-event acceleration is bounded exponentially by excess heat.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Accelerating stochastic processes through nonequilibrium driving: Thermodynamic constraints on the maximum speed-up arXiv:2609.03179
△ Mechanism confirmed, baseline not beaten 2026

Fisher-Geodesic Finite-Step Annealing

Replace uniformly spaced diffusion or energy annealing schedules by a finite sequence of quench-relax stages whose intermediary distributions are approximately equally spaced in Fisher-Rao distance. Each stage abruptly changes the model energy or noise level and then runs a short relaxation phase; the schedule concentrates stages where the distribution changes most sharply. This should reduce nonequilibrium mismatch at a fixed number of sampler evaluations and avoid large distributional jumps…

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Finite relaxation protocols with minimal dissipation arXiv:2608.25207
✗ Failed on benchmark 2026

Conditional spacetime-cluster sampler for rare neural trajectories

Represent a stochastic recurrent or state-space model as an event trajectory and train it with trajectories conditioned on a rare terminal event, such as a catastrophic state, a constraint violation, or an unusually large prediction error. Instead of simulating forward until the event occurs, update connected spacetime clusters while holding the initial state and terminal event boundary fixed, so every retained trajectory is useful for rare-event learning. This provides a principled alternative…

Useful7/10
Difficulty7/10
Novelty8/10
Paper: Rare-event sampling for stochastic dynamics in network systems using cluster updates arXiv:2608.16171
✗ Mechanism failed 2026

Controlled Stationary Hyperparameter Sweep

Replace many independently equilibrated SGLD runs at different hyperparameters with one controlled sweep in which an auxiliary drift transports particles through the stationary distributions indexed by the swept parameter. Estimate the response of loss, predictions, uncertainty, or weight observables using covariance with the stationary generalized-potential derivative instead of finite differences between separate runs.

Useful7/10
Difficulty7/10
Novelty7/10
Paper: Shortcuts to Parameter Sweeps arXiv:2608.12154
✗ Failed on benchmark 2026

Gaussian-compensated Levy neural noise

Replace the unresolved small jumps of an infinite-activity stable Levy noise source in a neural SDE or stochastic optimizer with one Gaussian increment whose variance equals the discarded jump variance. Simulate only jumps above the cutoff exactly or by Poisson sampling, retaining the large-jump distribution while obtaining the paper's O(\varepsilon) Wasserstein error instead of the naive O(\varepsilon^{1-\alpha/2}) error.

Useful7/10
Difficulty5/10
Novelty8/10
Paper: A spectral-compensated scheme for space-parameter Poisson noise functionals: error bounds and complexity estimates arXiv:2607.27657
✗ Mechanism failed 2026

Dependence-Adaptive Timestep Controller

Use an online estimate of the target distribution's remaining coordinate dependence to choose diffusion step sizes instead of using a uniform timestep grid. Take large jumps when the current state is nearly coordinate-factorized and shorten the step when the denoiser detects strong cross-coordinate dependence, targeting the paper's dependence-adaptive discretization scaling.

Useful7/10
Difficulty4/10
Novelty8/10
Paper: Provably adaptive sampling with uniform and remasking discrete diffusion models arXiv:2608.23554
Unverified 2026

Dissipation-Constrained Fast Inference

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
Paper: The thermodynamic freedom of a thermodynamic computer arXiv:2608.27938