{"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/beyond-phams-algorithm-for-joint","title":"Beyond Pham's algorithm for joint diagonalization","arxiv_id":"1811.11433","date":"2018-11-28","proceeding":null,"authors":["Pierre Ablin","Jean-François Cardoso","Alexandre Gramfort"],"abstract":"The approximate joint diagonalization of a set of matrices consists in\nfinding a basis in which these matrices are as diagonal as possible. This\nproblem naturally appears in several statistical learning tasks such as blind\nsignal separation. We consider the diagonalization criterion studied in a\nseminal paper by Pham (2001), and propose a new quasi-Newton method for its\noptimization. Through numerical experiments on simulated and real datasets, we\nshow that the proposed method outper-forms Pham's algorithm. An open source\nPython package is released.","url_abs":"http://arxiv.org/abs/1811.11433v1","url_pdf":"http://arxiv.org/pdf/1811.11433v1.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":"beyond-phams-algorithm-for-joint","repo_url":"https://github.com/pierreablin/qndiag","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1811.11433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11433"}},"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/pierreablin/qndiag","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"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":"4d43cb6a560b81d2","entry":"ajd_pham","repo":"pierreablin/qndiag","repo_kind":"official","path":"qndiag/pham.py","file_url":"https://github.com/pierreablin/qndiag/blob/HEAD/qndiag/pham.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":"4d43cb6a560b81d2"}},{"code_sha256_prefix":"9d7c6cb66a0b70e6","entry":"loss","repo":"pierreablin/qndiag","repo_kind":"official","path":"qndiag/qndiag.py","file_url":"https://github.com/pierreablin/qndiag/blob/HEAD/qndiag/qndiag.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":"9d7c6cb66a0b70e6"}},{"code_sha256_prefix":"b2f952a899ba6300","entry":"qndiag","repo":"pierreablin/qndiag","repo_kind":"official","path":"qndiag/qndiag.py","file_url":"https://github.com/pierreablin/qndiag/blob/HEAD/qndiag/qndiag.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":"b2f952a899ba6300"}},{"code_sha256_prefix":"f677eeda923b749e","entry":"transform_set","repo":"pierreablin/qndiag","repo_kind":"official","path":"qndiag/qndiag.py","file_url":"https://github.com/pierreablin/qndiag/blob/HEAD/qndiag/qndiag.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":"f677eeda923b749e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}