Related papers: On the optimization of discrepancy measures
Following a result of D.~Bylik and M.T.~Lacey from 2008 it is known that there exists an absolute constant $\eta>0$ such that the (unnormalized) $L^{\infty}$-norm of the three-dimensional discrepancy function, i.e, the (unnormalized) star…
We initiate the study of quadratic discrepancy for finite point sets on the Heisenberg group $\mathbb H^n$ with respect to upper Ahlfors regular probability measures. For a natural family of test sets given by left translations and…
We study the $L^{\infty}$ discrepancy of point sets generated by determinantal point processes on all compact, connected two-point homogeneous spaces, namely spheres and projective spaces. Using concentration inequalities and variance…
We study the expected star discrepancy under a newly designed class of non-equal volume partitions. The main contributions are twofold. First, we establish a strong partition principle for the star discrepancy, showing that our newly…
This paper is related to our previous works [1][2] on the error estimate of the averaging technique, for systems with one fast angular variable. In the cited references, a general method (of mixed analytical and numerical type) has been…
The focus of this paper is on trend estimation for a general state-space model $Y_t=\mu_t+\varepsilon_t$, where the $d$th difference of the trend $\{\mu_t\}$ is assumed to be i.i.d., and the error sequence $\{\varepsilon_t\}$ is assumed to…
Offset Rademacher complexities have been shown to provide tight upper bounds for the square loss in a broad class of problems including improper statistical learning and online learning. We show that the offset complexity can be generalized…
Distributed average consensus is the main mechanism in algorithms for decentralized computation. In distributed average consensus algorithm each node has an initial state, and the goal is to compute the average of these initial states in…
We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…
This paper considers time-average optimization, where a decision vector is chosen every time step within a (possibly non-convex) set, and the goal is to minimize a convex function of the time averages subject to convex constraints on these…
Let $C$ be a convex $d$-dimensional body. If $\rho$ is a large positive number, then the dilated body $\rho C$ contains $\rho^{d}\left\vert C\right\vert +\mathcal{O}\left( \rho^{d-1}\right) $ integer points, where $\left\vert C\right\vert $…
We consider the star discrepancy of two-dimensional sequences made up as a hybrid between a Kronecker sequence and a perturbed Halton sequence in base 2, where the perturbation is achieved by a digital-sequence construction in the sense of…
For a probability measure on a real separable Hilbert space, we are interested in "volume-based" approximations of the d-dimensional least squares error of it, i.e., least squares error with respect to a best fit d-dimensional affine…
We study numerical integration on the unit sphere $\mathbb{S}^2 \subset \mathbb{R}^3$ using equal weight quadrature rules, where the weights are such that constant functions are integrated exactly. The quadrature points are constructed by…
Motivated by the need for the rigorous analysis of the numerical stability of variational least-squares kernel-based methods for solving second-order elliptic partial differential equations, we provide previously lacking stability…
It is a well-known conjecture in the theory of irregularities of distribution that the L1 norm of the discrepancy function of an N-point set satisfies the same asymptotic lower bounds as its L^2 norm. In dimension d=2 this fact has been…
In applications, a substantial number of problems can be formulated as non-linear least squares problems over smooth varieties. Unlike the usual least squares problem over a Euclidean space, the non-linear least squares problem over a…
The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number…
The paper studies the correction to the distance modulus induced by inhomogeneities and averaged over all directions from a given observer. The inhomogeneities are modeled as mass-compensated voids in random or regular lattices within…
The paper presents a formula for the reclassification of multidimensional data points (columns of real numbers, "objects", "vectors", etc.). This formula describes the change in the total squared error caused by reclassification of data…