{"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/unveiling-the-optimization-process-of-physics","title":"Unveiling the optimization process of Physics Informed Neural Networks: How accurate and competitive can PINNs be?","arxiv_id":"2405.04230","date":"2024-05-07","proceeding":null,"authors":["Jorge F. Urbán","Petros Stefanou","José A. Pons"],"abstract":"This study investigates the potential accuracy boundaries of physics-informed neural networks, contrasting their approach with previous similar works and traditional numerical methods. We find that selecting improved optimization algorithms significantly enhances the accuracy of the results. Simple modifications to the loss function may also improve precision, offering an additional avenue for enhancement. Despite optimization algorithms having a greater impact on convergence than adjustments to the loss function, practical considerations often favor tweaking the latter due to ease of implementation. On a global scale, the integration of an enhanced optimizer and a marginally adjusted loss function enables a reduction in the loss function by several orders of magnitude across diverse physical problems. Consequently, our results obtained using compact networks (typically comprising 2 or 3 layers of 20-30 neurons) achieve accuracies comparable to finite difference schemes employing thousands of grid points. This study encourages the continued advancement of PINNs and associated optimization techniques for broader applications across various fields.","url_abs":"https://arxiv.org/abs/2405.04230v3","url_pdf":"https://arxiv.org/pdf/2405.04230v3.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":"unveiling-the-optimization-process-of-physics","repo_url":"https://github.com/jorgeurban/self_scaled_algorithms_pinns","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2405.04230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04230"}},"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/jorgeurban/self_scaled_algorithms_pinns","reach":null}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":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":3,"samples":[{"code_sha256_prefix":"79e49cdf26077cec","entry":"minimize","repo":"jorgeurban/self_scaled_algorithms_pinns","repo_kind":"official","path":"modified_minimize.py","file_url":"https://github.com/jorgeurban/self_scaled_algorithms_pinns/blob/HEAD/modified_minimize.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"79e49cdf26077cec"}},{"code_sha256_prefix":"14a68a19518281b5","entry":"minimize_scalar","repo":"jorgeurban/self_scaled_algorithms_pinns","repo_kind":"official","path":"modified_minimize.py","file_url":"https://github.com/jorgeurban/self_scaled_algorithms_pinns/blob/HEAD/modified_minimize.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"14a68a19518281b5"}},{"code_sha256_prefix":"3702488fea557210","entry":"standardize_bounds","repo":"jorgeurban/self_scaled_algorithms_pinns","repo_kind":"official","path":"modified_minimize.py","file_url":"https://github.com/jorgeurban/self_scaled_algorithms_pinns/blob/HEAD/modified_minimize.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"3702488fea557210"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}