Related papers: Calculation of Discrepancy Measures and Applicatio…
In this chapter we present a brief summary of methods, instruments and calibration techniques used in modern astronomical polarimetry in the optical wavelengths. We describe the properties of various polarization devices and detectors used…
Metric magnitude is a measure of the "size" of point clouds with many desirable geometric properties. It has been adapted to various mathematical contexts and recent work suggests that it can enhance machine learning and optimization…
The irregularities of a distribution of $N$ points in the unit interval are often measured with various notions of discrepancy. The discrepancy function can be defined with respect to intervals of the form $[0,t)\subset [0,1)$ or arbitrary…
The fully general calculation of the cosmic error on N-point correlation functions and related quantities is presented. More precisely, the variance caused by the finite volume, discreteness, and edge effects is determined for {\em any}…
In this note, we prove that the problem of computing the linear discrepancy of a given matrix is $\Pi_2$-hard, even to approximate within $9/8 - \epsilon$ factor for any $\epsilon > 0$. This strengthens the NP-hardness result of Li and…
An optimal 3-point quadrature formula of closed type is derived. Various error inequalities are established. Applications in numerical integration are also given.
The aim of this article is to make a contribution to the Bayesian procedure of testing precise hypotheses for parametric models. For this purpose, we define the Bayesian Discrepancy Measure that allows one to evaluate the suitability of a…
We study one of the key tools in data approximation and optimization: low-discrepancy colorings. Formally, given a finite set system $(X,\mathcal S)$, the \emph{discrepancy} of a two-coloring $\chi:X\to\{-1,1\}$ is defined as $\max_{S \in…
In this paper, we consider the upper bound of the probabilistic star discrepancy based on Hilbert space filling curve sampling. This problem originates from the multivariate integral approximation, but the main result removes the strict…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
Starspots are thought to be regions of locally strong magnetic fields, similar to sunspots, and they can generate photometric brightness modulations. To deduce stellar and spot properties, such as spot emergence and decay rates, we…
The challenge of mastering computational tasks of enormous size tends to frequently override questioning the quality of the numerical outcome in terms of accuracy. By this we do not mean the accuracy within the discrete setting, which…
We study the problem of supervised learning a metric space under discriminative constraints. Given a universe $X$ and sets ${\cal S}, {\cal D}\subset {X \choose 2}$ of similar and dissimilar pairs, we seek to find a mapping $f:X\to Y$, into…
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…
Correspondence selection aiming at seeking correct feature correspondences from raw feature matches is pivotal for a number of feature-matching-based tasks. Various 2D (image) correspondence selection algorithms have been presented with…
This is basically a review of the field of Quasi-Monte Carlo intended for computational physicists and other potential users of quasi-random numbers. As such, much of the material is not new, but is presented here in a style hopefully more…
Adders are key building blocks of many error-tolerant applications. Leveraging the application-level error tolerance, a number of approximate adders were proposed recently. Many of them belong to the category of block-based approximate…
Estimating errors is a crucial part of any scientific analysis. Whenever a parameter is estimated (model-based or not), an error estimate is necessary. Any parameter estimate that is given without an error estimate is meaningless.…
In this paper we introduce a measure of genuine quantum incompatibility in the estimation task of multiple parameters, that has a geometric character and is backed by a clear operational interpretation. This measure is then applied to some…
We show how to increase the accuracy of estimates of the two-point correlation function without sacrificing efficiency. We quantify the error of the pair-counts and of the Landy-Szalay estimator by comparing them with exact reference…