{"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/ps-dag-projected-stochastic-approximation","title":"$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning","arxiv_id":"2410.23862","date":"2024-10-31","proceeding":null,"authors":["Klea Ziu","Slavomír Hanzely","Loka Li","Kun Zhang","Martin Takáč","Dmitry Kamzolov"],"abstract":"Learning the structure of Directed Acyclic Graphs (DAGs) presents a significant challenge due to the vast combinatorial search space of possible graphs, which scales exponentially with the number of nodes. Recent advancements have redefined this problem as a continuous optimization task by incorporating differentiable acyclicity constraints. These methods commonly rely on algebraic characterizations of DAGs, such as matrix exponentials, to enable the use of gradient-based optimization techniques. Despite these innovations, existing methods often face optimization difficulties due to the highly non-convex nature of DAG constraints and the per-iteration computational complexity. In this work, we present a novel framework for learning DAGs, employing a Stochastic Approximation approach integrated with Stochastic Gradient Descent (SGD)-based optimization techniques. Our framework introduces new projection methods tailored to efficiently enforce DAG constraints, ensuring that the algorithm converges to a feasible local minimum. With its low iteration complexity, the proposed method is well-suited for handling large-scale problems with improved computational efficiency. We demonstrate the effectiveness and scalability of our framework through comprehensive experimental evaluations, which confirm its superior performance across various settings.","url_abs":"https://arxiv.org/abs/2410.23862v1","url_pdf":"https://arxiv.org/pdf/2410.23862v1.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":"ps-dag-projected-stochastic-approximation","repo_url":"https://github.com/kz29/-psiDAG","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2410.23862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23862"}},"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/kz29/-psiDAG","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"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":0,"samples":[{"code_sha256_prefix":"3d07194747a6ad8e","entry":"data_generator","repo":"kz29/-psiDAG","repo_kind":"official","path":"data_generator.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/data_generator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3d07194747a6ad8e"}},{"code_sha256_prefix":"c01ed4191d274dbb","entry":"generator_matrix","repo":"kz29/-psiDAG","repo_kind":"official","path":"data_generator.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/data_generator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c01ed4191d274dbb"}},{"code_sha256_prefix":"849e07492ff99bf0","entry":"is_dag","repo":"kz29/-psiDAG","repo_kind":"official","path":"utils.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"849e07492ff99bf0"}},{"code_sha256_prefix":"b5a802e10543ecc7","entry":"mask_from_order","repo":"kz29/-psiDAG","repo_kind":"official","path":"utils.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b5a802e10543ecc7"}},{"code_sha256_prefix":"f46b81edc520e6c5","entry":"projection_order1","repo":"kz29/-psiDAG","repo_kind":"official","path":"utils.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f46b81edc520e6c5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}