{"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":"/code/text-classification-metrics","entry":"text_classification_metrics","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":7,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":2,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2408.13656","paper":"/paper/localize-and-stitch-efficient-model-merging","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/localize-and-stitch","path":"language/src/processors.py","file_url":"https://github.com/yifei-he/localize-and-stitch/blob/HEAD/language/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}},{"arxiv_id":"2309.05173","paper":"/paper/dept-decomposed-prompt-tuning-for-parameter","title":"DePT: Decomposed Prompt Tuning for Parameter-Efficient Fine-tuning","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengxiangshi/powerfulpromptft","path":"src/processors.py","file_url":"https://github.com/zhengxiangshi/powerfulpromptft/blob/HEAD/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}},{"arxiv_id":"2305.01711","paper":"/paper/don-t-stop-pretraining-make-prompt-based-fine","title":"Don't Stop Pretraining? Make Prompt-based Fine-tuning Powerful Learner","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhengxiangShi/PowerfulPromptFT","path":"src/processors.py","file_url":"https://github.com/ZhengxiangShi/PowerfulPromptFT/blob/HEAD/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}},{"arxiv_id":"2210.05643","paper":"/paper/a-kernel-based-view-of-language-model-fine","title":"A Kernel-Based View of Language Model Fine-Tuning","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/lm-kernel-ft","path":"src/processors.py","file_url":"https://github.com/princeton-nlp/lm-kernel-ft/blob/HEAD/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}},{"arxiv_id":"2205.01308","paper":"/paper/contrastive-learning-for-prompt-based-few","title":"Contrastive Learning for Prompt-Based Few-Shot Language Learners","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiren-jian/LM-SupCon","path":"src/processors.py","file_url":"https://github.com/yiren-jian/LM-SupCon/blob/HEAD/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}},{"arxiv_id":"2202.11451","paper":"/paper/zero-shot-cross-lingual-transfer-of-prompt","title":"Zero-shot Cross-lingual Transfer of Prompt-based Tuning with a Unified Multilingual Prompt","date":"2022-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mojave-pku/uniprompt","path":"src/processors.py","file_url":"https://github.com/mojave-pku/uniprompt/blob/HEAD/src/processors.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc5d5197b945da2f","mcp_get_code":{"code_sha256":"cc5d5197b945da2f"}},{"arxiv_id":"2110.06274","paper":"/paper/list-lite-self-training-makes-efficient-few-1","title":"LiST: Lite Prompted Self-training Makes Parameter-Efficient Few-shot Learners","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/list","path":"src/processors.py","file_url":"https://github.com/microsoft/list/blob/HEAD/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}},{"arxiv_id":"2110.01256","paper":"/paper/revisiting-self-training-for-few-shot","title":"Revisiting Self-Training for Few-Shot Learning of Language Model","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthewcym/sflm","path":"src/processors.py","file_url":"https://github.com/matthewcym/sflm/blob/HEAD/src/processors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b62076c5483738dc","mcp_get_code":{"code_sha256":"b62076c5483738dc"}}]}