{"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/warmup-constant","entry":"warmup_constant","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":30,"n_papers_ran":17,"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":2,"n_samples_fingerprinted":2,"n_places":30,"n_places_pointer_only":6,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2609.02204","paper":"/paper/arxiv-2609-02204","title":"TAME: Temporal-Aware Mixture-of-Experts for Text-Video Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"sejong-rcv/TAME","path":"modules/optimization.py","file_url":"https://github.com/sejong-rcv/TAME/blob/HEAD/modules/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2309.17093","paper":"/paper/prototype-based-aleatoric-uncertainty-1","title":"Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leolee99/PAU","path":"modules/optimization.py","file_url":"https://github.com/leolee99/PAU/blob/HEAD/modules/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2308.11551","paper":"/paper/multi-event-video-text-retrieval","title":"Multi-event Video-Text Retrieval","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gengyuanmax/MeVTR","path":"modules/optimization.py","file_url":"https://github.com/gengyuanmax/MeVTR/blob/HEAD/modules/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2305.12218","paper":"/paper/text-video-retrieval-with-disentangled","title":"Text-Video Retrieval with Disentangled Conceptualization and Set-to-Set Alignment","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jpthu17/DiCoSA","path":"tvr/models/optimization.py","file_url":"https://github.com/jpthu17/DiCoSA/blob/HEAD/tvr/models/optimization.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":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2305.01938","paper":"/paper/doc2soargraph-discrete-reasoning-over","title":"Doc2SoarGraph: Discrete Reasoning over Visually-Rich Table-Text Documents via Semantic-Oriented Hierarchical Graphs","date":"2023-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fengbinzhu/doc2soargraph","path":"etr/model/optimizer.py","file_url":"https://github.com/fengbinzhu/doc2soargraph/blob/HEAD/etr/model/optimizer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2301.00184","paper":"/paper/cap4video-what-can-auxiliary-captions-do-for","title":"Cap4Video: What Can Auxiliary Captions Do for Text-Video Retrieval?","date":"2022-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whwu95/Cap4Video","path":"modules/optimization.py","file_url":"https://github.com/whwu95/Cap4Video/blob/HEAD/modules/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2211.09623","paper":"/paper/cross-modal-adapter-for-text-video-retrieval","title":"Cross-Modal Adapter for Text-Video Retrieval","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leaplabthu/cross-modal-adapter","path":"modules/optimization.py","file_url":"https://github.com/leaplabthu/cross-modal-adapter/blob/HEAD/modules/optimization.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":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2210.10861","paper":"/paper/qa-domain-adaptation-using-hidden-space","title":"QA Domain Adaptation using Hidden Space Augmentation and Self-Supervised Contrastive Adaptation","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yueeeeeeee/Self-Supervised-QA","path":"src/run_qada.py","file_url":"https://github.com/Yueeeeeeee/Self-Supervised-QA/blob/HEAD/src/run_qada.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2203.07111","paper":"/paper/disentangled-representation-learning-for-text","title":"Disentangled Representation Learning for Text-Video Retrieval","date":"2022-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foolwood/DRL","path":"tvr/models/optimization.py","file_url":"https://github.com/foolwood/DRL/blob/HEAD/tvr/models/optimization.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":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2110.00855","paper":"/paper/survtrace-transformers-for-survival-analysis","title":"SurvTRACE: Transformers for Survival Analysis with Competing Events","date":"2021-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RyanWangZf/SurvTRACE","path":"survtrace/train_utils.py","file_url":"https://github.com/RyanWangZf/SurvTRACE/blob/HEAD/survtrace/train_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2109.04008","paper":"/paper/graph-based-network-with-contextualized","title":"Graph Based Network with Contextualized Representations of Turns in Dialogue","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blacknoodle/tucore-gcn","path":"optimization.py","file_url":"https://github.com/blacknoodle/tucore-gcn/blob/HEAD/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2109.00590","paper":"/paper/webqa-multihop-and-multimodal-qa","title":"WebQA: Multihop and Multimodal QA","date":"2021-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shubham-gupta-iitr/mmmlX","path":"pytorch_pretrained_bert/optimization.py","file_url":"https://github.com/shubham-gupta-iitr/mmmlX/blob/HEAD/pytorch_pretrained_bert/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2106.02227","paper":"/paper/conversations-are-not-flat-modeling-the","title":"Conversations Are Not Flat: Modeling the Dynamic Information Flow across Dialogue Utterances","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/DialoGPT","path":"lsp_model/optim.py","file_url":"https://github.com/microsoft/DialoGPT/blob/HEAD/lsp_model/optim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2105.07624","paper":"/paper/tat-qa-a-question-answering-benchmark-on-a","title":"TAT-QA: A Question Answering Benchmark on a Hybrid of Tabular and Textual Content in Finance","date":"2021-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NExTplusplus/TAT-QA","path":"tag_op/tagop/optimizer.py","file_url":"https://github.com/NExTplusplus/TAT-QA/blob/HEAD/tag_op/tagop/optimizer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2104.09791","paper":"/paper/b-prop-bootstrapped-pre-training-with","title":"B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrieval","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Albert-Ma/PROP","path":"pytorch_pretrain_bert/optimization.py","file_url":"https://github.com/Albert-Ma/PROP/blob/HEAD/pytorch_pretrain_bert/optimization.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":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"1911.02896","paper":"/paper/contextualized-sparse-representation-with-1","title":"Contextualized Sparse Representations for Real-Time Open-Domain Question Answering","date":"2019-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhyuklee/sparc","path":"optimization.py","file_url":"https://github.com/jhyuklee/sparc/blob/HEAD/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"1911.00536","paper":"/paper/dialogpt-large-scale-generative-pre-training","title":"DialoGPT: Large-Scale Generative Pre-training for Conversational Response Generation","date":"2019-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphGrailAi/DialoGPT","path":"lsp_model/optim.py","file_url":"https://github.com/GraphGrailAi/DialoGPT/blob/HEAD/lsp_model/optim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"1909.00126","paper":"/paper/a-logic-driven-framework-for-consistency-of","title":"A Logic-Driven Framework for Consistency of Neural Models","date":"2019-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/consistency","path":"bert_adam.py","file_url":"https://github.com/utahnlp/consistency/blob/HEAD/bert_adam.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":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"1908.09355","paper":"/paper/patient-knowledge-distillation-for-bert-model","title":"Patient Knowledge Distillation for BERT Model Compression","date":"2019-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eunanomist/PKD_BERT","path":"BERT/pytorch_pretrained_bert/optimization.py","file_url":"https://github.com/eunanomist/PKD_BERT/blob/HEAD/BERT/pytorch_pretrained_bert/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"1906.05807","paper":"/paper/real-time-open-domain-question-answering-with","title":"Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uwnlp/denspi","path":"optimization.py","file_url":"https://github.com/uwnlp/denspi/blob/HEAD/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"1906.01698","paper":"/paper/open-sesame-getting-inside-berts-linguistic","title":"Open Sesame: Getting Inside BERT's Linguistic Knowledge","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongjie-lin/bert-opensesame","path":"pytorch_pretrained_bert/optimization.py","file_url":"https://github.com/yongjie-lin/bert-opensesame/blob/HEAD/pytorch_pretrained_bert/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"1903.09588","paper":"/paper/utilizing-bert-for-aspect-based-sentiment","title":"Utilizing BERT for Aspect-Based Sentiment Analysis via Constructing Auxiliary Sentence","date":"2019-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HSLCY/ABSA-BERT-pair","path":"optimization.py","file_url":"https://github.com/HSLCY/ABSA-BERT-pair/blob/HEAD/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"1711.05101","paper":"/paper/decoupled-weight-decay-regularization","title":"Decoupled Weight Decay Regularization","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/pytorch-openai-transformer-lm","path":"opt.py","file_url":"https://github.com/huggingface/pytorch-openai-transformer-lm/blob/HEAD/opt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e3a777867228513","mcp_get_code":{"code_sha256":"3e3a777867228513"}},{"arxiv_id":"1408.5882","paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yschoi-nisp/AI-Grand-Challenge-2020","path":"pytorch_pretrained_bert/optimization.py","file_url":"https://github.com/yschoi-nisp/AI-Grand-Challenge-2020/blob/HEAD/pytorch_pretrained_bert/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"aaai_32468","paper":null,"title":"arXiv:aaai_32468","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"airsplay/LXMERT","path":"src/lxrt/optimization.py","file_url":"https://github.com/airsplay/LXMERT/blob/HEAD/src/lxrt/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"aaai_17659","paper":null,"title":"arXiv:aaai_17659","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"frankaging/Quasi-Attention-ABSA","path":"code/util/optimization.py","file_url":"https://github.com/frankaging/Quasi-Attention-ABSA/blob/HEAD/code/util/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"Diao_UniPT_Universal_Parallel_Tuning_for_Transfer_Learning_with_Efficient_Parameter_CVPR_2024_paper","paper":null,"title":"arXiv:Diao_UniPT_Universal_Parallel_Tuning_for_Transfer_Learning_with_Efficient_Parameter_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Paranioar/UniPT","path":"CLIP4Clip/modules/optimization.py","file_url":"https://github.com/Paranioar/UniPT/blob/HEAD/CLIP4Clip/modules/optimization.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":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}},{"arxiv_id":"2022.findings-emnlp.176","paper":null,"title":"arXiv:2022.findings-emnlp.176","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LuJunru/TranCLR","path":"code/optimization.py","file_url":"https://github.com/LuJunru/TranCLR/blob/HEAD/code/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2021.naacl-main.231","paper":null,"title":"arXiv:2021.naacl-main.231","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cuhksz-nlp/ASA-TGCN","path":"optimization.py","file_url":"https://github.com/cuhksz-nlp/ASA-TGCN/blob/HEAD/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7d542062316094a","mcp_get_code":{"code_sha256":"e7d542062316094a"}},{"arxiv_id":"2021.emnlp-main.518","paper":null,"title":"arXiv:2021.emnlp-main.518","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hyounghk/NDH-FULL","path":"tasks/NDH_full/optimization.py","file_url":"https://github.com/hyounghk/NDH-FULL/blob/HEAD/tasks/NDH_full/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"59e4e730a9dc5dc6","mcp_get_code":{"code_sha256":"59e4e730a9dc5dc6"}}]}