{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/inv-lr-scheduler","entry":"inv_lr_scheduler","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":7,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2406.02862","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-guidance-information-to-utilize","title":"Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyl660/LERM","path":"UDA/DA/CDAN-LERM/lr_schedule.py","file_url":"https://github.com/zhangyl660/LERM/blob/HEAD/UDA/DA/CDAN-LERM/lr_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhangyl660/LERM when it was checked","code_sha256":"693fef7015113684","code_sha256_prefix":"693fef7015113684","mcp_get_code":{"code_sha256":"693fef7015113684"}},{"arxiv_id":"2402.01887","arxiv_id_is_arxiv":true,"paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/CDAN","path":"pytorch/lr_schedule.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/pytorch/lr_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thuml/CDAN when it was checked","code_sha256":"693fef7015113684","code_sha256_prefix":"693fef7015113684","mcp_get_code":{"code_sha256":"693fef7015113684"}},{"arxiv_id":"2207.13048","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-under-open-set-label-shift","title":"Domain Adaptation under Open Set Label Shift","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/DANCE","path":"utils/lr_schedule.py","file_url":"https://github.com/VisionLearningGroup/DANCE/blob/HEAD/utils/lr_schedule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8395d539bd4cf136","code_sha256_prefix":"8395d539bd4cf136","mcp_get_code":{"code_sha256":"8395d539bd4cf136"}},{"arxiv_id":"2108.09645","arxiv_id_is_arxiv":true,"paper":"/paper/an-efficient-mini-batch-method-via-partial","title":"Improving Mini-batch Optimal Transport via Partial Transportation","date":"2021-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khainb/BoMb-OT","path":"PartialDA/run_mOT.py","file_url":"https://github.com/khainb/BoMb-OT/blob/HEAD/PartialDA/run_mOT.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"693fef7015113684","code_sha256_prefix":"693fef7015113684","mcp_get_code":{"code_sha256":"693fef7015113684"}},{"arxiv_id":"2106.04732","arxiv_id_is_arxiv":true,"paper":"/paper/adamatch-a-unified-approach-to-semi","title":"AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwenyu/UniSSDA","path":"algorithms/algorithms.py","file_url":"https://github.com/zwenyu/UniSSDA/blob/HEAD/algorithms/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zwenyu/UniSSDA when it was checked","code_sha256":"f069b56fa07b8d15","code_sha256_prefix":"f069b56fa07b8d15","mcp_get_code":{"code_sha256":"f069b56fa07b8d15"}},{"arxiv_id":"2104.03344","arxiv_id_is_arxiv":true,"paper":"/paper/ovanet-one-vs-all-network-for-universal","title":"OVANet: One-vs-All Network for Universal Domain Adaptation","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/OVANet","path":"utils/lr_schedule.py","file_url":"https://github.com/VisionLearningGroup/OVANet/blob/HEAD/utils/lr_schedule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa66984f3b0d98e3","code_sha256_prefix":"aa66984f3b0d98e3","mcp_get_code":{"code_sha256":"aa66984f3b0d98e3"}},{"arxiv_id":"2103.13575","arxiv_id_is_arxiv":true,"paper":"/paper/metaalign-coordinating-domain-alignment-and","title":"MetaAlign: Coordinating Domain Alignment and Classification for Unsupervised Domain Adaptation","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/UDA","path":"trainer/da/toalign.py","file_url":"https://github.com/microsoft/UDA/blob/HEAD/trainer/da/toalign.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0a5764019d61e108","code_sha256_prefix":"0a5764019d61e108","mcp_get_code":{"code_sha256":"0a5764019d61e108"}},{"arxiv_id":"2007.01434","arxiv_id_is_arxiv":true,"paper":"/paper/in-search-of-lost-domain-generalization","title":"In Search of Lost Domain Generalization","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kowshikthopalli/DREAME","path":"domainbed/algorithms.py","file_url":"https://github.com/kowshikthopalli/DREAME/blob/HEAD/domainbed/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce1df52d4a961b8","code_sha256_prefix":"3ce1df52d4a961b8","mcp_get_code":{"code_sha256":"3ce1df52d4a961b8"}},{"arxiv_id":"2003.02541","arxiv_id_is_arxiv":true,"paper":"/paper/a-balanced-and-uncertainty-aware-approach-for","title":"A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/BA3US","path":"lr_schedule.py","file_url":"https://github.com/tim-learn/BA3US/blob/HEAD/lr_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"693fef7015113684","code_sha256_prefix":"693fef7015113684","mcp_get_code":{"code_sha256":"693fef7015113684"}},{"arxiv_id":"1904.06487","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-domain-adaptation-via-minimax","title":"Semi-supervised Domain Adaptation via Minimax Entropy","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/SSDA_MME","path":"utils/lr_schedule.py","file_url":"https://github.com/VisionLearningGroup/SSDA_MME/blob/HEAD/utils/lr_schedule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b8b37ea74e8fc664","code_sha256_prefix":"b8b37ea74e8fc664","mcp_get_code":{"code_sha256":"b8b37ea74e8fc664"}},{"arxiv_id":"1702.00758","arxiv_id_is_arxiv":true,"paper":"/paper/hashnet-deep-learning-to-hash-by-continuation","title":"HashNet: Deep Learning to Hash by Continuation","date":"2017-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/HashNet","path":"pytorch/src/lr_schedule.py","file_url":"https://github.com/thuml/HashNet/blob/HEAD/pytorch/src/lr_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce1df52d4a961b8","code_sha256_prefix":"3ce1df52d4a961b8","mcp_get_code":{"code_sha256":"3ce1df52d4a961b8"}}],"record_sha256":"17fc008c7c9f3e78d2cc8d7420cbc86156416623147fa4384b8aace41e1e7961","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}