{"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/gradientreversallayer","entry":"GradientReversalLayer","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":6,"n_papers_ran":5,"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":6,"n_samples_ran":5,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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":"2603.26008","paper":"/paper/arxiv-2603-26008","title":"FairLLaVA: Fairness-Aware Parameter-Efficient Fine-Tuning for Large Vision-Language Assistants","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"bhosalems/FairLLaVA","path":"llava/model/language_model/llava_llama.py","file_url":"https://github.com/bhosalems/FairLLaVA/blob/HEAD/llava/model/language_model/llava_llama.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b4240bd567cf9949","mcp_get_code":{"code_sha256":"b4240bd567cf9949"}},{"arxiv_id":"2409.20012","paper":"/paper/towards-robust-multimodal-sentiment-analysis","title":"Towards Robust Multimodal Sentiment Analysis with Incomplete Data","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoyu-ha/lnln","path":"models/lnln.py","file_url":"https://github.com/haoyu-ha/lnln/blob/HEAD/models/lnln.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c0d4b2a4a933000","mcp_get_code":{"code_sha256":"2c0d4b2a4a933000"}},{"arxiv_id":"2305.00664","paper":"/paper/dynamic-transfer-learning-across-graphs","title":"EvoluNet: Advancing Dynamic Non-IID Transfer Learning on Graphs","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghh7/evolunet","path":"model/model.py","file_url":"https://github.com/wanghh7/evolunet/blob/HEAD/model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"10004f26c7642fef","mcp_get_code":{"code_sha256":"10004f26c7642fef"}},{"arxiv_id":"2009.13504","paper":"/paper/graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liaopeiyuan/GAL","path":"Movielens_Wasserstein/models.py","file_url":"https://github.com/liaopeiyuan/GAL/blob/HEAD/Movielens_Wasserstein/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1eae100d2f87967","mcp_get_code":{"code_sha256":"e1eae100d2f87967"}},{"arxiv_id":"1505.07818","paper":"/paper/domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dv-fenix/Domain-Adaptation","path":"Domain-Adversarial Training of Neural Networks/model.py","file_url":"https://github.com/dv-fenix/Domain-Adaptation/blob/HEAD/Domain-Adversarial%20Training%20of%20Neural%20Networks/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"a5f777ab36b3f81e","mcp_get_code":{"code_sha256":"a5f777ab36b3f81e"}},{"arxiv_id":"1409.7495","paper":"/paper/unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KeiraZhao/MDAN","path":"model.py","file_url":"https://github.com/KeiraZhao/MDAN/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a131c7e1826f2658","mcp_get_code":{"code_sha256":"a131c7e1826f2658"}}]}