ML: Sampling

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

△ Mechanism confirmed, baseline not beaten 2026

CVaR-tail active residual correction

Train a cheap neural surrogate globally, then use an ensemble or bootstrap covariance to identify inputs near the estimated upper-tail boundary and inputs where high-fidelity correction is uncertain. Fit a Tikhonov-regularized residual model on the acquired expensive labels and use the corrected predictor for CVaR estimation or risk-constrained optimization. The acquisition policy deliberately ignores easy central-region samples unless they influence the tail threshold.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: Risk-averse design optimization with CVaR constraints via multifidelity tail-region correction arXiv:2608.29222
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

Automorphism-corrected architecture MCMC

Run Metropolis-Hastings directly on neural architectures modulo permutations of structurally exchangeable hidden units, channels, or experts rather than treating every labelled representation as a distinct architecture. Correct the proposal ratio using representation-orbit sizes, so architectures with many internal symmetries receive the intended posterior mass.

Useful6/10
Difficulty6/10
Novelty5/10
Paper: Metropolis-Hastings Sampling of Phylogenetic Networks: Correcting for Symmetries arXiv:2608.12430
Unverified 2026

Ball-Coordinate MCMC for Heavy-Tailed Bayesian Networks

Reparameterize all Bayesian neural-network weights by a bounded latent vector in the unit ball and use a simple ball-constrained MCMC kernel instead of unconstrained HMC or random-walk sampling. A radial diffeomorphism expands points near the ball boundary into arbitrarily large weights, preserving heavy-tailed posterior mass while preventing the sampler from numerically wandering through an unbounded parameter space.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Diffeomorphic Markov Chain Monte Carlo: fast mixing for heavy-tailed distributions arXiv:2608.04284