ML: Sampling

Machine-learning ideas tagged Sampling in the ML taxonomy of the Math2NN corpus.

✗ Failed on benchmark 2026

Persistent Hamiltonian categorical sampler

Replace independent categorical proposals or reversible Metropolis updates for discrete latent variables with a lifted sampler carrying persistent continuous edge momenta. Neighbor transitions are biased by the momentum and use a symmetric energy factor, so momentum reversal gives the required balance relation for the target Gibbs distribution while ordinary dynamics remain non-reversible. This should reduce random-walk behavior when sampling multimodal categorical latents or token sequences.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Hamiltonian dynamics for sampling on discrete spaces arXiv:2608.17961
✗ Failed on benchmark 2026

Cubic-Rate Third-Order Langevin Optimizer

Replace the usual parameter-plus-momentum Langevin state with a three-level chain consisting of parameters, velocity, and acceleration, while injecting Gaussian noise only into the highest auxiliary state. At a saddle, the escaping direction has a positive rate given by a cubic characteristic equation; use this rate to choose damping or adapt the temperature so that basin escape is accelerated without making the dynamics unstable.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: An Eyring--Kramers Law for the Hypoelliptic Third-Order Langevin Diffusion arXiv:2607.20882
Unverified 2026

Critical-Coupling Noise Controller

Add calibrated multiplicative noise to a binary energy-based model, Hopfield network, or discrete recurrent attractor system so that its effective coupling follows a chosen distance from the collective critical point. Unlike ordinary temperature annealing, the controller distinguishes microscopic channel noise from Gibbs or sampling noise and predicts when ordered attractors should disappear through a measurable susceptibility peak.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Decoherence-controlled collective criticality in a two-dimensional quantum Stag Hunt arXiv:2609.02957
Unverified 2026

Resolution-Invariant Hilbert-Space CNF Prior

Replace a finite-dimensional latent prior for fields or trajectories with a continuous flow acting on function coefficients in a separable Hilbert space. A Gaussian reference with an explicit covariance spectrum is transformed by a learned vector field, so the model can represent smooth, non-isotropic function distributions while sharing parameters across discretization resolutions.

Useful6/10
Difficulty6/10
Novelty6/10
Paper: Learning Informative Prior with Infinite-Dimensional Continuous Normalizing Flow for Bayesian Inverse Problem arXiv:2609.03343
Unverified 2026

Windowed Bouncy Particle Weight Sampler

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
Paper: Windowed thinning and query complexity for the bouncy particle and Zigzag samplers arXiv:2607.28413
Unverified 2026

Accelerated randomized Hamiltonian posterior sampler

Replace Langevin or random-walk sampling for a strongly log-concave neural subproblem with randomized Hamiltonian trajectories. Each iteration draws a fresh Gaussian velocity, integrates position and velocity for a random triangular or exponential duration, and discards the terminal velocity before the next refresh. The target is a regularized posterior over a convex neural-network head, where the paper's accelerated dependence on the strong-convexity parameter is applicable.

Useful6/10
Difficulty5/10
Novelty5/10
Paper: Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo arXiv:2607.12902