{"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/estimation-of-simultaneously-sparse-and-low","title":"Estimation of Simultaneously Sparse and Low Rank Matrices","arxiv_id":"1206.6474","date":"2012-06-27","proceeding":null,"authors":["Emile Richard","Pierre-Andre Savalle","Nicolas Vayatis"],"abstract":"The paper introduces a penalized matrix estimation procedure aiming at solutions which are sparse and low-rank at the same time. Such structures arise in the context of social networks or protein interactions where underlying graphs have adjacency matrices which are block-diagonal in the appropriate basis. We introduce a convex mixed penalty which involves $\\ell_1$-norm and trace norm simultaneously. We obtain an oracle inequality which indicates how the two effects interact according to the nature of the target matrix. We bound generalization error in the link prediction problem. We also develop proximal descent strategies to solve the optimization problem efficiently and evaluate performance on synthetic and real data sets.","url_abs":"https://arxiv.org/abs/1206.6474v1","url_pdf":"https://arxiv.org/pdf/1206.6474v1.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":"estimation-of-simultaneously-sparse-and-low","repo_url":"https://github.com/cmantoux/sparse-low-rank-decomposition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1206.6474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1206.6474"}},"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/cmantoux/sparse-low-rank-decomposition","reach":null}],"summary":{"ran_honours":1,"ran_fixture":2},"by_repo_kind":{"listed":{"samples":3,"ran":3,"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":"819051dc2540ffe4","entry":"average_clustering","repo":"cmantoux/sparse-low-rank-decomposition","repo_kind":"listed","path":"estimation_positive_symmetric.py","file_url":"https://github.com/cmantoux/sparse-low-rank-decomposition/blob/HEAD/estimation_positive_symmetric.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"819051dc2540ffe4"}},{"code_sha256_prefix":"63abc6d8d32649f2","entry":"distance","repo":"cmantoux/sparse-low-rank-decomposition","repo_kind":"listed","path":"estimation_positive_symmetric.py","file_url":"https://github.com/cmantoux/sparse-low-rank-decomposition/blob/HEAD/estimation_positive_symmetric.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"63abc6d8d32649f2"}},{"code_sha256_prefix":"cc8d27da20d098a8","entry":"rearrange","repo":"cmantoux/sparse-low-rank-decomposition","repo_kind":"listed","path":"example_airline.py","file_url":"https://github.com/cmantoux/sparse-low-rank-decomposition/blob/HEAD/example_airline.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"cc8d27da20d098a8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}