{"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/one-shot-generation-of-near-optimal-topology","title":"One-Shot Generation of Near-Optimal Topology through Theory-Driven Machine Learning","arxiv_id":"1807.10787","date":"2018-07-27","proceeding":null,"authors":["Ruijin Cang","Hope Yao","Yi Ren"],"abstract":"We introduce a theory-driven mechanism for learning a neural network model\nthat performs generative topology design in one shot given a problem setting,\ncircumventing the conventional iterative process that computational design\ntasks usually entail. The proposed mechanism can lead to machines that quickly\nresponse to new design requirements based on its knowledge accumulated through\npast experiences of design generation. Achieving such a mechanism through\nsupervised learning would require an impractically large amount of\nproblem-solution pairs for training, due to the known limitation of deep neural\nnetworks in knowledge generalization. To this end, we introduce an interaction\nbetween a student (the neural network) and a teacher (the optimality conditions\nunderlying topology optimization): The student learns from existing data and is\ntested on unseen problems. Deviation of the student's solutions from the\noptimality conditions is quantified, and used for choosing new data points to\nlearn from. We call this learning mechanism \"theory-driven\", as it explicitly\nuses domain-specific theories to guide the learning, thus distinguishing itself\nfrom purely data-driven supervised learning. We show through a compliance\nminimization problem that the proposed learning mechanism leads to topology\ngeneration with near-optimal structural compliance, much improved from standard\nsupervised learning under the same computational budget.","url_abs":"http://arxiv.org/abs/1807.10787v3","url_pdf":"http://arxiv.org/pdf/1807.10787v3.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":"one-shot-generation-of-near-optimal-topology","repo_url":"https://github.com/DesignInformaticsLab/Theory_Driven_TO","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"}],"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":"DesignInformaticsLab/Theory_Driven_TO","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":"ad3bde8b8e25b39f0ef36d11710d24f058dc93cacade8020e010094df0605697","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}