Consider a random graph G of size N constructed according to a
graphon w...
A matching prior at level 1-α is a prior such that an associated
1-α cre...
It is widely known that the performance of Markov chain Monte Carlo (MCM...
Consider a random graph process with n vertices corresponding to points
...
Many Bayesian inference problems involve target distributions whose dens...
Based on the Kac random walk on the orthogonal group, we present a fast
...
The “drift-and-minorization” method, introduced and popularized in
(Rose...
We present the Uppsala system for the CoNLL 2018 Shared Task on universa...
We provide a comprehensive analysis of the interactions between pre-trai...
A family {Q_β}_β≥ 0 of Markov chains is said to exhibit
metastable mixin...
Hamiltonian Monte Carlo (HMC) is a very popular and generic collection o...
How to make the most of multiple heterogeneous treebanks when training a...
In-order scalar RISC architectures have been the dominant paradigm in FP...
We obtain several quantitative bounds on the mixing properties of the
Ha...