Searcharxiv⌕ Search

arXiv subjects

Lorenz Fruehwirth

Publications and source records attributed to Lorenz Fruehwirth.

4 recordsLinked to original sources

Ergodicity of Langevin Dynamics and its Discretizations for Non-smooth Potentials

This article is concerned with sampling from Gibbs distributions $π(x)\propto e^{-U(x)}$ using Markov chain Monte Carlo methods. In particular, we investigate Langevin dynamics in the continuous- and the discrete-time setting for such distributions with potentials $U(x)$ which are strongly-convex but possibly non-differentiable. We show that the corresponding subgradient Langevin dynamics are exponentially ergodic to the target density $π$ in the continuous setting and that certain explicit as well as semi-implicit discretizations are geometrically ergodic and approximate $π$ for vanishing discretization step size. Moreover, we prove that the discrete schemes satisfy the law of large numbers allowing to use consecutive iterates of a Markov chain in order to compute statistics of the stationary distribution posing a significant reduction of computational complexity in practice. Numerical experiments are provided confirming the theoretical findings and showcasing the practical relevance of the proposed methods in imaging applications.

math.NA↗

A sharp threshold for arithmetic effects on the tail probabilities of lacunary sums

A classical observation in analysis asserts that lacunary systems of dilated functions show many properties which are also typical for systems of independent random variables. For example, if $(n_k)_{k \ge 1}$ is a sequence of integers satisfying the Hadamard gap condition $n_{k+1}/n_k\ge q > 1,~k \ge 1$, then the normalized sums $\sum_{n=1}^N \cos(2πn_k x)$, considered on the probability space $[0,1]$ with Borel $σ$-field and Lebesgue measure, satisfy the central limit theorem (CLT) and the law of the iterated logarithm (LIL). Remarkably, the situation becomes much more deliacate when the trigonometric function $\cos(2 πx)$ is replaced by a more general 1-periodic function $f$, and fine arithmetic properties of the sequence $(n_k)_{k \ge 1}$ come into play. The most relevant arithmetic property can be phrased in terms of the number of solutions of certain 2-variable Diophantine equations. Recently, the authors proved that the validity of the LIL requires a strictly stronger Diophantine criterion than the CLT. In the present paper we show that this is only a special case of a wide-ranging general principle: there is a sharp cutoff, which can be expressed in form of a Diophantine criterion on the sequence $(n_k)_{k \ge 1}$, at which the tail probabilities of $\sum_{k=1}^N f(n_k x)$ change from Gaussian to potentially erratic behavior. More precisely, let $L(N,a,b,c)$ be the number of solutions $(k,\ell)$ of the equation $a n_k - b n_\ell= c$, where $1\leq k,\ell \leq N$. Roughly speaking, we prove: if $L(N,a,b,c) \le N / g_N$ for some $g_N$, then $\mathbb{P} \left[\sum_{k=1}^N f(n_k x) > t \|f\|_2 \sqrt{N} \right]$ is asymptotically is accordance with standard normal behavior for all $t$ up to $\sqrt{2 \log g_N}$. We also show that this criterion is optimal in the sense that under the same premises, the conclusion can fail to be true for values of $t$ beyond this threshold.

math.NT↗

On a Problem of Kac concerning Anisotropic Lacunary Sums

Given a lacunary sequence $(n_k)_{k \in \mathbb{N}}$, arbitrary positive weights $(c_k)_{k \in \mathbb{N}}$ that satisfy a Lindeberg-Feller condition, and a function $f: \mathbb{T} \to \mathbb{R}$ whose Fourier coefficients $\hat{f_k}$ decay at rate $\frac{1}{k^{1/2 + \varepsilon}}$, we prove central limit theorems for $\sum_{k \leq N}c_kf(n_kx)$, provided $(n_k)_{k \in \mathbb{N}}$ satisfies a Diophantine condition that is necessary in general. This addresses a question raised by M. Kac [Ann. of Math., 1946].

math.PR↗

Sanov-type large deviations and conditional limit theorems for high-dimensional Orlicz balls

In this paper, we prove a Sanov-type large deviation principle for the sequence of empirical measures of vectors chosen uniformly at random from an Orlicz ball. From this level-$2$ large deviation result, in a combination with Gibbs conditioning, entropy maximization and an Orlicz version of the Poincaré-Maxwell-Borel lemma, we deduce a conditional limit theorem for high-dimensional Orlicz balls. Roughly speaking, the latter shows that if $V_1$ and $V_2$ are Orlicz functions, then random points in the $V_1$-Orlicz ball, conditioned on having a small $V_2$-Orlicz radius, look like an appropriately scaled $V_2$-Orlicz ball. In fact, we show that the limiting distribution in our Poincaré-Maxwell-Borel lemma, and thus the geometric interpretation, undergoes a phase transition depending on the magnitude of the $V_2$-Orlicz radius.

math.PR↗