Related papers: Non-asymptotic bounds for inclusion probabilities …
This study investigates the fundamental limits of variable-length compression in which prefix-free constraints are not imposed (i.e., one-to-one codes are studied) and non-vanishing error probabilities are permitted. Due in part to a…
This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…
We study learning of probability distributions characterized by an unknown symmetry direction. Based on an entropic performance measure and the variational method of statistical mechanics we develop exact upper and lower bounds on the…
We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the upper bound for the permanent with a…
We treat a random number generation from an i.i.d. probability distribution of $P$ to that of $Q$. When $Q$ or $P$ is a uniform distribution, the problems have been well-known as the uniform random number generation and the resolvability…
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…
Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…
In this paper we prove the asymptotic efficiency of the model selection procedure proposed by the authors in the first part. To this end we introduce the robust risk as the least upper bound of the quadratical risk over a broad class of…
In this paper, we derive an asymptotic closed--form expression for the error bound on extrapolation of doubly selective mobile MIMO wireless channels. The bound shows the relationship between the prediction error and system design…
We obtain non asymptotic concentration bounds for two kinds of stochastic approximations. We first consider the deviations between the expectation of a given function of the Euler scheme of some diffusion process at a fixed deterministic…
In this paper we extend the work of Owen (2007) by deriving a second order expansion for the slope parameter in logistic regression, when the size of the majority class is unbounded and the minority class is finite. More precisely, we…
The standard approach to analyzing the asymptotic complexity of probabilistic programs is based on studying the asymptotic growth of certain expected values (such as the expected termination time) for increasing input size. We argue that…
Tur\'an type inequalities for modified Bessel functions of the first kind are used to deduce some sharp lower and upper bounds for the asymptotic order parameter of the stochastic Kuramoto model. Moreover, approximation from the Lagrange…
Sharp, nonasymptotic bounds are obtained for the relative entropy between the distributions of sampling with and without replacement from an urn with balls of $c\geq 2$ colors. Our bounds are asymptotically tight in certain regimes and,…
In this work, we study a new recursive stochastic algorithm for the joint estimation of quantile and superquantile of an unknown distribution. The novelty of this algorithm is to use the Cesaro averaging of the quantile estimation inside…
We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…
The optimum quality that can be asymptotically achieved in the estimation of a probability p using inverse binomial sampling is addressed. A general definition of quality is used in terms of the risk associated with a loss function that…
This paper is part of series on self-contained papers in which a large part, if not the full extent, of the asymptotic limit theory of summands of independent random variables is exposed. Each paper of the series may be taken as review…
A large class of problems in sciences and engineering can be formulated as the general problem of constructing random intervals with pre-specified coverage probabilities for the mean. Wee propose a general approach for statistical inference…
We establish an ordering criterion for the asymptotic variances of two consistent Markov chain Monte Carlo (MCMC) estimators: an importance sampling (IS) estimator, based on an approximate reversible chain and subsequent IS weighting, and a…