mlsanityData to 7 Oct 2026

Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers

arXiv 2203.09142 ↗First posted 17 Mar 2022cs.LG eess.SP stat.APcited by 1

Not on the map. Why?

Abstract (arXiv)

Monitoring the Covid19 pandemic constitutes a critical societal stake that received considerable research efforts. The intensity of the pandemic on a given territory is efficiently measured by the reproduction number, quantifying the rate of growth of daily new infections. Recently, estimates for the time evolution of the reproduction number were produced using an inverse problem formulation with a nonsmooth functional minimization. While it was designed to be robust to the limited quality of the Covid19 data (outliers, missing counts), the procedure lacks the ability to output credibility interval based estimates. This remains a severe limitation for practical use in actual pandemic monitoring by epidemiologists that the present work aims to overcome by use of Monte Carlo sampling. After interpretation of the nonsmooth functional into a Bayesian framework, several sampling schemes are tailored to adjust the nonsmooth nature of the resulting posterior distribution. The originality of the devised algorithms stems from combining a Langevin Monte Carlo sampling scheme with Proximal operators. Performance of the new algorithms in producing relevant credibility intervals for the reproduction number estimates and denoised counts are compared. Assessment is conducted on real daily new infection counts made available by the Johns Hopkins University. The interest of the devised monitoring tools are illustrated on Covid19 data from several different countries.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 63 references that are in the map. First posted on arXiv 17 Mar 2022.

Builds on

9 of 63 references.

References · 9

  1. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  2. 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
  3. 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 117
  4. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
  5. 2020Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithmcited by 34
  6. 2019Langevin Monte Carlo without smoothnesscited by 27
  7. 2021A Survey of Monte Carlo Methods for Parameter Estimationcited by 23
  8. 2018A Review of Multiple Try MCMC algorithms for Signal Processingcited by 5
  9. 2021Nonsmooth convex optimization to estimate the Covid-19 reproduction number space-time evolution with robustness against low quality datacited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.