Related papers: On the strict comparison theorem for $G$-expectati…
As machine learning applications grow increasingly ubiquitous and complex, they face an increasing set of requirements beyond accuracy. The prevalent approach to handle this challenge is to aggregate a weighted combination of requirement…
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…
The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.
This paper builds on no-go theorems to the effect that quantum theory is inconsistent with observations being absolute; that is, unique and non-relative. Unlike the existing no-go results, the one introduced here is based on a…
We propose a new and rather stringent criterion for testing the goodness of fit between a theory and experiment. It is motivated by the paradox that the criterion on \chi^2 for testing a theory is much weaker than the criterion for finding…
After an elementary derivation of Bell's inequality, several forms of expectation functions for two-valued observables are discussed. Special emphasis is given to hypothetical stronger-than quantum expectation functions which give rise to a…
This paper deals with strong invariance principles (known also as strong approximation theorems) for sums of the form $\sum_{n=1}^{[Nt]}F\big(X(n),X(2n),...,X(kn), X(q_{k+1}(n)),X(q_{k+2}(n)),..., X(q_\ell(n))\big)$
The combined universal probability $\mathbf{m}(D)$ of strings $x$ in sets $D$ is close to max $\mathbf{m}(x)$ over $x$ in $D$: their logs differ by at most $D$'s information $\mathbf{I}(D:\mathcal{H})$ about the halting sequence…
We address the problem of extractive question answering using document-level distant super-vision, pairing questions and relevant documents with answer strings. We compare previously used probability space and distant super-vision…
In this paper, we formulate and prove linear analogues of results concerning matchings in groups. A matching in a group G is a bijection f between two finite subsets A,B of G with the property, motivated by old questions on symmetric…
We show that a recent observation by Yan leads to a method to experimentally test whether a higher-than-quantum violation of the Clauser-Horne-Shimony-Holt Bell inequality is possible (assuming that the sum of probabilities of pairwise…
In this work, we investigate the question of how knowledge about expectations $\mathbb{E}(f_i(X))$ of a random vector $X$ translate into inequalities for $\mathbb{E}(g(X))$ for given functions $f_i$, $g$ and a random vector $X$ whose…
We provides some useful estimates for solving martingale representation problem under G-expectations. We also study the corresponding conditions for the existence and uniqueness.
The conformal crossing equation puts very stringent constraints on the conformal data. We formulate it in way that makes the conformal symmetry more transparent. This allows for generalization of the crossing equation to arbitrary Lie group…
This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation,…
In this paper we consider a sequence of random variables with mean uncertainty in a sublinear expectation space. Without the hypothesis of identical distributions, we show a new central limit theorem under the sublinear expectations.
In this paper, we obtain a comparison theorem and a invariant representation theorem for backward stochastic differential equations (BSDEs) without any assumption on the second variable $z$. Using the two results, we further develop the…
We study sets $E(\Sigma,q)=\left\{\sum_{i=1}^\infty \sigma_iq^i\colon(\sigma_i)\in\Sigma^{\mathbb N}\right\}$ for a finite set $\Sigma\subset \mathbb R$ and $q\in(0,1)$. Under the assumption $q|\Sigma|=1$ we prove several new equivalent…
We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…
The multinomial model is one of the simplest statistical models. When constraints are placed on the possible values for the probabilities, however, it becomes much more difficult to deal with. Model checking and checking for prior-data…