相关论文: Approximation Resistant Predicates From Pairwise I…

We propose a safe approximation to joint chance-constrained programming where the constraint functions are additively dependent on a normally-distributed random vector. The approximation is analytical, meaning that it requires neither…

Coherent sets of almost desirable gambles and credal sets are known to be equivalent models. That is, there exists a bijection between the two collections of sets preserving the usual operations, e.g. conditioning. Such a correspondence is…

Inapproximability results for $\mathsf{Max\,k\,CSP\!-\!q}$ have been traditionally established using balanced $t$-wise independent distributions, which are closely related to orthogonal arrays, a famous family of combinatorial designs. In…

In this paper we show that the continuum time version of the Minority Game satisfies the criteria for the application of a theorem on the existence of an invariant measure. We consider the special case of a game with "sufficiently"…

Object counting models suffer when deployed across domains with differing density variety, since density shifts are inherently task-relevant and violate standard domain adaptation assumptions. To address this, we propose a theoretical…

We study the adversarial binary hypothesis testing problem in the sequential setting. Associated with each hypothesis is a closed, convex set of distributions. Given the hypothesis, each observation is generated according to a distribution…

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results…

Suppose we are given the conditional probability of one variable given some other variables.Normally the full joint distribution over the conditioning variablesis required to determine the probability of the conditioned variable.Under what…

We investigate conditions for the existence of the limiting conditional distribution of a bivariate random vector when one component becomes large. We revisit the existing literature on the topic, and present some new sufficient conditions.…

Similarity judgments provide a well-established method for accessing mental representations, with applications in psychology, neuroscience and machine learning. However, collecting similarity judgments can be prohibitively expensive for…

We consider the problems of hypothesis testing on a probability measure of independent sample, on solution of ill-posed problem, on deconvolution problem and on Poisson mean measure. For all these setups necessary conditions and sufficient…

Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a…

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve…

Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such…

Conditional specification of distributions is a developing area with many applications. In the finite discrete case, a variety of compatible conditions can be derived. In this paper, we propose an alternative approach to study the…

We study decision rule approximations for generic multi-stage robust linear optimization problems. We consider linear decision rules for the case when the objective coefficients, the recourse matrices, and the right-hand sides are…

One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…

We show that the problem of finding an {\epsilon}-approximate Nash equilibrium in an anonymous game with seven pure strategies is complete in PPAD, when the approximation parameter {\epsilon} is exponentially small in the number of players.

We investigate the inverse problem of identifying a conditional probability measure in a measure-dependent dynamical system. We provide existence and well-posedness results and outline a discretization scheme for approximating a measure.…