English
Related papers

Related papers: An impossibility result for process discrimination

200 papers

Recently, it has been emphasized that the possibility theory framework allows us to distinguish between i) what is possible because it is not ruled out by the available knowledge, and ii) what is possible for sure. This distinction may be…

Artificial Intelligence · Computer Science 2013-01-07 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

In observational studies of discrimination, the most common statistical approaches consider either the rate at which decisions are made (benchmark tests) or the success rate of those decisions (outcome tests). Both tests, however, have…

Applications · Statistics 2025-03-07 Johann D. Gaebler , Sharad Goel

Recent frameworks describing quantum mechanics in the absence of a global causal order admit the existence of causally indefinite processes, where it is impossible to ascribe causal order for events A and B. These frameworks even allow for…

Quantum Physics · Physics 2021-05-11 Simon Milz , Dominic Jurkschat , Felix A. Pollock , Kavan Modi

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

Computational Complexity · Computer Science 2014-04-08 Kousha Etessami , Alistair Stewart , Mihalis Yannakakis

Given independent random variables $Y_1, \ldots, Y_n$ with $Y_i \in \{0,1\}$ we test the hypothesis whether the underlying success probabilities $p_i$ are constant or whether they are periodic with an unspecified period length of $r \ge 2$.…

Statistics Theory · Mathematics 2024-10-15 Finn Schmidtke , Mathias Vetter

It has long been noticed that high dimension data exhibits strange patterns. This has been variously interpreted as either a "blessing" or a "curse", causing uncomfortable inconsistencies in the literature. We propose that these patterns…

Computer Vision and Pattern Recognition · Computer Science 2020-03-18 Wen-Yan Lin

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

Information Theory · Computer Science 2018-12-07 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We consider the problem of distributed binary hypothesis testing of two sequences that are generated by an i.i.d. doubly-binary symmetric source. Each sequence is observed by a different terminal. The two hypotheses correspond to different…

Information Theory · Computer Science 2018-01-03 Eli Haim , Yuval Kochman

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer $B \geq 2$, there is a set of jobs to be processed by a single processor subject to the…

Data Structures and Algorithms · Computer Science 2017-03-03 An Zhang , Yong Chen , Lin Chen , Guangting Chen

We pose causal inference as the problem of learning to classify probability distributions. In particular, we assume access to a collection $\{(S_i,l_i)\}_{i=1}^n$, where each $S_i$ is a sample drawn from the probability distribution of $X_i…

Machine Learning · Statistics 2015-05-20 David Lopez-Paz , Krikamol Muandet , Bernhard Schölkopf , Ilya Tolstikhin

We consider records and sequences of records drawn from discrete time series of the form $X_{n}=Y_{n}+cn$, where the $Y_{n}$ are independent and identically distributed random variables and $c$ is a constant drift. For very small and very…

Statistical Mechanics · Physics 2015-05-19 Jasper Franke , Gregor Wergen , Joachim Krug

Let $\{X_n\}_{n=0}^{\infty}$ be a stationary real-valued time series with unknown distribution. Our goal is to estimate the conditional expectation of $X_{n+1}$ based on the observations $X_i$, $0\le i\le n$ in a strongly consistent way.…

Probability · Mathematics 2008-06-19 G. Morvai , B. Weiss

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…

Logic in Computer Science · Computer Science 2014-06-03 Tony Tan , Jan Van den Bussche , Xiaowang Zhang

Suppose that we are interested in the average causal effect of a binary treatment on an outcome when this relationship is confounded by a binary confounder. Suppose that the confounder is unobserved but a nondifferential proxy of it is…

Methodology · Statistics 2020-08-25 Jose M. Peña

Binary classification models which can assign probabilities to categories such as "the tissue is 75% likely to be tumorous" or "the chemical is 25% likely to be toxic" are well understood statistically, but their utility as an input to…

Applications · Statistics 2017-12-05 Damjan Krstajic , Ljubomir Buturovic , Simon Thomas , David E Leahy

We give a sufficient condition for a random sequence in [0,1] generated by a $\Psi$-process to be equidistributed. The condition is met by the canonical example -- the $\max$-2 process -- where the $n$th term is whichever of two uniformly…

Probability · Mathematics 2015-09-08 Matthew Junge

We consider univariate regression estimation from an individual (non-random) sequence $(x_1,y_1),(x_2,y_2), ... \in \real \times \real$, which is stable in the sense that for each interval $A \subseteq \real$, (i) the limiting relative…

Probability · Mathematics 2008-06-19 Gusztav Morvai , Sanjeev R. Kulkarni , Andrew B. Nobel

In the paper "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities" to appear in TCS, we present a comparison of behavioral equivalences for nondeterministic and probabilistic processes. In particular,…

Logic in Computer Science · Computer Science 2013-12-13 Marco Bernardo , Rocco De Nicola , Michele Loreti

In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and…

Computer Science and Game Theory · Computer Science 2019-04-10 László Csató