{"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":"/method/gpfl","slug":"gpfl","name":"GPFL","full_name":"Graph Path Feature Learning","full_name_withheld":false,"description_markdown":"**Graph Path Feature Learning** is a probabilistic rule learner optimized to mine instantiated first-order logic rules from knowledge graphs. Instantiated rules contain constants extracted from KGs. Compared to abstract rules that contain no constants, instantiated rules are capable of explaining and expressing concepts in more detail. GPFL utilizes a novel two-stage rule generation mechanism that first generalizes extracted paths into templates that are acyclic abstract rules until a certain degree of template saturation is achieved, then specializes the generated templates into instantiated rules.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","paper":"/paper/efficient-rule-learning-with-template","first_author":"Yulong Gu","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/efficient-rule-learning-with-template"},"source":{"url":"https://arxiv.org/abs/2003.06071v2","title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Rule Learners","url":"/methods/category/rule-learners","pwc_aliases":[]}],"n_papers_tagged":3,"archive_num_papers":3,"papers_newest_first":[{"paper":null,"slug":"gpfl-a-gradient-projection-based-client","title":"GPFL: A Gradient Projection-Based Client Selection Framework for Efficient Federated Learning","date":"2024-03-26","arxiv_id":"2403.17833","n_code_links":0,"syntology":null},{"paper":"/paper/gpfl-simultaneously-learning-global-and","slug":"gpfl-simultaneously-learning-global-and","title":"GPFL: Simultaneously Learning Global and Personalized Feature Information for Personalized Federated Learning","date":"2023-08-20","arxiv_id":"2308.10279","n_code_links":4,"syntology":{"ran":9,"of":17,"n_ran_checked":3,"n_instrument":6,"unverified":8,"pointer_only":7,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","official":{"repos":["TsingZ0/GPFL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/efficient-rule-learning-with-template","slug":"efficient-rule-learning-with-template","title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","date":"2020-03-13","arxiv_id":"2003.06071","n_code_links":1,"syntology":null}],"papers_shown":3,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":3,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":3,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/gpfl/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/gpfl/papers/ran/1","json":"/method/gpfl/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/federated-learning","name":"Federated Learning","papers":2},{"task":"/task/fairness","name":"Fairness","papers":1},{"task":"/task/inductive-knowledge-graph-completion","name":"Inductive knowledge graph completion","papers":1},{"task":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion","papers":1},{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":1},{"task":"/task/personalized-federated-learning","name":"Personalized Federated Learning","papers":1},{"task":"/task/privacy-preserving","name":"Privacy Preserving","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2020","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/gpfl"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=GPFL","read_at":"2026-10-05T00:57:07+00:00","query":"GPFL","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"GPFL","origin_arxiv_id":"2308.10279"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2003.06071","repositories":{"listed":4,"in_graph":4,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2308.10279","citations":90},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'GPFL'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2308.10279","page":"/paper/gpfl-simultaneously-learning-global-and","syntology_url":"https://syntology.ai/paper/2308.10279","in_graph_layer":true,"samples":17,"ran":9,"n_ran_checked":3,"n_instrument":6,"unverified":8,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2308.10279: repository known, no verified implementation (declared_code; repositories: 4 listed of 4 in the graph, strongest link: official). About another paper: this answer is about arXiv:2308.10279, while the archive credits arXiv:2003.06071.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"6ecbfe4367a2df9139efc782be1215b2640070a402a8485d148bbb03fd35f618","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}