{"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/solver-in-the-loop-learning-from","title":"Solver-in-the-Loop: Learning from Differentiable Physics to Interact with Iterative PDE-Solvers","arxiv_id":"2007.00016","date":"2020-06-30","proceeding":"NeurIPS 2020 12","authors":["Kiwon Um","Robert Brand","Yun","Fei","Philipp Holl","Nils Thuerey"],"abstract":"Finding accurate solutions to partial differential equations (PDEs) is a crucial task in all scientific and engineering disciplines. It has recently been shown that machine learning methods can improve the solution accuracy by correcting for effects not captured by the discretized PDE. We target the problem of reducing numerical errors of iterative PDE solvers and compare different learning approaches for finding complex correction functions. We find that previously used learning approaches are significantly outperformed by methods that integrate the solver into the training loop and thereby allow the model to interact with the PDE during training. This provides the model with realistic input distributions that take previous corrections into account, yielding improvements in accuracy with stable rollouts of several hundred recurrent evaluation steps and surpassing even tailored supervised variants. We highlight the performance of the differentiable physics networks for a wide variety of PDEs, from non-linear advection-diffusion systems to three-dimensional Navier-Stokes flows.","url_abs":"https://arxiv.org/abs/2007.00016v2","url_pdf":"https://arxiv.org/pdf/2007.00016v2.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":"solver-in-the-loop-learning-from","repo_url":"https://github.com/tum-pbs/Solver-in-the-Loop","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"solver-in-the-loop-learning-from","repo_url":"https://github.com/Ceyron/exponax","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"solver-in-the-loop-learning-from","repo_url":"https://github.com/tum-pbs/CG-Solver-in-the-Loop","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"solver-in-the-loop-learning-from","repo_url":"https://github.com/tum-pbs/PhiFlow","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2007.00016","atlas_url":"https://app.syntology.ai/?focus=2007.00016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00016"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.00016"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.00016"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.00016\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2007.00016"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2007.00016\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2007.00016"},"call":"get_concepts_for_paper(arxiv_id=\"2007.00016\")"}],"by_repo":[{"repo":"tum-pbs/Solver-in-the-Loop","kind":"official","samples":2,"ran":0,"instrument":0,"unverified":2},{"repo":"Ceyron/exponax","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2608.24547"],"harvested_for_calls":[{"arxiv_id":"2608.24547","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2608.24547"},"call":"get_harvested_code_for_paper(arxiv_id=\"2608.24547\")"}]},{"repo":"tum-pbs/CG-Solver-in-the-Loop","kind":"listed","samples":4,"ran":0,"instrument":0,"unverified":4},{"repo":"tum-pbs/PhiFlow","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.10131"],"harvested_for_calls":[{"arxiv_id":"2203.10131","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.10131"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.10131\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2007.00016.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2007.00016.svg"},"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/tum-pbs/PhiFlow","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/tum-pbs/Solver-in-the-Loop","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Ceyron/exponax","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tum-pbs/CG-Solver-in-the-Loop","reach":null}],"summary":{"unverified":6},"n_samples":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":2,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1},"listed":{"samples":4,"ran":0,"n_ran_checked":0,"n_instrument":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,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","census_is":"Syntology's function-name census ran implementations with this entry name on one shared input per bucket (the positional rank, kind and dtype of each array argument) and counted the distinct output digests (sha256 of the output rounded to 6 decimals). implementations and papers count the compared samples; distinct_outputs counts digests across all buckets; n_buckets is how many shared inputs were used. It is not a statement that any two samples compute one thing, and the name is a string, not an identity.","samples":[{"code_sha256":"d3de82e465406025","code_sha256_prefix":"d3de82e465406025","entry":"downsample4x","repo":"tum-pbs/Solver-in-the-Loop","repo_kind":"official","path":"karman-2d/karman.py","file_url":"https://github.com/tum-pbs/Solver-in-the-Loop/blob/HEAD/karman-2d/karman.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d3de82e465406025"}},{"code_sha256":"b23fcd97e5033eaa","code_sha256_prefix":"b23fcd97e5033eaa","entry":"downsample4xSMAC","repo":"tum-pbs/Solver-in-the-Loop","repo_kind":"official","path":"burgers-tf2/burgers.py","file_url":"https://github.com/tum-pbs/Solver-in-the-Loop/blob/HEAD/burgers-tf2/burgers.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b23fcd97e5033eaa"}},{"code_sha256":"302b08116ecaba59","code_sha256_prefix":"302b08116ecaba59","entry":"normalize","repo":"tum-pbs/CG-Solver-in-the-Loop","repo_kind":"listed","path":"nn/nn_supervised_v3.py","file_url":"https://github.com/tum-pbs/CG-Solver-in-the-Loop/blob/HEAD/nn/nn_supervised_v3.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/normalize","census":{"url":"/census/normalize","implementations":70,"papers":82,"distinct_outputs":51,"n_buckets":11,"bucket_key":null,"bucket_index":null,"bucket_label":null},"census_bucket_fragment":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"302b08116ecaba59"}},{"code_sha256":"8fe4282fff5ba204","code_sha256_prefix":"8fe4282fff5ba204","entry":"random_density","repo":"tum-pbs/CG-Solver-in-the-Loop","repo_kind":"listed","path":"nn/datagen_v3.py","file_url":"https://github.com/tum-pbs/CG-Solver-in-the-Loop/blob/HEAD/nn/datagen_v3.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8fe4282fff5ba204"}},{"code_sha256":"f9305478f0c57e4a","code_sha256_prefix":"f9305478f0c57e4a","entry":"random_velocity","repo":"tum-pbs/CG-Solver-in-the-Loop","repo_kind":"listed","path":"nn/datagen_v3.py","file_url":"https://github.com/tum-pbs/CG-Solver-in-the-Loop/blob/HEAD/nn/datagen_v3.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f9305478f0c57e4a"}},{"code_sha256":"d32638ed45551998","code_sha256_prefix":"d32638ed45551998","entry":"subtract_mean","repo":"tum-pbs/CG-Solver-in-the-Loop","repo_kind":"listed","path":"nn/nn_supervised_v3.py","file_url":"https://github.com/tum-pbs/CG-Solver-in-the-Loop/blob/HEAD/nn/nn_supervised_v3.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d32638ed45551998"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"01a0bf14067e1490dcf698e6bc43371627eb771f2739bf646cd5cdeeff7919e1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}