Related papers: Combining parameter values or $p$-values
The theory of belief functions manages uncertainty and also proposes a set of combination rules to aggregate opinions of several sources. Some combination rules mix evidential information where sources are independent; other rules are…
We present a method for storing multiple models within a single set of parameters. Models can coexist in superposition and still be retrieved individually. In experiments with neural networks, we show that a surprisingly large number of…
Methods for measuring the weak value of non local variables are investigated. We analyze local (indirect) measurement methods for obtaining the weak values. We also describe some new (direct) methods (Non local weak measurements) for…
We introduce a joint posterior $p$-value, an extension of the posterior predictive $p$-value for multiple test statistics, designed to address limitations of existing Bayesian $p$-values in the setting of continuous model expansion. In…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Some recent attempts at measuring non local weak values via local measurements are discussed and shown to be less robust than standard weak measurements. A method for measuring some non local weak values via non local measurements (non…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
Measurements are shown to be processes designed to return figures: they are effective. This effectivity allows for a formalization as Turing machines, which can be described employing computation theory. Inspired in the halting problem we…
Bivariate P-polynomial association scheme of type $(\alpha,\beta)$ are defined as a generalization of the P-polynomial association schemes. This generalization is shown to be equivalent to a set of conditions on the intersection parameters.…
We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…
Definitions and notations with historical references are given for some numerical coefficients commonly used to quantify relations among collections of objects for the purpose of expressing approximate knowledge and probabilistic reasoning.
We prove the cyclic sum formulas for certain two-parameter multiple series. These are new and non-trivial generalizations of the cyclic sum formulas for multiple zeta values and multiple zeta-star values.
We introduce a new type of means. It is new in two ways: its domain consists of sets and its values are sets too. We investigate the properties and behavior of such generalization. We also present many naturally arisen examples for such…
Measurement system analysis aims to quantify the variability in data attributable to the measurement system and evaluate its contribution to overall data variability. This paper conducts a rigorous theoretical investigation of the…
Subjective assessment tests are often employed to evaluate image processing systems, notably image and video compression, super-resolution among others and have been used as an indisputable way to provide evidence of the performance of an…
Permutation tests enable testing statistical hypotheses in situations when the distribution of the test statistic is complicated or not available. In some situations, the test statistic under investigation is multivariate, with the multiple…
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and…