Searcharxiv⌕ Search

arXiv subjects

Maximilian Scott

Publications and source records attributed to Maximilian Scott.

2 recordsLinked to original sources

A binomial-adjusted $θ$-trapezoidal tau-leaping method for chemical kinetic systems

In Hu, Li and Min (2011), the authors propose a weak second order accurate $θ$-trapezoidal method as an improvement to the classical tau-leaping method. However, for complex chemical kinetic systems their model's underlying analytical assumptions can fail to hold in practice, leading to a significant reduction in its computational effectiveness. Here we introduce a modification to the method which allows it to regain desirable convergence characteristics, both given the original and a relaxed version of the underlying assumptions. We confirm this improvement through a local error analysis and present numerical examples showing it consistently performs either better or comparable to the $θ$-trapezoidal method.

math.NA↗

Underdamped Langevin MCMC with third order convergence

In this paper, we propose a new numerical method for the underdamped Langevin diffusion (ULD) and present a non-asymptotic analysis of its sampling error in the 2-Wasserstein distance when the $d$-dimensional target distribution $p(x)\propto e^{-f(x)}$ is strongly log-concave and has varying degrees of smoothness. Precisely, under the assumptions that the gradient and Hessian of $f$ are Lipschitz continuous, our algorithm achieves a 2-Wasserstein error of $\varepsilon$ in $\mathcal{O}(\sqrt{d}/\varepsilon)$ and $\mathcal{O}(\sqrt{d}/\sqrt{\varepsilon})$ steps respectively. Therefore, our algorithm has a similar complexity as other popular Langevin MCMC algorithms under matching assumptions. However, if we additionally assume that the third derivative of $f$ is Lipschitz continuous, then our algorithm achieves a 2-Wasserstein error of $\varepsilon$ in $\mathcal{O}(\sqrt{d}/\varepsilon^{\frac{1}{3}})$ steps. To the best of our knowledge, this is the first gradient-only method for ULD with third order convergence. To support our theory, we perform Bayesian logistic regression across a range of real-world datasets, where our algorithm achieves competitive performance compared to an existing underdamped Langevin MCMC algorithm and the popular No U-Turn Sampler (NUTS).

stat.ML↗