{"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/get-optim-and-scheduler","entry":"get_optim_and_scheduler","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":5,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2309.12530","paper":"/paper/a-sentence-speaks-a-thousand-images-domain","title":"A Sentence Speaks a Thousand Images: Domain Generalization through Distilling CLIP with Language Guidance","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OoDBag/RISE","path":"optimizer/optimizer_helper.py","file_url":"https://github.com/OoDBag/RISE/blob/HEAD/optimizer/optimizer_helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"52231145e6cbb0b4","mcp_get_code":{"code_sha256":"52231145e6cbb0b4"}},{"arxiv_id":"2307.07205","paper":"/paper/multimodal-motion-conditioned-diffusion-model","title":"Multimodal Motion Conditioned Diffusion Model for Skeleton-based Video Anomaly Detection","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/MoCoDAD","path":"utils/model_utils.py","file_url":"https://github.com/aleflabo/MoCoDAD/blob/HEAD/utils/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e0144cbf00fd665","mcp_get_code":{"code_sha256":"7e0144cbf00fd665"}},{"arxiv_id":"2301.09489","paper":"/paper/contracting-skeletal-kinematic-embeddings-for","title":"Contracting Skeletal Kinematics for Human-Related Video Anomaly Detection","date":"2023-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/COSKAD","path":"utils/model_utils.py","file_url":"https://github.com/aleflabo/COSKAD/blob/HEAD/utils/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e0144cbf00fd665","mcp_get_code":{"code_sha256":"7e0144cbf00fd665"}},{"arxiv_id":"2105.11120","paper":"/paper/a-fourier-based-framework-for-domain","title":"A Fourier-based Framework for Domain Generalization","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MediaBrain-SJTU/FACT","path":"optimizer/optimizer_helper.py","file_url":"https://github.com/MediaBrain-SJTU/FACT/blob/HEAD/optimizer/optimizer_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb36f0527a1858d8","mcp_get_code":{"code_sha256":"cb36f0527a1858d8"}},{"arxiv_id":"2007.02454","paper":"/paper/self-challenging-improves-cross-domain","title":"Self-Challenging Improves Cross-Domain Generalization","date":"2020-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CiaoHe/Nex_RSC","path":"Domain_Generalization/optimizer/optimizer_helper.py","file_url":"https://github.com/CiaoHe/Nex_RSC/blob/HEAD/Domain_Generalization/optimizer/optimizer_helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"52231145e6cbb0b4","mcp_get_code":{"code_sha256":"52231145e6cbb0b4"}}]}