{"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/modeling-label-correlations-for-ultra-fine","title":"Modeling Label Correlations for Ultra-Fine Entity Typing with Neural Pairwise Conditional Random Field","arxiv_id":"2212.01581","date":"2022-12-03","proceeding":null,"authors":["Chengyue Jiang","Yong Jiang","Weiqi Wu","Pengjun Xie","Kewei Tu"],"abstract":"Ultra-fine entity typing (UFET) aims to predict a wide range of type phrases that correctly describe the categories of a given entity mention in a sentence. Most recent works infer each entity type independently, ignoring the correlations between types, e.g., when an entity is inferred as a president, it should also be a politician and a leader. To this end, we use an undirected graphical model called pairwise conditional random field (PCRF) to formulate the UFET problem, in which the type variables are not only unarily influenced by the input but also pairwisely relate to all the other type variables. We use various modern backbones for entity typing to compute unary potentials, and derive pairwise potentials from type phrase representations that both capture prior semantic information and facilitate accelerated inference. We use mean-field variational inference for efficient type inference on very large type sets and unfold it as a neural network module to enable end-to-end training. Experiments on UFET show that the Neural-PCRF consistently outperforms its backbones with little cost and results in a competitive performance against cross-encoder based SOTA while being thousands of times faster. We also find Neural- PCRF effective on a widely used fine-grained entity typing dataset with a smaller type set. We pack Neural-PCRF as a network module that can be plugged onto multi-label type classifiers with ease and release it in https://github.com/modelscope/adaseq/tree/master/examples/NPCRF.","url_abs":"https://arxiv.org/abs/2212.01581v1","url_pdf":"https://arxiv.org/pdf/2212.01581v1.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":"modeling-label-correlations-for-ultra-fine","repo_url":"https://github.com/modelscope/adaseq","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"entity-typing","task_name":"Entity Typing"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"variational-inference","task_name":"Variational Inference"},{"task_slug":"type","task_name":"Vocal Bursts Type Prediction"}],"methods":[{"method_slug":"variational-inference","method_name":"Variational Inference"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/entity-typing-on-open-entity-1","task":"Entity Typing","dataset":"Open Entity","model":"Prompt + NPCRF (replicated by Adaseq)","rank_in_archive_order":3,"of":13,"metrics":{"F1":"50.1"},"uses_additional_data":false},{"leaderboard":"/sota/entity-typing-on-open-entity-1","task":"Entity Typing","dataset":"Open Entity","model":"Prompt Learning (replicated by Adaseq)）","rank_in_archive_order":5,"of":13,"metrics":{"F1":"49.3"},"uses_additional_data":false},{"leaderboard":"/sota/entity-typing-on-open-entity-1","task":"Entity Typing","dataset":"Open Entity","model":"RoBERTa-Large + NPCRF (replicated by Adaseq)","rank_in_archive_order":7,"of":13,"metrics":{"F1":"47.3"},"uses_additional_data":false},{"leaderboard":"/sota/entity-typing-on-open-entity-1","task":"Entity Typing","dataset":"Open Entity","model":"RoBERTa-Large (replicated by Adaseq)","rank_in_archive_order":10,"of":13,"metrics":{"F1":"43.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2212.01581","atlas_url":"https://app.syntology.ai/?focus=2212.01581","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":"2212.01581"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2212.01581\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2212.01581"},"call":"get_concepts_for_paper(arxiv_id=\"2212.01581\")"}],"by_repo":[{"repo":"modelscope/adaseq","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2105.03654","2305.03688"],"harvested_for_calls":[{"arxiv_id":"2105.03654","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.03654"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.03654\")"},{"arxiv_id":"2305.03688","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.03688"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.03688\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"38f760cf0208f74db85bba92dca8245a55cb35036150d21ecceda46b0986fb00","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}