{"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/target-transform","entry":"target_transform","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":10,"n_papers_ran":9,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":1,"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":"2409.10956","paper":"/paper/versatile-incremental-learning-towards-class","title":"Versatile Incremental Learning: Towards Class and Domain-Agnostic Incremental Learning","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khu-agi/vil","path":"datasets.py","file_url":"https://github.com/khu-agi/vil/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"2405.14124","paper":"/paper/mixture-of-experts-meets-prompt-based","title":"Mixture of Experts Meets Prompt-Based Continual Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Minhchuyentoancbn/MoE_PromptCL","path":"datasets.py","file_url":"https://github.com/Minhchuyentoancbn/MoE_PromptCL/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"2404.14721","paper":"/paper/dynamically-anchored-prompting-for-task","title":"Dynamically Anchored Prompting for Task-Imbalanced Continual Learning","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenxing6666/dap","path":"datasets.py","file_url":"https://github.com/chenxing6666/dap/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"2311.12048","paper":"/paper/one-size-fits-all-for-semantic-shifts","title":"One Size Fits All for Semantic Shifts: Adaptive Prompt Tuning for Continual Learning","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-dmlab/AdaPromptCL","path":"datasets.py","file_url":"https://github.com/kaist-dmlab/AdaPromptCL/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"2310.13888","paper":"/paper/towards-a-general-framework-for-continual","title":"Towards a General Framework for Continual Learning with Pre-training","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/HiDe-Prompt","path":"datasets.py","file_url":"https://github.com/thu-ml/HiDe-Prompt/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"2308.09610","paper":"/paper/on-the-effectiveness-of-layernorm-tuning-for","title":"On the Effectiveness of LayerNorm Tuning for Continual Learning in Vision Transformers","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdemin16/continual-layernorm-tuning","path":"couple/datasets.py","file_url":"https://github.com/tdemin16/continual-layernorm-tuning/blob/HEAD/couple/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"2112.08654","paper":"/paper/learning-to-prompt-for-continual-learning-1","title":"Learning to Prompt for Continual Learning","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JH-LEE-KR/l2p-pytorch","path":"datasets.py","file_url":"https://github.com/JH-LEE-KR/l2p-pytorch/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"265ea374aab10001","mcp_get_code":{"code_sha256":"265ea374aab10001"}},{"arxiv_id":"1905.11971","paper":"/paper/me-net-towards-effective-adversarial","title":"ME-Net: Towards Effective Adversarial Robustness with Matrix Estimation","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YyzHarry/ME-Net","path":"attack_blackbox.py","file_url":"https://github.com/YyzHarry/ME-Net/blob/HEAD/attack_blackbox.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"908e7e3772392464","mcp_get_code":{"code_sha256":"908e7e3772392464"}},{"arxiv_id":"1902.00744","paper":"/paper/asymmetric-valleys-beyond-sharp-and-flat","title":"Asymmetric Valleys: Beyond Sharp and Flat Local Minima","date":"2019-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"962086838/code-for-Asymmetric-Valley","path":"sgd_after_swa.py","file_url":"https://github.com/962086838/code-for-Asymmetric-Valley/blob/HEAD/sgd_after_swa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"deabc35581daae80","mcp_get_code":{"code_sha256":"deabc35581daae80"}},{"arxiv_id":"1802.08797","paper":"/paper/residual-dense-network-for-image-super","title":"Residual Dense Network for Image Super-Resolution","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puffnjackie/pytorch-super-resolution-implementations","path":"utils.py","file_url":"https://github.com/puffnjackie/pytorch-super-resolution-implementations/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"02cc7a7cfd24376d","mcp_get_code":{"code_sha256":"02cc7a7cfd24376d"}}]}