Testing Closeness of Discrete Distributions

Author:

Batu Tuğkan1,Fortnow Lance2,Rubinfeld Ronitt3,Smith Warren D.4,White Patrick

Affiliation:

1. London School of Economics and Political Science

2. Northwestern University

3. Massachusetts Institute of Technology and Tel Aviv University

4. Center for Range Voting

Abstract

Given samples from two distributions over an n -element set, we wish to test whether these distributions are statistically close. We present an algorithm which uses sublinear in n , specifically, O ( n 2/3 ε −8/3 log n ), independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the distributions is small (less than { ε 4/3 n −1/3 /32, εn −1/2 /4}) or large (more than ε ) in ℓ 1 distance. This result can be compared to the lower bound of Ω ( n 2/3 ε −2/3 ) for this problem given by Valiant [2008]. Our algorithm has applications to the problem of testing whether a given Markov process is rapidly mixing. We present sublinear algorithms for several variants of this problem as well.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference57 articles.

1. Aho A. V. Hopcroft J. E. and Ullman J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley. Aho A. V. Hopcroft J. E. and Ullman J. D. 1974. The Design and Analysis of Computer Algorithms . Addison-Wesley.

2. Eigenvalues and expanders

3. Alon N. Matias Y. and Szegedy M. 1999b. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58. 10.1006/jcss.1997.1545 Alon N. Matias Y. and Szegedy M. 1999b. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58 . 10.1006/jcss.1997.1545

Cited by 45 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs;Random Structures & Algorithms;2023-06-28

2. Evaluation of Categorical Generative Models - Bridging the Gap Between Real and Synthetic Data;ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2023-06-04

3. Generalized LRS Estimator for Min-Entropy Estimation;IEEE Transactions on Information Forensics and Security;2023

4. Quantum approximate counting for Markov chains and collision counting;Quantum Information and Computation;2022-11

5. Analysis of COVID-19 evolution based on testing closeness of sequential data;Japanese Journal of Statistics and Data Science;2022-01-29

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3