{"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/to-minibatch","entry":"to_minibatch","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":8,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2410.06020","paper":"/paper/qt-dog-quantization-aware-training-for-domain","title":"QT-DoG: Quantization-aware Training for Domain Generalization","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saqibjaved1/QT-DoG","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/saqibjaved1/QT-DoG/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2410.04492","paper":"/paper/interpret-your-decision-logical-reasoning","title":"Interpret Your Decision: Logical Reasoning Regularization for Generalization in Visual Classification","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaorui-tan/L-Reg_NeurIPS24","path":"mDG_and_mDG+GCD_with_L-Reg/domainbed/algorithms/algorithms.py","file_url":"https://github.com/zhaorui-tan/L-Reg_NeurIPS24/blob/HEAD/mDG_and_mDG%2BGCD_with_L-Reg/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2407.15085","paper":"/paper/learn-to-preserve-and-diversify-parameter","title":"Learn to Preserve and Diversify: Parameter-Efficient Group with Orthogonal Regularization for Domain Generalization","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JudgingH/PEGO","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/JudgingH/PEGO/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2310.08255","paper":"/paper/distilling-from-vision-language-models-for","title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/VL2V-ADiP","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/val-iisc/VL2V-ADiP/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2305.13046","paper":"/paper/poem-polarization-of-embeddings-for-domain","title":"POEM: Polarization of Embeddings for Domain-Invariant Representations","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoSangYoung/Official-POEM","path":"POEM/domainbed/algorithms/algorithms.py","file_url":"https://github.com/JoSangYoung/Official-POEM/blob/HEAD/POEM/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2303.01233","paper":"/paper/domain-aware-triplet-loss-in-domain","title":"Domain-aware Triplet loss in Domain Generalization","date":"2023-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"workerbcd/dct","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/workerbcd/dct/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2302.14685","paper":"/paper/dart-diversify-aggregate-repeat-training","title":"DART: Diversify-Aggregate-Repeat Training Improves Generalization of Neural Networks","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/DART","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/val-iisc/DART/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}},{"arxiv_id":"2203.10789","paper":"/paper/domain-generalization-by-mutual-information","title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/miro","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/kakaobrain/miro/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12c23ce22097acd0","mcp_get_code":{"code_sha256":"12c23ce22097acd0"}}]}