Related papers: Discrepancy bounds for low-dimensional point sets
Similarly to $\beta$-adic van der Corput sequences, abstract van der Corput sequences can be defined for abstract numeration systems. Under some assumptions, these sequences are low discrepancy sequences. The discrepancy function is…
We study the $L_p$ discrepancy of digital NUT sequences which are an important sub-class of digital $(0,1)$-sequences in the sense of Niederreiter. The main result is a lower bound for certain sub-classes of digital NUT sequences.
We study the classes of $(u,m,{\bf e},s)$-nets and $(u,{\bf e},s)$-sequences, which are generalizations of $(u,m,s)$-nets and $(u,s)$-sequences, respectively. We show equivalence results that link the existence of $(u,m,{\bf e},s)$-nets and…
In complicated/nonlinear parametric models, it is generally hard to know whether the model parameters are point identified. We provide computationally attractive procedures to construct confidence sets (CSs) for identified sets of full…
In this paper we introduce and study nets and sequences constructed in an irrational base, focusing on the case of a base given by the golden ratio $\phi$. We provide a complete framework to study equidistribution properties of nets in base…
We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…
According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an $\eps$-net of size $O\left(\frac{1}{\eps}\log\frac1{\eps}\right)$. Using probabilistic techniques, Pach and Woeginger (1990)…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficiently fill the space in a uniform manner. Low-discrepancy…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…
We study some known approximation properties and introduce and investigate several new approximation properties, closely connected with different quasi-normed tensor products. These are the properties like the $AP_s$ or $AP_{(s,w)}$ for…
For a given complex finite dimensional subspace $S$ of $\mathbb{C}^n$ and a fixed basis, we study the compact and convex subset of $\left(\mathbb{R}_{\geq 0}\right)^n$ that we call the moment of $S$ $m_S=$ convex hull…
An $\varepsilon$-coreset for Least-Mean-Squares (LMS) of a matrix $A\in{\mathbb{R}}^{n\times d}$ is a small weighted subset of its rows that approximates the sum of squared distances from its rows to every affine $k$-dimensional subspace of…
We propose regression networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each class. In high dimensional embedding…
Quasi-Monte Carlo methods have become the industry standard in computer graphics. For that purpose, efficient algorithms for low discrepancy sequences are discussed. In addition, numerical pitfalls encountered in practice are revealed. We…
In nearest-neighbor classification problems, a set of $d$-dimensional training points are given, each with a known classification, and are used to infer unknown classifications of other points by using the same classification as the nearest…
Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…
In 2001, K\'arolyi, Pach and T\'oth introduced a family of point sets to solve an Erd\H{o}s-Szekeres type problem; which have been used to solve several other Ed\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested…