NDLI: On Sample-Based Testers

Please wait, while we are loading the content...

On Sample-Based Testers

Content Provider	ACM Digital Library
Author	Ron, Dana Goldreich, Oded
Copyright Year	2016
Abstract	The standard definition of property testing endows the tester with the ability to make arbitrary queries to “elements” of the tested object. In contrast, sample-based testers only obtain independently distributed elements (a.k.a. labeled samples) of the tested object. While sample-based testers were defined by Goldreich, Goldwasser, and Ron $(\textit{JACM}$ 1998), with few exceptions, most research in property testing has focused on query-based testers. In this work, we advance the study of sample-based property testers by providing several general positive results as well as by revealing relations between variants of this testing model. In particular: —We show that certain types of query-based testers yield sample-based testers of sublinear sample complexity. For example, this holds for a natural class of proximity oblivious testers. —We study the relation between distribution-free sample-based testers and one-sided error sample-based testers w.r.t. the uniform distribution. While most of this work ignores the time complexity of testing, one part of it does focus on this aspect. The main result in this part is a $sublinear-\textit{time}$ sample-based tester, in the dense graphs model, for $\textit{k}-colorability,$ for any $\textit{k}$ ⩾ 2.
Starting Page	1
Ending Page	54
Page Count	54
File Format	PDF
ISSN	19423454
e-ISSN	19423462
DOI	10.1145/2898355
Volume Number	8
Issue Number	2
Journal	ACM Transactions on Computation Theory (TOCT)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-04-25
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Property Testing Sampling
Content Type	Text
Resource Type	Article
Subject	Computational Theory and Mathematics Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On The Randomness Complexity of Property Testing

On Sample-Based Testers

On Approximating the Number of Relevant Variables in a Function

Quadratic Maps Are Hard to Sample

Probabilistic abstraction for model checking: An approach based on property testing

Testing Read-Once Formula Satisfaction

Characterizing Arithmetic Read-Once Formulae

Functional test generation based on unate function theory

Space Complexity Vs. Query Complexity

On Sample-Based Testers

Similar Documents

On The Randomness Complexity of Property Testing

On Sample-Based Testers

On Approximating the Number of Relevant Variables in a Function

Quadratic Maps Are Hard to Sample

Probabilistic abstraction for model checking: An approach based on property testing

Testing Read-Once Formula Satisfaction

Characterizing Arithmetic Read-Once Formulae

Functional test generation based on unate function theory

Space Complexity Vs. Query Complexity

On Sample-Based Testers