Related papers: Thinning and Information Projections

The telegraph process models a random motion with finite velocity and it is usually proposed as an alternative to diffusion models. The process describes the position of a particle moving on the real line, alternatively with constant…

We consider on-line density estimation with a parameterized density from the exponential family. The on-line algorithm receives one example at a time and maintains a parameter that is essentially an average of the past examples. After…

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than $\epsilon$ ($\epsilon$ > 0). Is is known ([BM05]) that the empirical measure of these fragments converges in law, under some…

We examine a generalization of the binomial distribution associated with a strictly increasing sequence of numbers and we prove its Poisson-like limit. Such generalizations might be found in quantum optics with imperfect detection. We…

Score-based diffusion models have demonstrated outstanding empirical performance in machine learning and artificial intelligence, particularly in generating high-quality new samples from complex probability distributions. Improving the…

Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large…

We establish the rate of convergence in the strong law of large numbers of discrete Fourier Transform of the identically distributed random variables with finite moment of order p, where 1<p<2.

The idea of slicing divergences has been proven to be successful when comparing two probability measures in various machine learning applications including generative modeling, and consists in computing the expected value of a `base…

In this work, we establish a nontrivial level of distribution for densities on $\{1,\ldots, N\}$ obtained by a biased coin convolution. As a consequence of sieving theory, one then derives the expected lower bound for the weight of such…

In this work, we present a variety of novel information-theoretic generalization bounds for learning algorithms, from the supersample setting of Steinke & Zakynthinou (2020)-the setting of the "conditional mutual information" framework. Our…

We continue our study of exponential law for occurrences and returns of patterns in the context of Gibbsian random fields. For the low temperature plus phase of the Ising model, we prove exponential laws with error bounds for occurrence,…

Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact or approximate). In this work we are interested in the case…

In the paper, upper bounds for the rate of convergence in laws of large numbers for mixed Poisson random sums are constructed. As a measure of the distance between the limit and pre-limit laws, the Zolotarev $\zeta$-metric is used. The…

A central limit theorem is proved for some strictly stationary sequences of random variables that satisfy certain mixing conditions and are subjected to the "shrinking operators" $U_r(x):=[\max\{|x|-r,0\}]\cdot x/|x|,\ r \ge 0$. For…

We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…

We establish the rate of convergence of distributions of sums of independent identically distributed random variables to the Gaussian distribution in terms of truncated pseudomoments by implementing the idea of Yu. Studnyev for getting…

For a setting in which a large number of asymmetrically informed agents are randomly matched into groups over time, exchanging their information with each other when matched, we provide an explicit solution for the dynamics of the…

This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation…

This work consists in the asymptotic analysis of the solution of Poisson equation in a bounded domain of $\mathbb{R}^{P}$ $(P=2,3)$ with a thin layer. We use a method based on hierarchical variational equations to derive asymptotic…

Real count data time series often show the phenomenon of the underdispersion and overdispersion. In this paper, we develop two extensions of the first-order integer-valued autoregressive process with Poisson innovations, based on binomial…