◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sebastian J. Vollmer

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author3

Across the 3 of 4 papers where every author was matched, so the position is known.

fields
  • stat.ML3
  • stat.ME1
ORCID 0000-0003-2831-1401
same name
  • Sebastian J. Vollmer — 15 papers, h 6
  • Sebastian J. Vollmer — 5 papers, h 3
  • Sebastian J. Vollmer — 2 papers, h 4
  • Sebastian J. Vollmer — 1 paper, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedConsistency and fluctuations for stochastic gradient Langevin dynamics

16 citations · 29 across the 4 of their papers we have counts for

collaborators

4 papers

stat.ML2016★ 5 cited

Multilevel Monte Carlo for Scalable Bayesian Computations

Mike Giles, Tigran Nagapetyan, Lukasz Szpruch +2

Markov chain Monte Carlo (MCMC) algorithms are ubiquitous in Bayesian computations. However, they need to access the full data set in order to evaluate the posterior density at eve…

stat.ML2016★ 7 cited

Relativistic Monte Carlo

Xiaoyu Lu, Valerio Perrone, Leonard Hasenclever +2

Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Ha…

stat.ME2014★ 1 cited

Unbiased Monte Carlo: posterior estimation for intractable/infinite-dimensional models

Sergios Agapiou, Gareth O. Roberts, Sebastian J. Vollmer

We provide a general methodology for unbiased estimation for intractable stochastic models. We consider situations where the target distribution can be written as an appropriate li…

stat.ML2014★ 16 cited

Consistency and fluctuations for stochastic gradient Langevin dynamics

Yee Whye Teh, Alexandre Thiéry, Sebastian Vollmer

Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally expensive. Both the calculation of the acceptance probability and the creation of…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.