{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/on-scalable-testing-of-samplers","title":"On Scalable Testing of Samplers","arxiv_id":"2306.13958","date":"2023-06-24","proceeding":null,"authors":["Yash Pote","Kuldeep S. Meel"],"abstract":"In this paper we study the problem of testing of constrained samplers over high-dimensional distributions with $(\\varepsilon,\\eta,\\delta)$ guarantees. Samplers are increasingly used in a wide range of safety-critical ML applications, and hence the testing problem has gained importance. For $n$-dimensional distributions, the existing state-of-the-art algorithm, $\\mathsf{Barbarik2}$, has a worst case query complexity of exponential in $n$ and hence is not ideal for use in practice. Our primary contribution is an exponentially faster algorithm that has a query complexity linear in $n$ and hence can easily scale to larger instances. We demonstrate our claim by implementing our algorithm and then comparing it against $\\mathsf{Barbarik2}$. Our experiments on the samplers $\\mathsf{wUnigen3}$ and $\\mathsf{wSTS}$, find that $\\mathsf{Barbarik3}$ requires $10\\times$ fewer samples for $\\mathsf{wUnigen3}$ and $450\\times$ fewer samples for $\\mathsf{wSTS}$ as compared to $\\mathsf{Barbarik2}$.","url_abs":"https://arxiv.org/abs/2306.13958v1","url_pdf":"https://arxiv.org/pdf/2306.13958v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"on-scalable-testing-of-samplers","repo_url":"https://github.com/meelgroup/barbarik","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2306.13958","atlas_url":"https://app.syntology.ai/?focus=2306.13958","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13958"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/meelgroup/barbarik","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"8c559c43cd919b1d","entry":"getSolutionFromCustomSampler","repo":"meelgroup/barbarik","repo_kind":"official","path":"interfaces/cnf.py","file_url":"https://github.com/meelgroup/barbarik/blob/HEAD/interfaces/cnf.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8c559c43cd919b1d"}},{"code_sha256_prefix":"45fb206ad9bb26cf","entry":"get_sampler_string","repo":"meelgroup/barbarik","repo_kind":"official","path":"interfaces/cnf.py","file_url":"https://github.com/meelgroup/barbarik/blob/HEAD/interfaces/cnf.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"45fb206ad9bb26cf"}},{"code_sha256_prefix":"7f80c7627ca9fc3d","entry":"parseIndSupport","repo":"meelgroup/barbarik","repo_kind":"official","path":"interfaces/cnf.py","file_url":"https://github.com/meelgroup/barbarik/blob/HEAD/interfaces/cnf.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7f80c7627ca9fc3d"}},{"code_sha256_prefix":"2c81d3c4bfa4241b","entry":"random_assignment","repo":"meelgroup/barbarik","repo_kind":"official","path":"WAPS/waps.py","file_url":"https://github.com/meelgroup/barbarik/blob/HEAD/WAPS/waps.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2c81d3c4bfa4241b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}