{"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/set-optimizer","entry":"set_optimizer","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":24,"n_papers_ran":16,"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":14,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":26,"n_places_pointer_only":10,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"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":"2510.20627","paper":"/paper/arxiv-2510-20627","title":"H-SPLID: HSIC-based Saliency Preserving Latent Information Decomposition","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"neu-spiral/H-SPLID","path":"src/models/split_model.py","file_url":"https://github.com/neu-spiral/H-SPLID/blob/HEAD/src/models/split_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7d331d112a46a892","mcp_get_code":{"code_sha256":"7d331d112a46a892"}},{"arxiv_id":"2409.17504","paper":"/paper/haloscope-harnessing-unlabeled-llm","title":"HaloScope: Harnessing Unlabeled LLM Generations for Hallucination Detection","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/haloscope","path":"linear_probe.py","file_url":"https://github.com/deeplearning-wisc/haloscope/blob/HEAD/linear_probe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"2406.18676","paper":"/paper/understand-what-llm-needs-dual-preference","title":"Understand What LLM Needs: Dual Preference Alignment for Retrieval-Augmented Generation","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongguanting/dpa-rag","path":"SupContrast/util.py","file_url":"https://github.com/dongguanting/dpa-rag/blob/HEAD/SupContrast/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"2405.18635","paper":"/paper/when-and-how-does-in-distribution-label-help","title":"When and How Does In-Distribution Label Help Out-of-Distribution Detection?","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/id_label","path":"linear_probe.py","file_url":"https://github.com/deeplearning-wisc/id_label/blob/HEAD/linear_probe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"2403.04599","paper":"/paper/contrastive-continual-learning-with","title":"Contrastive Continual Learning with Importance Sampling and Prototype-Instance Relation Distillation","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijy373/CCLIS","path":"CCLIS/util.py","file_url":"https://github.com/lijy373/CCLIS/blob/HEAD/CCLIS/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"70bd7d2359734251","mcp_get_code":{"code_sha256":"70bd7d2359734251"}},{"arxiv_id":"2311.01196","paper":"/paper/combating-bilateral-edge-noise-for-robust-1","title":"Combating Bilateral Edge Noise for Robust Link Prediction","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HobbitLong/SupContrast","path":"util.py","file_url":"https://github.com/HobbitLong/SupContrast/blob/HEAD/util.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":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"2306.16774","paper":"/paper/stop-pre-training-adapt-visual-language","title":"Stop Pre-Training: Adapt Visual-Language Models to Unseen Languages","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yasminekaroui/CliCoTea","path":"src/clicotea/solver.py","file_url":"https://github.com/Yasminekaroui/CliCoTea/blob/HEAD/src/clicotea/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"98bd09092d99c729","mcp_get_code":{"code_sha256":"98bd09092d99c729"}},{"arxiv_id":"2305.14032","paper":"/paper/patch-mix-contrastive-learning-with-audio","title":"Patch-Mix Contrastive Learning with Audio Spectrogram Transformer on Respiratory Sound Classification","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raymin0223/patch-mix_contrastive_learning","path":"util/misc.py","file_url":"https://github.com/raymin0223/patch-mix_contrastive_learning/blob/HEAD/util/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f100d1606a7ecc2f","mcp_get_code":{"code_sha256":"f100d1606a7ecc2f"}},{"arxiv_id":"2210.04311","paper":"/paper/pruning-adversarially-robust-neural-networks","title":"Pruning Adversarially Robust Neural Networks without Adversarial Examples","date":"2022-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-spiral/pwoa","path":"source/hsicbt/core/train_misc.py","file_url":"https://github.com/neu-spiral/pwoa/blob/HEAD/source/hsicbt/core/train_misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"60f9636984fa3cae","mcp_get_code":{"code_sha256":"60f9636984fa3cae"}},{"arxiv_id":"2209.07811","paper":"/paper/modeling-multiple-views-via-implicitly","title":"Modeling Multiple Views via Implicitly Preserving Global Consistency and Local Complementarity","date":"2022-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangmengli/coconet","path":"train_CoCoNet.py","file_url":"https://github.com/jiangmengli/coconet/blob/HEAD/train_CoCoNet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"083c051b119764dc","mcp_get_code":{"code_sha256":"083c051b119764dc"}},{"arxiv_id":"2203.05119","paper":"/paper/metaug-contrastive-learning-via-meta-feature","title":"MetAug: Contrastive Learning via Meta Feature Augmentation","date":"2022-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangmengli/metaug","path":"train_MetAug.py","file_url":"https://github.com/jiangmengli/metaug/blob/HEAD/train_MetAug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f4842900b5d1d02","mcp_get_code":{"code_sha256":"5f4842900b5d1d02"}},{"arxiv_id":"2203.05119","paper":"/paper/metaug-contrastive-learning-via-meta-feature","title":"MetAug: Contrastive Learning via Meta Feature Augmentation","date":"2022-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangmengli/metaug","path":"LinearProbing_MetAug.py","file_url":"https://github.com/jiangmengli/metaug/blob/HEAD/LinearProbing_MetAug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3267a33f67aebf53","mcp_get_code":{"code_sha256":"3267a33f67aebf53"}},{"arxiv_id":"2106.05258","paper":"/paper/generative-models-as-a-data-source-for","title":"Generative Models as a Data Source for Multiview Representation Learning","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ali-design/GenRep","path":"util.py","file_url":"https://github.com/ali-design/GenRep/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"2106.02734","paper":"/paper/revisiting-hilbert-schmidt-information","title":"Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-spiral/hbar","path":"source/hbar/core/train_misc.py","file_url":"https://github.com/neu-spiral/hbar/blob/HEAD/source/hbar/core/train_misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7cb7faa3d88e623","mcp_get_code":{"code_sha256":"d7cb7faa3d88e623"}},{"arxiv_id":"2105.01060","paper":"/paper/curious-representation-learning-for-embodied","title":"Curious Representation Learning for Embodied Intelligence","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yilundu/crl","path":"places_finetune/finetune_places.py","file_url":"https://github.com/yilundu/crl/blob/HEAD/places_finetune/finetune_places.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"c9f9f89dff3b0006","mcp_get_code":{"code_sha256":"c9f9f89dff3b0006"}},{"arxiv_id":"2008.02531","paper":"/paper/self-supervised-video-representation-learning-3","title":"Self-supervised Video Representation Learning Using Inter-intra Contrastive Framework","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"083c051b119764dc","mcp_get_code":{"code_sha256":"083c051b119764dc"}},{"arxiv_id":"2004.11362","paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XG293/SupConLoss","path":"util.py","file_url":"https://github.com/XG293/SupConLoss/blob/HEAD/util.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":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"1911.05722","paper":"/paper/momentum-contrast-for-unsupervised-visual","title":"Momentum Contrast for Unsupervised Visual Representation Learning","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HobbitLong/CMC","path":"LinearProbing.py","file_url":"https://github.com/HobbitLong/CMC/blob/HEAD/LinearProbing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"3267a33f67aebf53","mcp_get_code":{"code_sha256":"3267a33f67aebf53"}},{"arxiv_id":"1906.05849","paper":"/paper/contrastive-multiview-coding","title":"Contrastive Multiview Coding","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"3267a33f67aebf53","mcp_get_code":{"code_sha256":"3267a33f67aebf53"}},{"arxiv_id":"1906.05849","paper":"/paper/contrastive-multiview-coding","title":"Contrastive Multiview Coding","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielchyeh/imagenet-100-pytorch","path":"util.py","file_url":"https://github.com/danielchyeh/imagenet-100-pytorch/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"1901.07659","paper":"/paper/a-machine-learning-benchmark-for-facies","title":"A Machine Learning Benchmark for Facies Classification","date":"2019-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olivesgatech/image-2022-volumetric-contrastive","path":"util.py","file_url":"https://github.com/olivesgatech/image-2022-volumetric-contrastive/blob/HEAD/util.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":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"1802.10026","paper":"/paper/loss-surfaces-mode-connectivity-and-fast","title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs","date":"2018-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuyxu/Ensemble-Pytorch","path":"torchensemble/utils/set_module.py","file_url":"https://github.com/xuyxu/Ensemble-Pytorch/blob/HEAD/torchensemble/utils/set_module.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":"c5a3a3cd326f2289","mcp_get_code":{"code_sha256":"c5a3a3cd326f2289"}},{"arxiv_id":"1802.08665","paper":"/paper/learning-latent-permutations-with-gumbel","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","date":"2018-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/gumbel_sinkhorn","path":"optimizer.py","file_url":"https://github.com/google/gumbel_sinkhorn/blob/HEAD/optimizer.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":"a66e302bfd882730","mcp_get_code":{"code_sha256":"a66e302bfd882730"}},{"arxiv_id":"Zhou_Towards_Effective_Foundation_Model_Adaptation_for_Extreme_Cross-Domain_Few-Shot_Learning_ICCV_2025_paper","paper":null,"title":"arXiv:Zhou_Towards_Effective_Foundation_Model_Adaptation_for_Extreme_Cross-Domain_Few-Shot_Learning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NWPUZhoufei/FMA","path":"utils.py","file_url":"https://github.com/NWPUZhoufei/FMA/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"Zhou_Revisiting_Prototypical_Network_for_Cross_Domain_Few-Shot_Learning_CVPR_2023_paper","paper":null,"title":"arXiv:Zhou_Revisiting_Prototypical_Network_for_Cross_Domain_Few-Shot_Learning_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NWPUZhoufei/LDP-Net","path":"utils.py","file_url":"https://github.com/NWPUZhoufei/LDP-Net/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a44a1925c2c778ba","mcp_get_code":{"code_sha256":"a44a1925c2c778ba"}},{"arxiv_id":"Sun_Soteria_Provable_Defense_Against_Privacy_Leakage_in_Federated_Learning_From_CVPR_2021_paper","paper":null,"title":"arXiv:Sun_Soteria_Provable_Defense_Against_Privacy_Leakage_in_Federated_Learning_From_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jeremy313/Soteria","path":"GS_attack/inversefed/training/training_routine.py","file_url":"https://github.com/jeremy313/Soteria/blob/HEAD/GS_attack/inversefed/training/training_routine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"953df33ba2dfd49e","mcp_get_code":{"code_sha256":"953df33ba2dfd49e"}}]}