相关论文: Compound conditionals, Fr\'echet-Hoeffding bounds,…

This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T…

This paper develops a unified identification framework for counterfactual analysis in incomplete models characterized by support and moment restrictions. I demonstrate that identifying structural parameters and conducting counterfactual…

The Jordan structure of finite-dimensional quantum theory is derived, in a conspicuously easy way, from a few simple postulates concerning abstract probabilistic models (each defined by a set of basic measurements and a convex set of…

In this work, we consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on…

In this paper, we investigate direct solution of FRE and compare their results with expected real consequences. We give an applied example formulated by a FRE problem and show that FRE defined by maximum t-conorm and an arbitrary t-norm can…

Particularly in genomics, but also in other fields, it has become commonplace to undertake highly multiple Student's $t$-tests based on relatively small sample sizes. The literature on this topic is continually expanding, but the main…

We obtain analytical lower bounds on the concurrence of bipartite quantum systems in arbitrary dimensions related to the violation of separability conditions based on local uncertainty relations and on the Bloch representation of density…

The Complex Langevin (CL) method to simulate `complex probabilities', ideally produces expectation values for the observables that converge to a limit equal to the expectation values obtained with the original complex `probability' measure.…

In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…

In this paper we consider a class of conjugate equations, which generalizes de Rham's functional equations. We give sufficient conditions for existence and uniqueness of solutions under two different series of assumptions. We consider…

Causal inference is known to be very challenging when only observational data are available. Randomized experiments are often costly and impractical and in instrumental variable regression the number of instruments has to exceed the number…

In this study, Devaney's chaos conditions are revisited within the framework of descriptive proximity. The concepts of descriptive transitivity, the density of descriptive periodic objects, and descriptive sensitivity are defined. The most…

Incorporating constraints is a major concern in probabilistic machine learning. A wide variety of problems require predictions to be integrated with reasoning about constraints, from modelling routes on maps to approving loan predictions.…

Univalent functions are complex, analytic (holomorphic) and injective functions that have been widely discussed in complex analysis. It was recently proposed that the stringent constraints that univalence imposes on the growth of functions…

For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

The Theory of Functional Connections (TFC) is a functional interpolation framework founded upon the so-called constrained expression: a functional that expresses the family of all possible functions that satisfy some user-specified, linear…

While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that…

This article describes a robust algorithm to estimate a conditional probability density f(t|x) as a non-parametric smooth regression function. It is based on a neural network and the Bayesian interpretation of the network output as a…