{"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/featurizer","entry":"Featurizer","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":11,"n_papers_ran":2,"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":10,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":8},"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":"2605.16372","paper":"/paper/arxiv-2605-16372","title":"SWORDBENCH: Evaluating Orthogonality of Steering Image Representations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Weixin-Liang/MetaShift","path":"experiments/distribution_shift/networks.py","file_url":"https://github.com/Weixin-Liang/MetaShift/blob/HEAD/experiments/distribution_shift/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"35b902a4c075efc3","mcp_get_code":{"code_sha256":"35b902a4c075efc3"}},{"arxiv_id":"2603.25839","paper":"/paper/arxiv-2603-25839","title":"A Compression Perspective on Simplicity Bias","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"3rdCore/complicity","path":"source/networks.py","file_url":"https://github.com/3rdCore/complicity/blob/HEAD/source/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec18af6058c44a7b","mcp_get_code":{"code_sha256":"ec18af6058c44a7b"}},{"arxiv_id":"2601.21999","paper":"/paper/arxiv-2601-21999","title":"Negatives-Dominant Contrastive Learning for Generalization in Imbalanced Domains","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Alrash/NDCL","path":"src/algorithms.py","file_url":"https://github.com/Alrash/NDCL/blob/HEAD/src/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5586e626465a1519","mcp_get_code":{"code_sha256":"5586e626465a1519"}},{"arxiv_id":"2502.04242","paper":"/paper/a-theoretical-framework-for-data-efficient","title":"A Theoretical Framework for Data Efficient Multi-Source Transfer Learning Based on Cramér-Rao Bound","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zqy0126/OTQMS","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df389b17a2896c02","mcp_get_code":{"code_sha256":"df389b17a2896c02"}},{"arxiv_id":"2307.12502","paper":"/paper/cross-contrastive-feature-perturbation-for","title":"Cross Contrasting Feature Perturbation for Domain Generalization","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackmebroo/cross-contrasting-feature-perturbation-for-domain-generalization","path":"algorithms.py","file_url":"https://github.com/hackmebroo/cross-contrasting-feature-perturbation-for-domain-generalization/blob/HEAD/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9e043048978eb855","mcp_get_code":{"code_sha256":"9e043048978eb855"}},{"arxiv_id":"2306.08328","paper":"/paper/distribution-shift-inversion-for-out-of-1","title":"Distribution Shift Inversion for Out-of-Distribution Prediction","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/distribution-shift-iverson","path":"DSI/Predictor/domainbed_part/networks.py","file_url":"https://github.com/yu-rp/distribution-shift-iverson/blob/HEAD/DSI/Predictor/domainbed_part/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"387b3ed83dbf9591","mcp_get_code":{"code_sha256":"387b3ed83dbf9591"}},{"arxiv_id":"2303.10353","paper":"/paper/sharpness-aware-gradient-matching-for-domain","title":"Sharpness-Aware Gradient Matching for Domain Generalization","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-pengfei/sagm","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/wang-pengfei/sagm/blob/HEAD/domainbed/algorithms/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"467b3583a59f952e","mcp_get_code":{"code_sha256":"467b3583a59f952e"}},{"arxiv_id":"2301.12067","paper":"/paper/learning-optimal-features-via-partial","title":"Learning Optimal Features via Partial Invariance","date":"2023-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IbtihalFerwana/pirm","path":"metashift/experiments/distribution_shift/algorithms.py","file_url":"https://github.com/IbtihalFerwana/pirm/blob/HEAD/metashift/experiments/distribution_shift/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"35b902a4c075efc3","mcp_get_code":{"code_sha256":"35b902a4c075efc3"}},{"arxiv_id":"2210.03115","paper":"/paper/simper-simple-self-supervised-learning-of","title":"SimPer: Simple Self-Supervised Learning of Periodic Targets","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyzharry/simper","path":"src/simper.py","file_url":"https://github.com/yyzharry/simper/blob/HEAD/src/simper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"4ac0d2e193eab8a6","mcp_get_code":{"code_sha256":"4ac0d2e193eab8a6"}},{"arxiv_id":"2205.14546","paper":"/paper/the-missing-invariance-principle-found-the","title":"The Missing Invariance Principle Found -- the Reciprocal Twin of Invariant Risk Minimization","date":"2022-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/mri","path":"custom_algorithms.py","file_url":"https://github.com/ibm/mri/blob/HEAD/custom_algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28f76c5b44ed54e5","mcp_get_code":{"code_sha256":"28f76c5b44ed54e5"}},{"arxiv_id":"2201.11259","paper":"/paper/controlling-directions-orthogonal-to-a-1","title":"Controlling Directions Orthogonal to a Classifier","date":"2022-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"newbeeer/orthogonal_classifier","path":"style_transfer/algorithms.py","file_url":"https://github.com/newbeeer/orthogonal_classifier/blob/HEAD/style_transfer/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"20eba8a32c4f4158","mcp_get_code":{"code_sha256":"20eba8a32c4f4158"}}]}