Strength of statistical evidence for genuine tripartite nonlocality

• URL: http://arxiv.org/abs/2407.19587v1
• Date: Sun, 28 Jul 2024 21:12:52 GMT
• Title: Strength of statistical evidence for genuine tripartite nonlocality
• Authors: Soumyadip Patra, Peter Bierhorst,
• Abstract summary: Recent advancements in network nonlocality have led to the concept of local operations and shared randomness-based genuine multipartite nonlocality (LOSR-GMNL) This paper focuses on a tripartite scenario where the goal is to exhibit correlations impossible in a network where each two-party subset shares bipartite resources and every party has access to unlimited shared randomness.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent advancements in network nonlocality have led to the concept of local operations and shared randomness-based genuine multipartite nonlocality (LOSR-GMNL). In this paper, we consider two recent experimental demonstrations of LOSR-GMNL, focusing on a tripartite scenario where the goal is to exhibit correlations impossible in a network where each two-party subset shares bipartite resources and every party has access to unlimited shared randomness. Traditional statistical analyses measuring violations of witnessing inequalities by the number of experimental standard deviations do not account for subtleties such as memory effects. We demonstrate a more sound method based on the prediction-based ratio (PBR) protocol to analyse finite experimental data and quantify the strength of evidence in favour of genuine tripartite nonlocality in terms of a valid $p$-value. In our work, we propose an efficient modification of the test factor optimisation using an approximating polytope approach. By justifying a further restriction to a smaller polytope we enhance practical feasibility while maintaining statistical rigour.

Related papers

• STATE: A Robust ATE Estimator of Heavy-Tailed Metrics for Variance Reduction in Online Controlled Experiments [22.32661807469984]
  We develop a novel framework that integrates the Student's t-distribution with machine learning tools to fit heavy-tailed metrics. By adopting a variational EM method to optimize the loglikehood function, we can infer a robust solution that greatly eliminates the negative impact of outliers. Both simulations on synthetic data and long-term empirical results on Meituan experiment platform demonstrate the effectiveness of our method.
  arXiv  Detail & Related papers  (2024-07-23T09:35:59Z)
• A Stability Principle for Learning under Non-Stationarity [1.1510009152620668]
  We develop a versatile framework for statistical learning in non-stationary environments. At the heart of our analysis lie two novel components: a measure of similarity between functions and a segmentation technique for dividing the non-stationary data sequence into quasi-stationary pieces.
  arXiv  Detail & Related papers  (2023-10-27T17:53:53Z)
• Improved Policy Evaluation for Randomized Trials of Algorithmic Resource Allocation [54.72195809248172]
  We present a new estimator leveraging our proposed novel concept, that involves retrospective reshuffling of participants across experimental arms at the end of an RCT. We prove theoretically that such an estimator is more accurate than common estimators based on sample means.
  arXiv  Detail & Related papers  (2023-02-06T05:17:22Z)
• Null Hypothesis Test for Anomaly Detection [0.0]
  We extend the use of Classification Without Labels for anomaly detection with a hypothesis test designed to exclude the background-only hypothesis. By testing for statistical independence of the two discriminating dataset regions, we are able exclude the background-only hypothesis without relying on fixed anomaly score cuts or extrapolations of background estimates between regions.
  arXiv  Detail & Related papers  (2022-10-05T13:03:55Z)
• Causal Balancing for Domain Generalization [95.97046583437145]
  We propose a balanced mini-batch sampling strategy to reduce the domain-specific spurious correlations in observed training distributions. We provide an identifiability guarantee of the source of spuriousness and show that our proposed approach provably samples from a balanced, spurious-free distribution.
  arXiv  Detail & Related papers  (2022-06-10T17:59:11Z)
• A Unified Framework for Multi-distribution Density Ratio Estimation [101.67420298343512]
  Binary density ratio estimation (DRE) provides the foundation for many state-of-the-art machine learning algorithms. We develop a general framework from the perspective of Bregman minimization divergence. We show that our framework leads to methods that strictly generalize their counterparts in binary DRE.
  arXiv  Detail & Related papers  (2021-12-07T01:23:20Z)
• Experimentally friendly approach towards nonlocal correlations in multisetting N -partite Bell scenarios [0.0]
  We study a recently proposed operational measure of nonlocality by Fonseca and Parisio[Phys. A 92, 03(R)] which describes the probability of violation of local realism under randomly sampled observables. We show that even with both a randomly chosen $N$-qubit pure state and randomly chosen measurement bases, a violation of local realism can be detected experimentally almost $100%$ of the time.
  arXiv  Detail & Related papers  (2020-09-24T13:54:44Z)
• A One-step Approach to Covariate Shift Adaptation [82.01909503235385]
  A default assumption in many machine learning scenarios is that the training and test samples are drawn from the same probability distribution. We propose a novel one-step approach that jointly learns the predictive model and the associated weights in one optimization.
  arXiv  Detail & Related papers  (2020-07-08T11:35:47Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.