{"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/amortized-synthesis-of-constrained","title":"Amortized Synthesis of Constrained Configurations Using a Differentiable Surrogate","arxiv_id":"2106.09019","date":"2021-06-16","proceeding":"NeurIPS 2021 12","authors":["Xingyuan Sun","Tianju Xue","Szymon Rusinkiewicz","Ryan P. Adams"],"abstract":"In design, fabrication, and control problems, we are often faced with the task of synthesis, in which we must generate an object or configuration that satisfies a set of constraints while maximizing one or more objective functions. The synthesis problem is typically characterized by a physical process in which many different realizations may achieve the goal. This many-to-one map presents challenges to the supervised learning of feed-forward synthesis, as the set of viable designs may have a complex structure. In addition, the non-differentiable nature of many physical simulations prevents efficient direct optimization. We address both of these problems with a two-stage neural network architecture that we may consider to be an autoencoder. We first learn the decoder: a differentiable surrogate that approximates the many-to-one physical realization process. We then learn the encoder, which maps from goal to design, while using the fixed decoder to evaluate the quality of the realization. We evaluate the approach on two case studies: extruder path planning in additive manufacturing and constrained soft robot inverse kinematics. We compare our approach to direct optimization of the design using the learned surrogate, and to supervised learning of the synthesis problem. We find that our approach produces higher quality solutions than supervised learning, while being competitive in quality with direct optimization, at a greatly reduced computational cost.","url_abs":"https://arxiv.org/abs/2106.09019v2","url_pdf":"https://arxiv.org/pdf/2106.09019v2.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":"amortized-synthesis-of-constrained","repo_url":"https://github.com/xingyuansun/amorsyn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"physical-simulations","task_name":"Physical Simulations"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.09019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09019"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/xingyuansun/amorsyn","reach":null}],"summary":{"ran":3,"ran_fixture":3,"ran_honours":1},"by_repo_kind":{"official":{"samples":7,"ran":7,"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":"c178a4353f51a3e1","entry":"AutoEncoder","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c178a4353f51a3e1"}},{"code_sha256_prefix":"614d82580b54bf8c","entry":"MLPModel","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"614d82580b54bf8c"}},{"code_sha256_prefix":"0e328896e1984b19","entry":"l2_dis","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0e328896e1984b19"}},{"code_sha256_prefix":"86e7593fd8c2f223","entry":"normalize_path_tensor","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"86e7593fd8c2f223"}},{"code_sha256_prefix":"175bbab87fe86568","entry":"rb_to_ratio","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"175bbab87fe86568"}},{"code_sha256_prefix":"aeb1590fd6e95aa7","entry":"resample","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"aeb1590fd6e95aa7"}},{"code_sha256_prefix":"c58e30e6cf9c4292","entry":"soft_robot_limit","repo":"xingyuansun/amorsyn","repo_kind":"official","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c58e30e6cf9c4292"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}