Sampling ideas

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

✗ Mechanism failed 2026

Conditional-Flow Nested Sampling for Neural Energy Landscapes

Use a conditional normalizing flow to replace inner-loop MCMC when sampling states or parameters under progressively tighter neural energy or likelihood constraints. The flow is trained online from recent live sets, and proposals are corrected by importance weighting and resampling, so flow bias does not directly corrupt the nested estimate.

Useful8/10
Difficulty6/10
Novelty6/10
Paper: Generative Nested Sampling of Atomistic Thermodynamic Landscapes arXiv:2609.03193
✗ Mechanism failed 2026

ESS-Controlled Autoregressive CTMC Sampler

Generate discrete configurations globally with an autoregressive model and then refine them using a continuous-time Markov chain of local single-site replacement moves. Use importance weights and the paper's normalized ESS to adapt the CTMC refinement budget and to reject training batches in which the proposal has collapsed onto a few modes.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: FrOGS: Discrete Neural Sampler for Independent Alloy Configurations Across Chemical Conditions arXiv:2609.02948
✗ 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
✗ Mechanism failed 2026

Clustered alpha-smoothing mixture wrapper

Wrap a stochastic neural predictor with a robust multimodal aggregation procedure: sample the predictor at perturbed inputs, cluster the resulting outputs, trim an alpha-fraction of outliers separately inside every cluster, and return a weighted mixture rather than one global average. This should preserve distinct plausible modes while suppressing adversarial or heavy-tailed samples that would otherwise distort the prediction.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: Clustered Randomized Smoothing for Stochastic Prediction Functions arXiv:2608.12037
✗ 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