Skip to content
Open access

Nii-MALA: A Fast Metropolis-Adjusted Langevin Sampler with Radial Velocity Benchmarks

Sep 2026 · Publications of the Astronomical Society of the Pacific · Vol 138 · 0 citations · 38 references
Physics Mathematics

TL;DR

Nii-MALA is introduced, a high-performance C implementation of the Metropolis-Adjusted Langevin Algorithm, which leverages Message Passing Interface for parallelization and incorporates automatic differentiation backends for gradient evaluation and benchmark it against several other codes using radial velocity data from 51 Pegasi b.

Abstract

Markov chain Monte Carlo is widely used for model assessment and parameter fitting in astronomy and astrophysics, leading to numerous ready-to-use packages implementing various sampling techniques. For large-scale analyses involving many individual targets, computational efficiency becomes paramount, as it dictates the overall runtime. We introduce Nii-MALA, a high-performance C implementation of the Metropolis-Adjusted Langevin Algorithm, which leverages Message Passing Interface for parallelization and incorporates automatic differentiation backends for gradient evaluation. The code offers flexible control via a configuration file, allowing users to specify the proposal step sizes for all model parameters across parallel chains. We validate its effectiveness on 15- and 30-dimensional Gaussian distributions and a bimodal distribution, and further benchmark it against several other codes using radial velocity data from 51 Pegasi b. Our benchmarks confirm the efficiency of Langevin sampling over random-walk sampling in obtaining the effective sample size, particularly as the dimensionality of the target function increases. This algorithmic advantage can be effectively leveraged when paired with an efficient automatic differentiation library. However, for complex functions commonly encountered in astronomy—such as radial velocity orbital fitting—the derivative-dependent Langevin sampler shows lower efficiency than parallel tempering or alternative sampling approaches, as revealed by effective sample size analysis.

Read PDF

Similar papers

FUND: Density Flow for Sampling Unnormalised Distributions

Efficient sampling from Boltzmann distributions is central to modelling complex physical systems. Markov Chain Monte Carlo (MCMC) methods suffer from critical slowing down, high autocorrelation, and poor mode-mixing, limiting their scalability. Recent advances, like Boltzmann Generators, offer a promising alternative b...

V. Kanaujia, Vipul Arora · 1 citation
Preprint Aug 2026

Fast and efficient nested sampling with BEST

A new nested-sampling implementation in TensorFlow is presented, written entirely in TensorFlow and designed for efficient XLA compilation on both CPUs and GPUs, that combines clustering and slice sampling with the possibility of updating several live points simultaneously.

Andreas Nygaard · 0 citations
Preprint Sep 2026

Massively parallel transdimensional sampling with data assimilation: an application to LISA galactic binaries

A transdimensional Sequential Monte Carlo (SMC) framework designed to exploit massive parallelism that evolves a population of particles through a sequence of tempered distributions and uses the No-U-Turn Sampler for the exploration of fixed-dimensional parameter space while reversible-jump birth and death moves allow...

G. Demasi, W. Del Pozzo · 0 citations
#machine learning Preprint Sep 2026

Neural Transport Nested Sampling

This work develops a novel sampling algorithm, Neural Transport Nested Sampling (NTNS), which combines the classical strengths of nested sampling with modern neural flow-based methods, and is the first neural sampler to return a calibrated, temperature resolved partition function estimate at this scale.

D. Yallup, Will Handley · 0 citations
#machine learning Preprint Sep 2026

HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC

Experiments on logistic regression, probabilistic matrix factorization, and Bayesian neural networks show that HyperMC improves posterior approximation or predictive calibration relative to MAMBA, grid search, and heuristic baselines, while Robust HyperMC yields more stable and reproducible tuning results.

Min-Chin Tan, Xi-Yun Jiao · 0 citations
Review Sep 2026

CERIDWEN: Fast and Flexible GPU-Accelerated Stellar Population Inference

JWST has increased both the number of high-redshift galaxies with high-quality spectral energy distributions (SEDs) and their information content. In parallel, wide-area surveys from Euclid, Rubin's LSST, and Roman will increase galaxy samples by orders of magnitude. Analysing these datasets requires stellar-population...

A. Stoffers, S. Tacchella, B. D. Johnson · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.