{"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/semi-supervised-learning-via-sparse-label","title":"Semi-Supervised Learning via Sparse Label Propagation","arxiv_id":"1612.01414","date":"2016-12-05","proceeding":null,"authors":["Alexander Jung","Alfred O. Hero III","Alexandru Mara","Saeed Jahromi"],"abstract":"This work proposes a novel method for semi-supervised learning from partially\nlabeled massive network-structured datasets, i.e., big data over networks. We\nmodel the underlying hypothesis, which relates data points to labels, as a\ngraph signal, defined over some graph (network) structure intrinsic to the\ndataset. Following the key principle of supervised learning, i.e., similar\ninputs yield similar outputs, we require the graph signals induced by labels to\nhave small total variation. Accordingly, we formulate the problem of learning\nthe labels of data points as a non-smooth convex optimization problem which\namounts to balancing between the empirical loss, i.e., the discrepancy with\nsome partially available label information, and the smoothness quantified by\nthe total variation of the learned graph signal. We solve this optimization\nproblem by appealing to a recently proposed preconditioned variant of the\npopular primal-dual method by Pock and Chambolle, which results in a sparse\nlabel propagation algorithm. This learning algorithm allows for a highly\nscalable implementation as message passing over the underlying data graph. By\napplying concepts of compressed sensing to the learning problem, we are also\nable to provide a transparent sufficient condition on the underlying network\nstructure such that accurate learning of the labels is possible. We also\npresent an implementation of the message passing formulation allows for a\nhighly scalable implementation in big data frameworks.","url_abs":"http://arxiv.org/abs/1612.01414v4","url_pdf":"http://arxiv.org/pdf/1612.01414v4.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":"semi-supervised-learning-via-sparse-label","repo_url":"https://github.com/oleksii-a/sparse_label_propagation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1612.01414","atlas_url":"https://app.syntology.ai/?focus=1612.01414","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1612.01414"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1612.01414\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1612.01414"},"call":"get_concepts_for_paper(arxiv_id=\"1612.01414\")"}],"by_repo":[{"repo":"oleksii-a/sparse_label_propagation","kind":"listed","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":"0cb186bad9db4fc6b239f22e6ec3f6de05c5307655d806c39cd190914d2dd1e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}