A Note on the Polynomial Ergodicity of the One-Dimensional Zig-Zag process

06/21/2021
by   G. Vasdekis, et al.
0

We prove polynomial ergodicity for the one-dimensional Zig-Zag process on heavy tailed targets and identify the exact order of polynomial convergence of the process when targeting Student distributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2021

Speed Up Zig-Zag

Zig-Zag is Piecewise Deterministic Markov Process, efficiently used for ...
research
11/02/2022

Heavy-Tailed Pitman–Yor Mixture Models

Heavy tails are often found in practice, and yet they are an Achilles he...
research
07/22/2019

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolati...
research
10/20/2019

The exact complexity of the Tutte polynomial

This is a survey on the exact complexity of computing the Tutte polynomi...
research
03/12/2021

An FPTAS for the Δ-modular multidimensional knapsack problem

It is known that there is no EPTAS for the m-dimensional knapsack proble...
research
07/23/2018

Outliers and The Ostensibly Heavy Tails

The aim of the paper is to show that the presence of one possible type o...
research
01/20/2022

Heavy-tailed Sampling via Transformed Unadjusted Langevin Algorithm

We analyze the oracle complexity of sampling from polynomially decaying ...

Please sign up or login with your details

Forgot password? Click here to reset