{"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/superset-technique-for-approximate-recovery-1","title":"Superset Technique for Approximate Recovery in One-Bit Compressed Sensing","arxiv_id":"1910.13971","date":"2019-10-30","proceeding":null,"authors":["Larkin Flodin","Venkata Gandikota","Arya Mazumdar"],"abstract":"One-bit compressed sensing (1bCS) is a method of signal acquisition under extreme measurement quantization that gives important insights on the limits of signal compression and analog-to-digital conversion. The setting is also equivalent to the problem of learning a sparse hyperplane-classifier. In this paper, we propose a novel approach for signal recovery in nonadaptive 1bCS that matches the sample complexity of the current best methods. We construct 1bCS matrices that are universal - i.e. work for all signals under a model - and at the same time recover very general random sparse signals with high probability. In our approach, we divide the set of samples (measurements) into two parts, and use the first part to recover the superset of the support of a sparse vector. The second set of measurements is then used to approximate the signal within the superset. While support recovery in 1bCS is well-studied, recovery of superset of the support requires fewer samples, and to our knowledge has not been previously considered for the purpose of approximate recovery of signals.","url_abs":"https://arxiv.org/abs/1910.13971v3","url_pdf":"https://arxiv.org/pdf/1910.13971v3.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":"superset-technique-for-approximate-recovery-1","repo_url":"https://github.com/flodinl/neurips-1bCS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1910.13971","atlas_url":"https://app.syntology.ai/?focus=1910.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13971"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/flodinl/neurips-1bCS","reach":null}],"summary":{"ran_honours":2,"ran_violates":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":3,"samples":[{"code_sha256_prefix":"7f51f2e404be0cf0","entry":"gen_rand_bern_matrix","repo":"flodinl/neurips-1bCS","repo_kind":"official","path":"1bcs_experiments.py","file_url":"https://github.com/flodinl/neurips-1bCS/blob/HEAD/1bcs_experiments.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7f51f2e404be0cf0"}},{"code_sha256_prefix":"b68a1b6357d945f9","entry":"gen_rand_real_vector","repo":"flodinl/neurips-1bCS","repo_kind":"official","path":"1bcs_experiments.py","file_url":"https://github.com/flodinl/neurips-1bCS/blob/HEAD/1bcs_experiments.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b68a1b6357d945f9"}},{"code_sha256_prefix":"1f04fc7e3c3f441a","entry":"sign_measure","repo":"flodinl/neurips-1bCS","repo_kind":"official","path":"1bcs_experiments.py","file_url":"https://github.com/flodinl/neurips-1bCS/blob/HEAD/1bcs_experiments.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1f04fc7e3c3f441a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}