From the 1 of 5 linked papers with an AI index.
5 papers
Random sets are close to low-discrepancy sets
Gleb Smirnov, Roman Vershynin
The paper proves that a random sample from any probability distribution in ℝⁿ can be slightly adjusted to become a low‑discrepancy point set with star discrepancy roughly polylog(n…
Discrepancy and Fisher information
Gleb Smirnov, Roman Vershynin
We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fishe…
Thinning to improve two-sample discrepancy
Gleb Smirnov, Roman Vershynin
The discrepancy between two independent samples \(X_1,\dots,X_n\) and \(Y_1,\dots,Y_n\) drawn from the same distribution on typically has order \(O(\sqrt{n})\) even…
Improving discrepancy by moving a few points
Gleb Smirnov, Roman Vershynin
We show how to improve the discrepancy of an iid sample by moving only a few points. Specifically, modifying \( O(m) \) sample points on average reduces the Kolmogorov-Smirnov dist…
Detecting adversarial attacks on random samples
Gleb Smirnov
This paper studies the problem of detecting adversarial perturbations in a sequence of observations. Given a data sample drawn from a standard normal distributio…