Beating noise with abstention in state estimation

We address the problem of estimating pure qubit states with non-ideal (noisy) measurements in the multiple-copy scenario, where the data consists of a number N of identically prepared qubits. We show that the average fidelity of the estimates can increase significantly if the estimation protocol allows for inconclusive answers, or abstentions. We present the optimal such protocol and compute its fidelity for a given probability of abstention. The improvement over standard estimation, without abstention, can be viewed as an effective noise reduction. These and other results are exemplified for small values of N. For asymptotically large N, we derive analytical expressions of the fidelity and the probability of abstention, and show that for a fixed fidelity gain the latter decreases with N at an exponential rate given by a Kulback-Leibler (relative) entropy. As a byproduct, we obtain an asymptotic expression in terms of this very entropy of the probability that a system of N qubits, all prepared in the same state, has a given total angular momentum. We also discuss an extreme situation where noise increases with N and where estimation with abstention provides a most significant improvement as compared to the standard approach

Constitutional Law: Limitations Imposed on Traditional Use of Doctrine of Federal Judicial Abstention

The Supreme Court held that federal judicial abstention may be inappropriate where violation of first amendment rights results from threatened state criminal proceedings brought under vague statutes or where bad faith prosecutions give rise to a claim under the Civil Rights Act. In order to provide immediate federal court protection in either of these situations, the Court has had to further erode the traditional policy bases underlying the doctrine of abstention

Sequential Voting with Abstention

Dekel and Piccione (2000) have proven that information cascades do not necessarily affect the properties of information aggregation in sequential elections: under standard conditions, any symmetric equilibrium of a simultaneous voting mechanism is also an equilibrium of the correspondent sequential mechanism. We show that when voters can abstain, these results are sensitive to the introduction of an arbitrarily small cost of voting: the set of equilibria in the two mechanisms are generally disjoint; and the informative properties of the equilibrium sets can be ranked. If an appropriate q-rule is chosen, when the cost of voting is small the unique symmetric equilibrium of the simultaneous voting mechanism dominates all equilibria of the sequential mechanism.

Active Learning from Imperfect Labelers

We study active learning where the labeler can not only return incorrect labels but also abstain from labeling. We consider different noise and abstention conditions of the labeler. We propose an algorithm which utilizes abstention responses, and analyze its statistical consistency and query complexity under fairly natural assumptions on the noise and abstention rate of the labeler. This algorithm is adaptive in a sense that it can automatically request less queries with a more informed or less noisy labeler. We couple our algorithm with lower bounds to show that under some technical conditions, it achieves nearly optimal query complexity.Comment: To appear in NIPS 201