EquivTester Samples In Equivalence Testing Algorithm

Written by computational | Published 2024/12/09
Tech Story Tags: statistics | equivalence-testing | software-testing-method | algorithm-design | parallel-computing | adaptive-testing | one-round-adaptive | query-efficiency

TLDRThe article takes an example of an EquivTester algorithm and how to convert it into a one-round algorithm, using the COND model.via the TL;DR App

Authors:

(1) Diptarka Chakraborty, National University of Singapore, Singapore

(2) Sourav Chakraborty, Indian Statistical Institute, Kolkata;

(3) Gunjan Kumar, National University of Singapore, Singapore;

(4) Kuldeep S. Meel, University of Toronto, Toronto.

Table of Links

Abstract and 1 Introduction

2 Notations and Preliminaries

3 Related Work

4 An Efficient One-Round Adaptive Algorithm and 4.1 High-Level Overview

4.2 Algorithm Description

4.3 Technical Analysis

5 Conclusion

6 Acknowledgements and References

A Missing Proofs

B An O(log log n)-query fully adaptive algorithm

4.2 Algorithm Description

Our algorithm, EquivTester, takes as input, two distributions P and Q, and a parameter ε > 0. It returns Accept if P = Q and Reject if their total variation distance dT V (P, Q) is greater than ε, both with at least 2/3 probability.

This paper is available on arxiv under CC BY-NC-SA 4.0 DEED license.


Written by computational | Computational: We take random inputs, follow complex steps, and hope the output makes sense. And then blog about it.
Published by HackerNoon on 2024/12/09