Related papers: On randomness reduction in the Johnson-Lindenstrau…
It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…
Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation,…
The Johnson-Lindenstrauss (JL) lemma is a fundamental result in dimensionality reduction, ensuring that any finite set $X \subseteq \mathbb{R}^d$ can be embedded into a lower-dimensional space $\mathbb{R}^k$ while approximately preserving…
The resampling algorithm of Moser \& Tardos is a powerful approach to develop constructive versions of the Lov\'{a}sz Local Lemma (LLL). We generalize this to partial resampling: when a bad event holds, we resample an appropriately-random…
The Lorentz transformation describes differential simultaneity, which reflects the offsetting of time with distance between reference frames. Differential simultaneity is essential for Lorentz invariance. Here, the current experimental…
The Bernoulli convolution with parameter $\lambda\in(0,1)$ is the measure on $\bf R$ that is the distribution of the random power series $\sum\pm\lambda^n$, where $\pm$ are independent fair coin-tosses. This paper surveys recent progress on…
Let $X=(X_t)_{t\geq 0}$ be a known process and $T$ an unknown random time independent of $X$. Our goal is to derive the distribution of $T$ based on an iid sample of $X_T$. Belomestny and Schoenmakers (2015) propose a solution based the…
Randomized experiments are a crucial tool for causal inference in many different fields. Rerandomization addresses any covariate imbalance in such experiments by resampling treatment assignments until certain balance criteria are satisfied.…
We present in this paper first-order alternating linearization algorithms based on an alternating direction augmented Lagrangian approach for minimizing the sum of two convex functions. Our basic methods require at most $O(1/\epsilon)$…
In modern scientific research, small-scale studies with limited participants are increasingly common. However, interpreting individual outcomes can be challenging, making it standard practice to combine data across studies using random…
For $g < n$, let $b\_1,...,b\_{n-g}$ be $n - g$ independent vectors in $\mathbb{R}^n$ with a common distribution invariant by rotation. Considering these vectors as a basis for the Euclidean lattice they generate, the aim of this paper is…
The purpose of this paper is to synthesize the approaches taken by Chatterjee-Meckes and Reinert-R\"ollin in adapting Stein's method of exchangeable pairs for multivariate normal approximation. The more general linear regression condition…
Classical randomized experiments, equipped with randomization-based inference, provide assumption-free inference for treatment effects. They have been the gold standard for drawing causal inference and provide excellent internal validity.…
This paper is devoted to establishing exponential bounds for the probabilities of deviation of a sample sum from its expectation, when the variables involved in the summation are obtained by sampling in a finite population according to a…
We give a simple inequality for the sum of independent bounded random variables. This inequality improves on the celebrated result of Hoeffding in a special case. It is optimal in the limit where the sum tends to a Poisson random variable.
This paper deals with Poisson approximation to weighted sums of locally dependent random variables using Stein's method. The derived result represents a significant improvement of existing results. To illustrate the effectiveness of our…
A new method of derivation of Lorentz Transformation (LT) is given based on both axioms of special relativity (SR) and physical intuitions. The essence of the transformation is established and the crucial role played by the presumptions is…
We develop a novel methodology based on the marriage between the Bhattacharyya distance, a measure of similarity across distributions of random variables, and the Johnson-Lindenstrauss Lemma, a technique for dimension reduction. The…
This paper introduces a new approach to the study of rates of convergence for posterior distributions. It is a natural extension of a recent approach to the study of Bayesian consistency. In particular, we improve on current rates of…
Let $(X_{i}, i\in J)$ be a family of locally dependent nonnegative integer-valued random variables, and consider the sum $W=\sum\nolimits_{i\in J}X_i$. We first establish a general error upper bound for $d_{TV}(W, M)$ using Stein's method,…