Related papers: Inference on white dwarf binary systems using the …

The future space-based gravitational-wave detector LISA will deliver rich and information-dense data by listening to the milliHertz Universe. The measured time series will contain the imprint of tens of thousands of detectable Galactic…

Speculative decoding (SD) accelerates language model inference by drafting tokens from a cheap proposal model and verifying them against an expensive target model via rejection sampling. Because rejection truncates the draft block at the…

Employing Bayesian inference to calibrate constitutive model parameters has grown substantially in recent years. Among the available techniques, Markov Chain Monte Carlo (MCMC) sampling remains one of the most widely used approaches for…

In many applications of Bayesian clustering, posterior sampling on the discrete state space of cluster allocations is achieved via Markov chain Monte Carlo (MCMC) techniques. As it is typically challenging to design transition kernels to…

We describe a search for the extreme-mass-ratio inspiral sources in the Round 1B Mock LISA Data Challenge data sets. The search algorithm is a Monte-Carlo search based on the Metropolis-Hastings algorithm, but also incorporates simulated,…

Resilience is becoming crucial for future wireless networks, which must withstand, adapt to, and recover from rare but potentially cascading disruptions. This paper develops a sequential Monte Carlo (SMC) simulation framework for such…

This paper presents a new Bayesian model and associated algorithm for depth and intensity profiling using full waveforms from time-correlated single-photon counting (TCSPC) measurements in the limit of very low photon counts (i.e.,…

We present a novel Bayesian inference tool that uses a neural network to parameterise efficient Markov Chain Monte-Carlo (MCMC) proposals. The target distribution is first transformed into a diagonal, unit variance Gaussian by a series of…

In many computational problems, using the Markov Chain Monte Carlo (MCMC) can be prohibitively time-consuming. We propose MCMC-Net, a simple yet efficient way to accelerate MCMC via neural networks. The key idea of our approach is to…

We introduce a new class of Monte Carlo based approximations of expectations of random variables such that their laws are only available via certain discretizations. Sampling from the discretized versions of these laws can typically…

We present the successful recovery of common envelope ejection efficiency assumed in a simulated population of double white dwarf binaries like those which may be observed by the future LISA mission. We simulate the formation of double…

Close pairs of white dwarfs are potential progenitors of Type~Ia supernovae and they are common, with of order 100 -- 300 million in the Galaxy. As such they will be significant, probably dominant, sources of the gravitational waves…

The problem of detecting a sinusoidal signal with randomly varying frequency has a long history. It is one of the core problems in signal processing, arising in many applications including, for example, underwater acoustic frequency line…

In this work, the focus is on the improvement of the existing post-Newtonian approximation for the gravitational flux from Super Massive Black Hole Binaries. In order to improve the existing templates for LISA, we need more accurate…

Binary optimization has a wide range of applications in combinatorial optimization problems such as MaxCut, MIMO detection, and MaxSAT. However, these problems are typically NP-hard due to the binary constraints. We develop a novel…

The Galactic population of close white dwarf binaries is expected to provide the largest number of gravitational wave sources for low frequency detectors such as the Laser Interferometer Space Antenna (LISA). Current data analysis…

Accreting binary white dwarf systems are among the sources expected to emanate gravitational waves that the Laser Interferometer Space Antenna (LISA) will detect. We investigate how accurately the binary parameters may be measured from LISA…

Large, sparse linear systems are pervasive in modern science and engineering, and Krylov subspace solvers are an established means of solving them. Yet convergence can be slow for ill-conditioned matrices, so practical deployments usually…

In this paper we introduce an optimized Markov Chain Monte Carlo (MCMC) technique for solving the integer least-squares (ILS) problems, which include Maximum Likelihood (ML) detection in Multiple-Input Multiple-Output (MIMO) systems. Two…

From basic considerations of the Lie group that preserves a target probability measure, we derive the Barker, Metropolis, and ensemble Markov chain Monte Carlo (MCMC) algorithms, as well as variants of waste-recycling Metropolis-Hastings…