{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/selecting-representative-examples-for-program","title":"Selecting Representative Examples for Program Synthesis","arxiv_id":"1711.03243","date":"2017-11-09","proceeding":"ICML 2018 7","authors":["Yewen Pu","Zachery Miranda","Armando Solar-Lezama","Leslie Pack Kaelbling"],"abstract":"Program synthesis is a class of regression problems where one seeks a\nsolution, in the form of a source-code program, mapping the inputs to their\ncorresponding outputs exactly. Due to its precise and combinatorial nature,\nprogram synthesis is commonly formulated as a constraint satisfaction problem,\nwhere input-output examples are encoded as constraints and solved with a\nconstraint solver. A key challenge of this formulation is scalability: while\nconstraint solvers work well with a few well-chosen examples, a large set of\nexamples can incur significant overhead in both time and memory. We describe a\nmethod to discover a subset of examples that is both small and representative:\nthe subset is constructed iteratively, using a neural network to predict the\nprobability of unchosen examples conditioned on the chosen examples in the\nsubset, and greedily adding the least probable example. We empirically evaluate\nthe representativeness of the subsets constructed by our method, and\ndemonstrate such subsets can significantly improve synthesis time and\nstability.","url_abs":"http://arxiv.org/abs/1711.03243v3","url_pdf":"http://arxiv.org/pdf/1711.03243v3.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":"abstracts"},"code_links":[{"paper_slug":"selecting-representative-examples-for-program","repo_url":"https://github.com/evanthebouncy/icml2018_selecting_representative_examples","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"program-synthesis","task_name":"Program Synthesis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"evanthebouncy/icml2018_selecting_representative_examples","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1920b50aad2eb8ae739e6ab883425dfeeee03ff7da80c42b790f07b4c02239cc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}