{"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/graph-learning-under-sparsity-priors","title":"Graph learning under sparsity priors","arxiv_id":"1707.05587","date":"2017-07-18","proceeding":null,"authors":["Hermina Petric Maretic","Dorina Thanou","Pascal Frossard"],"abstract":"Graph signals offer a very generic and natural representation for data that\nlives on networks or irregular structures. The actual data structure is however\noften unknown a priori but can sometimes be estimated from the knowledge of the\napplication domain. If this is not possible, the data structure has to be\ninferred from the mere signal observations. This is exactly the problem that we\naddress in this paper, under the assumption that the graph signals can be\nrepresented as a sparse linear combination of a few atoms of a structured graph\ndictionary. The dictionary is constructed on polynomials of the graph\nLaplacian, which can sparsely represent a general class of graph signals\ncomposed of localized patterns on the graph. We formulate a graph learning\nproblem, whose solution provides an ideal fit between the signal observations\nand the sparse graph signal model. As the problem is non-convex, we propose to\nsolve it by alternating between a signal sparse coding and a graph update step.\nWe provide experimental results that outline the good graph recovery\nperformance of our method, which generally compares favourably to other recent\nnetwork inference algorithms.","url_abs":"http://arxiv.org/abs/1707.05587v1","url_pdf":"http://arxiv.org/pdf/1707.05587v1.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":"graph-learning-under-sparsity-priors","repo_url":"https://github.com/Hermina/GraphLearningSparsityPriors","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"graph-learning","task_name":"Graph Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Hermina/GraphLearningSparsityPriors","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"eac6570872266ed99bcfd3eabc04b3e73fe60256983b154fc7c1286b62449507","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}