ML: Sampling

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

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

Radial singularity-aware collocation

Use the scaled-boundary radial coordinate to control collocation density near a known point singularity or sharp source located at the scaling center. Instead of sampling \(\rho\) uniformly, choose a transformed or Gauss-Jacobi radial rule whose weights analytically cancel the geometric factor \(\rho^{d-1}\), reducing gradient variance and resolving singular fields with fewer points.

Useful6/10
Difficulty5/10
Novelty8/10
Paper: Scaled boundary cubature scheme in higher dimensions: integration over polytopes and curved regions arXiv:2608.15563
Unverified 2026

Scaled-boundary quadrature loss

Replace random interior collocation points in domain-integrated neural losses with deterministic points generated by scaling oriented boundary patches toward an interior center. The resulting quadrature exactly integrates low-degree polynomial integrands on affine polytopes and gives a mesh-free, geometry-aware loss for PINNs and neural fields.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: Scaled boundary cubature scheme in higher dimensions: integration over polytopes and curved regions arXiv:2608.15563
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
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