{"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":"/task/domain-adaptation/papers/3","list_of":"/task/domain-adaptation","task":"Domain Adaptation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":65,"rows_per_page":100,"rows":[201,300],"of":6439,"counts":{"archive_papers_tagged":6439,"with_a_code_link":2400,"where_syntology_ran_a_sample":517,"not_listed_spam_title":0,"listed":6439,"listed_where_code_ran":517,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":442,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":442,"listed_every_run_a_failure_of_syntologys_instrument":75,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/domain-adaptation","prev":"/task/domain-adaptation/papers/2","next":"/task/domain-adaptation/papers/4","papers":[{"url":"/paper/anomaly-detection-in-ir-images-of-pv-modules","slug":"anomaly-detection-in-ir-images-of-pv-modules","title":"Anomaly Detection in IR Images of PV Modules using Supervised Contrastive Learning","date":"2021-12-06","arxiv_id":"2112.02922","repositories_listed":2,"syntology":null},{"url":"/paper/cross-domain-object-detection-via-adaptive","slug":"cross-domain-object-detection-via-adaptive","title":"Cross-Domain Adaptive Teacher for Object Detection","date":"2021-11-25","arxiv_id":"2111.13216","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cross-domain-object-detection-via-adaptive#ran","syntology_url":"https://syntology.ai/paper/2111.13216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13216"}},"official":{"repos":["facebookresearch/adaptive_teacher"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/merging-models-with-fisher-weighted-averaging","slug":"merging-models-with-fisher-weighted-averaging","title":"Merging Models with Fisher-Weighted Averaging","date":"2021-11-18","arxiv_id":"2111.09832","repositories_listed":2,"syntology":null},{"url":"/paper/semantic-aware-representation-learning-via-1","slug":"semantic-aware-representation-learning-via-1","title":"Probabilistic Contrastive Learning for Domain Adaptation","date":"2021-11-11","arxiv_id":"2111.06021","repositories_listed":2,"syntology":null},{"url":"/paper/mind-the-gap-domain-gap-control-for-single-1","slug":"mind-the-gap-domain-gap-control-for-single-1","title":"Mind the Gap: Domain Gap Control for Single Shot Domain Adaptation for Generative Adversarial Networks","date":"2021-10-15","arxiv_id":"2110.08398","repositories_listed":2,"syntology":null},{"url":"/paper/exploiting-the-intrinsic-neighborhood","slug":"exploiting-the-intrinsic-neighborhood","title":"Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptation","date":"2021-10-08","arxiv_id":"2110.04202","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/exploiting-the-intrinsic-neighborhood#ran","syntology_url":"https://syntology.ai/paper/2110.04202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04202"}},"official":{"repos":["albert0147/sfda_neighbors"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/climategan-raising-climate-change-awareness","slug":"climategan-raising-climate-change-awareness","title":"ClimateGAN: Raising Climate Change Awareness by Generating Images of Floods","date":"2021-10-06","arxiv_id":"2110.02871","repositories_listed":2,"syntology":null},{"url":"/paper/decoupled-adaptation-for-cross-domain-object","slug":"decoupled-adaptation-for-cross-domain-object","title":"Decoupled Adaptation for Cross-Domain Object Detection","date":"2021-10-06","arxiv_id":"2110.02578","repositories_listed":2,"syntology":null},{"url":"/paper/learning-kernel-smoothed-machine-translation","slug":"learning-kernel-smoothed-machine-translation","title":"Learning Kernel-Smoothed Machine Translation with Retrieved Examples","date":"2021-09-21","arxiv_id":"2109.09991","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-kernel-smoothed-machine-translation#ran","syntology_url":"https://syntology.ai/paper/2109.09991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.09991"}},"official":{"repos":["jiangqn/kster"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learnable-multi-level-frequency-decomposition","slug":"learnable-multi-level-frequency-decomposition","title":"Learnable Multi-level Frequency Decomposition and Hierarchical Attention Mechanism for Generalized Face Presentation Attack Detection","date":"2021-09-16","arxiv_id":"2109.07950","repositories_listed":2,"syntology":null},{"url":"/paper/cdtrans-cross-domain-transformer-for","slug":"cdtrans-cross-domain-transformer-for","title":"CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptation","date":"2021-09-13","arxiv_id":"2109.06165","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cdtrans-cross-domain-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2109.06165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06165"}},"official":{"repos":["cdtrans/cdtrans"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-nearest-neighbor-language-models","slug":"efficient-nearest-neighbor-language-models","title":"Efficient Nearest Neighbor Language Models","date":"2021-09-09","arxiv_id":"2109.04212","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-nearest-neighbor-language-models#ran","syntology_url":"https://syntology.ai/paper/2109.04212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04212"}},"official":{"repos":["jxhe/efficient-knnlm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-camera-super-resolution-with-aligned","slug":"dual-camera-super-resolution-with-aligned","title":"Dual-Camera Super-Resolution with Aligned Attention Modules","date":"2021-09-03","arxiv_id":"2109.01349","repositories_listed":2,"syntology":null},{"url":"/paper/robust-retrieval-augmented-generation-for","slug":"robust-retrieval-augmented-generation-for","title":"Robust Retrieval Augmented Generation for Zero-shot Slot Filling","date":"2021-08-31","arxiv_id":"2108.13934","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-retrieval-augmented-generation-for#ran","syntology_url":"https://syntology.ai/paper/2108.13934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13934"}},"official":{"repos":["ibm/kgi-slot-filling"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/tune-it-the-right-way-unsupervised-validation","slug":"tune-it-the-right-way-unsupervised-validation","title":"Tune it the Right Way: Unsupervised Validation of Domain Adaptation via Soft Neighborhood Density","date":"2021-08-24","arxiv_id":"2108.10860","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tune-it-the-right-way-unsupervised-validation#ran","syntology_url":"https://syntology.ai/paper/2108.10860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.10860"}},"official":{"repos":["visionlearninggroup/snd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-efficient-mini-batch-method-via-partial","slug":"an-efficient-mini-batch-method-via-partial","title":"Improving Mini-batch Optimal Transport via Partial Transportation","date":"2021-08-22","arxiv_id":"2108.09645","repositories_listed":2,"syntology":{"n":11,"n_ran":7,"n_constructed":3,"n_ran_checked":3,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/an-efficient-mini-batch-method-via-partial#ran","syntology_url":"https://syntology.ai/paper/2108.09645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09645"}},"official":{"repos":["ut-austin-data-science-group/mini-batch-ot","khainb/BoMb-OT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-anchor-active-domain-adaptation-for","slug":"multi-anchor-active-domain-adaptation-for","title":"Multi-Anchor Active Domain Adaptation for Semantic Segmentation","date":"2021-08-18","arxiv_id":"2108.08012","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/multi-anchor-active-domain-adaptation-for#ran","syntology_url":"https://syntology.ai/paper/2108.08012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.08012"}},"official":{"repos":["munanning/mada"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simrod-a-simple-adaptation-method-for-robust","slug":"simrod-a-simple-adaptation-method-for-robust","title":"SimROD: A Simple Adaptation Method for Robust Object Detection","date":"2021-07-28","arxiv_id":"2107.13389","repositories_listed":2,"syntology":null},{"url":"/paper/cell-detection-in-domain-shift-problem-using","slug":"cell-detection-in-domain-shift-problem-using","title":"Cell Detection in Domain Shift Problem Using Pseudo-Cell-Position Heatmap","date":"2021-07-19","arxiv_id":"2107.08653","repositories_listed":2,"syntology":null},{"url":"/paper/cored-generalizing-fake-media-detection-with","slug":"cored-generalizing-fake-media-detection-with","title":"CoReD: Generalizing Fake Media Detection with Continual Representation using Distillation","date":"2021-07-06","arxiv_id":"2107.02408","repositories_listed":2,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/cored-generalizing-fake-media-detection-with#ran","syntology_url":"https://syntology.ai/paper/2107.02408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02408"}},"official":null}},{"url":"/paper/mixstyle-neural-networks-for-domain","slug":"mixstyle-neural-networks-for-domain","title":"MixStyle Neural Networks for Domain Generalization and Adaptation","date":"2021-07-05","arxiv_id":"2107.02053","repositories_listed":2,"syntology":null},{"url":"/paper/cross-domain-gradient-discrepancy","slug":"cross-domain-gradient-discrepancy","title":"Cross-Domain Gradient Discrepancy Minimization for Unsupervised Domain Adaptation","date":"2021-06-08","arxiv_id":"2106.04151","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-inheritance-for-pre-trained","slug":"knowledge-inheritance-for-pre-trained","title":"Knowledge Inheritance for Pre-trained Language Models","date":"2021-05-28","arxiv_id":"2105.13880","repositories_listed":2,"syntology":null},{"url":"/paper/graphical-modeling-for-multi-source-domain","slug":"graphical-modeling-for-multi-source-domain","title":"Graphical Modeling for Multi-Source Domain Adaptation","date":"2021-04-27","arxiv_id":"2104.13057","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-adaptation-of-bert-and-performance","slug":"temporal-adaptation-of-bert-and-performance","title":"Temporal Adaptation of BERT and Performance on Downstream Document Classification: Insights from Social Media","date":"2021-04-16","arxiv_id":"2104.08116","repositories_listed":2,"syntology":null},{"url":"/paper/cross-domain-label-adaptive-stance-detection","slug":"cross-domain-label-adaptive-stance-detection","title":"Cross-Domain Label-Adaptive Stance Detection","date":"2021-04-15","arxiv_id":"2104.07467","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-open-domain-adaption-for-sketch","slug":"adversarial-open-domain-adaption-for-sketch","title":"Adversarial Open Domain Adaptation for Sketch-to-Photo Synthesis","date":"2021-04-12","arxiv_id":"2104.05703","repositories_listed":2,"syntology":null},{"url":"/paper/ovanet-one-vs-all-network-for-universal","slug":"ovanet-one-vs-all-network-for-universal","title":"OVANet: One-vs-All Network for Universal Domain Adaptation","date":"2021-04-07","arxiv_id":"2104.03344","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ovanet-one-vs-all-network-for-universal#ran","syntology_url":"https://syntology.ai/paper/2104.03344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03344"}},"official":{"repos":["VisionLearningGroup/OVANet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unsupervised-domain-expansion-for-visual","slug":"unsupervised-domain-expansion-for-visual","title":"Unsupervised Domain Expansion for Visual Categorization","date":"2021-04-01","arxiv_id":"2104.00233","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-domain-expansion-for-visual#ran","syntology_url":"https://syntology.ai/paper/2104.00233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00233"}},"official":{"repos":["li-xirong/ude"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/adaptive-boosting-for-domain-adaptation","slug":"adaptive-boosting-for-domain-adaptation","title":"Adaptive Boosting for Domain Adaptation: Towards Robust Predictions in Scene Segmentation","date":"2021-03-29","arxiv_id":"2103.15685","repositories_listed":2,"syntology":null},{"url":"/paper/regressive-domain-adaptation-for-unsupervised","slug":"regressive-domain-adaptation-for-unsupervised","title":"Regressive Domain Adaptation for Unsupervised Keypoint Detection","date":"2021-03-10","arxiv_id":"2103.06175","repositories_listed":2,"syntology":null},{"url":"/paper/discrepancy-based-active-learning-for-domain","slug":"discrepancy-based-active-learning-for-domain","title":"Discrepancy-Based Active Learning for Domain Adaptation","date":"2021-03-05","arxiv_id":"2103.03757","repositories_listed":2,"syntology":null},{"url":"/paper/unbalanced-minibatch-optimal-transport","slug":"unbalanced-minibatch-optimal-transport","title":"Unbalanced minibatch Optimal Transport; applications to Domain Adaptation","date":"2021-03-05","arxiv_id":"2103.03606","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/unbalanced-minibatch-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2103.03606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03606"}},"official":{"repos":["kilianFatras/JUMBOT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/domain-generalization-a-survey","slug":"domain-generalization-a-survey","title":"Domain Generalization: A Survey","date":"2021-03-03","arxiv_id":"2103.02503","repositories_listed":2,"syntology":null},{"url":"/paper/gradual-fine-tuning-for-low-resource-domain","slug":"gradual-fine-tuning-for-low-resource-domain","title":"Gradual Fine-Tuning for Low-Resource Domain Adaptation","date":"2021-03-03","arxiv_id":"2103.02205","repositories_listed":2,"syntology":null},{"url":"/paper/bomb-ot-on-batch-of-mini-batches-optimal","slug":"bomb-ot-on-batch-of-mini-batches-optimal","title":"On Transportation of Mini-batches: A Hierarchical Approach","date":"2021-02-11","arxiv_id":"2102.05912","repositories_listed":2,"syntology":null},{"url":"/paper/prototypical-pseudo-label-denoising-and","slug":"prototypical-pseudo-label-denoising-and","title":"Prototypical Pseudo Label Denoising and Target Structure Learning for Domain Adaptive Semantic Segmentation","date":"2021-01-26","arxiv_id":"2101.10979","repositories_listed":2,"syntology":{"n":17,"n_ran":8,"n_constructed":6,"n_ran_checked":6,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/prototypical-pseudo-label-denoising-and#ran","syntology_url":"https://syntology.ai/paper/2101.10979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.10979"}},"official":{"repos":["microsoft/ProDA"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-disentangled-semantic-representation","slug":"learning-disentangled-semantic-representation","title":"Learning Disentangled Semantic Representation for Domain Adaptation","date":"2020-12-22","arxiv_id":"2012.11807","repositories_listed":2,"syntology":null},{"url":"/paper/sentry-selective-entropy-optimization-via","slug":"sentry-selective-entropy-optimization-via","title":"SENTRY: Selective Entropy Optimization via Committee Consistency for Unsupervised Domain Adaptation","date":"2020-12-21","arxiv_id":"2012.11460","repositories_listed":2,"syntology":null},{"url":"/paper/finding-sparse-structure-for-domain-specific","slug":"finding-sparse-structure-for-domain-specific","title":"Finding Sparse Structures for Domain Specific Neural Machine Translation","date":"2020-12-19","arxiv_id":"2012.10586","repositories_listed":2,"syntology":null},{"url":"/paper/joint-generative-and-contrastive-learning-for","slug":"joint-generative-and-contrastive-learning-for","title":"Joint Generative and Contrastive Learning for Unsupervised Person Re-identification","date":"2020-12-16","arxiv_id":"2012.09071","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/joint-generative-and-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2012.09071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09071"}},"official":{"repos":["chenhao2345/GCL"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/coad-contrastive-pre-training-with","slug":"coad-contrastive-pre-training-with","title":"CODE: Contrastive Pre-training with Adversarial Fine-tuning for Zero-shot Expert Linking","date":"2020-12-14","arxiv_id":"2012.11336","repositories_listed":2,"syntology":null},{"url":"/paper/source-data-absent-unsupervised-domain","slug":"source-data-absent-unsupervised-domain","title":"Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer","date":"2020-12-14","arxiv_id":"2012.07297","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/source-data-absent-unsupervised-domain#ran","syntology_url":"https://syntology.ai/paper/2012.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07297"}},"official":{"repos":["tim-learn/SHOT-plus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/covid-19-detection-in-chest-x-ray-images","slug":"covid-19-detection-in-chest-x-ray-images","title":"COVID-19 Detection in Chest X-Ray Images using a New Channel Boosted CNN","date":"2020-12-08","arxiv_id":"2012.05073","repositories_listed":2,"syntology":null},{"url":"/paper/towards-uncovering-the-intrinsic-data","slug":"towards-uncovering-the-intrinsic-data","title":"Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation using Structurally Regularized Deep Clustering","date":"2020-12-08","arxiv_id":"2012.04280","repositories_listed":2,"syntology":null},{"url":"/paper/safe-self-attention-based-unsupervised-road","slug":"safe-self-attention-based-unsupervised-road","title":"SS-SFDA : Self-Supervised Source-Free Domain Adaptation for Road Segmentation in Hazardous Environments","date":"2020-11-27","arxiv_id":"2012.08939","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-batchnorm-adaptation-ubna-a","slug":"unsupervised-batchnorm-adaptation-ubna-a","title":"Unsupervised BatchNorm Adaptation (UBNA): A Domain Adaptation Method for Semantic Segmentation Without Using Source Domain Representations","date":"2020-11-17","arxiv_id":"2011.08502","repositories_listed":2,"syntology":null},{"url":"/paper/cliniqg4qa-generating-diverse-questions-for","slug":"cliniqg4qa-generating-diverse-questions-for","title":"CliniQG4QA: Generating Diverse Questions for Domain Adaptation of Clinical Question Answering","date":"2020-10-30","arxiv_id":"2010.16021","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cliniqg4qa-generating-diverse-questions-for#ran","syntology_url":"https://syntology.ai/paper/2010.16021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16021"}},"official":{"repos":["panushri25/emrQA","sunlab-osu/CliniQG4QA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/unsupervised-domain-adaptation-without-source","slug":"unsupervised-domain-adaptation-without-source","title":"Casting a BAIT for Offline and Online Source-free Domain Adaptation","date":"2020-10-23","arxiv_id":"2010.12427","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-attentive-geolocalization-from-few","slug":"adaptive-attentive-geolocalization-from-few","title":"Adaptive-Attentive Geolocalization from few queries: a hybrid approach","date":"2020-10-14","arxiv_id":"2010.06897","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adaptive-attentive-geolocalization-from-few#ran","syntology_url":"https://syntology.ai/paper/2010.06897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06897"}},"official":{"repos":["valeriopaolicelli/AdAGeo","valeriopaolicelli/adageo-WACV2021"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-uncertainty-in-domain-adaptation","slug":"harnessing-uncertainty-in-domain-adaptation","title":"Harnessing Uncertainty in Domain Adaptation for MRI Prostate Lesion Segmentation","date":"2020-10-14","arxiv_id":"2010.07411","repositories_listed":2,"syntology":null},{"url":"/paper/infant-pose-learning-with-small-data","slug":"infant-pose-learning-with-small-data","title":"Invariant Representation Learning for Infant Pose Estimation with Small Data","date":"2020-10-13","arxiv_id":"2010.06100","repositories_listed":2,"syntology":null},{"url":"/paper/robust-optimal-transport-with-applications-in","slug":"robust-optimal-transport-with-applications-in","title":"Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptation","date":"2020-10-12","arxiv_id":"2010.05862","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/robust-optimal-transport-with-applications-in#ran","syntology_url":"https://syntology.ai/paper/2010.05862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05862"}},"official":{"repos":["yogeshbalaji/robustOT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/feature-adaptation-of-pre-trained-language","slug":"feature-adaptation-of-pre-trained-language","title":"Feature Adaptation of Pre-Trained Language Models across Languages and Domains with Robust Self-Training","date":"2020-09-24","arxiv_id":"2009.11538","repositories_listed":2,"syntology":null},{"url":"/paper/the-unbalanced-gromov-wasserstein-distance","slug":"the-unbalanced-gromov-wasserstein-distance","title":"The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation","date":"2020-09-09","arxiv_id":"2009.04266","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-unbalanced-gromov-wasserstein-distance#ran","syntology_url":"https://syntology.ai/paper/2009.04266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.04266"}},"official":{"repos":["thibsej/unbalanced_gromov_wasserstein"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-little-w-net-that-could-state-of-the-art","slug":"the-little-w-net-that-could-state-of-the-art","title":"The Little W-Net That Could: State-of-the-Art Retinal Vessel Segmentation with Minimalistic Models","date":"2020-09-03","arxiv_id":"2009.01907","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-for-plant","slug":"unsupervised-domain-adaptation-for-plant","title":"Unsupervised Domain Adaptation For Plant Organ Counting","date":"2020-09-02","arxiv_id":"2009.01081","repositories_listed":2,"syntology":null},{"url":"/paper/instance-adaptive-self-training-for","slug":"instance-adaptive-self-training-for","title":"Instance Adaptive Self-Training for Unsupervised Domain Adaptation","date":"2020-08-27","arxiv_id":"2008.12197","repositories_listed":2,"syntology":null},{"url":"/paper/improved-mutual-mean-teaching-for","slug":"improved-mutual-mean-teaching-for","title":"Improved Mutual Mean-Teaching for Unsupervised Domain Adaptive Re-ID","date":"2020-08-24","arxiv_id":"2008.10313","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-in-the","slug":"unsupervised-domain-adaptation-in-the","title":"Unsupervised Domain Adaptation in the Dissimilarity Space for Person Re-identification","date":"2020-07-27","arxiv_id":"2007.13890","repositories_listed":2,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/unsupervised-domain-adaptation-in-the#ran","syntology_url":"https://syntology.ai/paper/2007.13890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13890"}},"official":{"repos":["djidje/D-MMD"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/attract-perturb-and-explore-learning-a","slug":"attract-perturb-and-explore-learning-a","title":"Attract, Perturb, and Explore: Learning a Feature Alignment Network for Semi-supervised Domain Adaptation","date":"2020-07-18","arxiv_id":"2007.09375","repositories_listed":2,"syntology":null},{"url":"/paper/dacs-domain-adaptation-via-cross-domain-mixed","slug":"dacs-domain-adaptation-via-cross-domain-mixed","title":"DACS: Domain Adaptation via Cross-domain Mixed Sampling","date":"2020-07-17","arxiv_id":"2007.08702","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dacs-domain-adaptation-via-cross-domain-mixed#ran","syntology_url":"https://syntology.ai/paper/2007.08702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08702"}},"official":{"repos":["vikolss/DACS"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/combating-domain-shift-with-self-taught","slug":"combating-domain-shift-with-self-taught","title":"Domain Adaptation with Auxiliary Target Domain-Oriented Classifier","date":"2020-07-08","arxiv_id":"2007.04171","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/combating-domain-shift-with-self-taught#ran","syntology_url":"https://syntology.ai/paper/2007.04171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04171"}},"official":{"repos":["tim-learn/atdoc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/off-dynamics-reinforcement-learning-training","slug":"off-dynamics-reinforcement-learning-training","title":"Off-Dynamics Reinforcement Learning: Training for Transfer with Domain Classifiers","date":"2020-06-24","arxiv_id":"2006.13916","repositories_listed":2,"syntology":{"n":23,"n_ran":21,"n_constructed":4,"n_ran_checked":15,"n_instrument":6,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":12,"n_pointer_only":7,"phrase":"21 ran (of which 4 constructed an object rather than computing a result; 15 with no instrument failure: 3 honoured, 0 violated, 12 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/off-dynamics-reinforcement-learning-training#ran","syntology_url":"https://syntology.ai/paper/2006.13916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13916"}},"official":null}},{"url":"/paper/club-a-contrastive-log-ratio-upper-bound-of","slug":"club-a-contrastive-log-ratio-upper-bound-of","title":"CLUB: A Contrastive Log-ratio Upper Bound of Mutual Information","date":"2020-06-22","arxiv_id":"2006.12013","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/club-a-contrastive-log-ratio-upper-bound-of#ran","syntology_url":"https://syntology.ai/paper/2006.12013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12013"}},"official":{"repos":["Linear95/CLUB"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fully-test-time-adaptation-by-entropy","slug":"fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","arxiv_id":"2006.10726","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":2,"n_ran_checked":2,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fully-test-time-adaptation-by-entropy#ran","syntology_url":"https://syntology.ai/paper/2006.10726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10726"}},"official":{"repos":["DequanWang/tent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adversarial-weighting-for-domain-adaptation","slug":"adversarial-weighting-for-domain-adaptation","title":"Adversarial Weighting for Domain Adaptation in Regression","date":"2020-06-15","arxiv_id":"2006.08251","repositories_listed":2,"syntology":null},{"url":"/paper/skin-segmentation-from-nir-images-using","slug":"skin-segmentation-from-nir-images-using","title":"Unsupervised Domain Adaptation for Semantic Segmentation of NIR Images through Generative Latent Search","date":"2020-06-15","arxiv_id":"2006.08696","repositories_listed":2,"syntology":null},{"url":"/paper/safeml-safety-monitoring-of-machine-learning","slug":"safeml-safety-monitoring-of-machine-learning","title":"SafeML: Safety Monitoring of Machine Learning Classifiers through Statistical Difference Measure","date":"2020-05-27","arxiv_id":"2005.13166","repositories_listed":2,"syntology":null},{"url":"/paper/multi-source-deep-domain-adaptation-with-weak","slug":"multi-source-deep-domain-adaptation-with-weak","title":"Multi-Source Deep Domain Adaptation with Weak Supervision for Time-Series Sensor Data","date":"2020-05-22","arxiv_id":"2005.10996","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-source-deep-domain-adaptation-with-weak#ran","syntology_url":"https://syntology.ai/paper/2005.10996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10996"}},"official":{"repos":["floft/codats"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-progressive-knowledge-distillation-and","slug":"joint-progressive-knowledge-distillation-and","title":"Joint Progressive Knowledge Distillation and Unsupervised Domain Adaptation","date":"2020-05-16","arxiv_id":"2005.07839","repositories_listed":2,"syntology":null},{"url":"/paper/vidit-virtual-image-dataset-for-illumination","slug":"vidit-virtual-image-dataset-for-illumination","title":"VIDIT: Virtual Image Dataset for Illumination Transfer","date":"2020-05-11","arxiv_id":"2005.05460","repositories_listed":2,"syntology":null},{"url":"/paper/fact-or-fiction-verifying-scientific-claims","slug":"fact-or-fiction-verifying-scientific-claims","title":"Fact or Fiction: Verifying Scientific Claims","date":"2020-04-30","arxiv_id":"2004.14974","repositories_listed":2,"syntology":null},{"url":"/paper/maximum-density-divergence-for-domain","slug":"maximum-density-divergence-for-domain","title":"Maximum Density Divergence for Domain Adaptation","date":"2020-04-27","arxiv_id":"2004.12615","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/maximum-density-divergence-for-domain#ran","syntology_url":"https://syntology.ai/paper/2004.12615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12615"}},"official":{"repos":["lijin118/ATM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/data-efficient-and-weakly-supervised","slug":"data-efficient-and-weakly-supervised","title":"Data Efficient and Weakly Supervised Computational Pathology on Whole Slide Images","date":"2020-04-20","arxiv_id":"2004.09666","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-intra-domain-adaptation-for","slug":"unsupervised-intra-domain-adaptation-for","title":"Unsupervised Intra-domain Adaptation for Semantic Segmentation through Self-Supervision","date":"2020-04-16","arxiv_id":"2004.07703","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unsupervised-intra-domain-adaptation-for#ran","syntology_url":"https://syntology.ai/paper/2004.07703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07703"}},"official":{"repos":["feipan664/IntraDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/classifying-constructive-comments","slug":"classifying-constructive-comments","title":"Classifying Constructive Comments","date":"2020-04-11","arxiv_id":"2004.05476","repositories_listed":2,"syntology":null},{"url":"/paper/reducing-gender-bias-in-neural-machine","slug":"reducing-gender-bias-in-neural-machine","title":"Reducing Gender Bias in Neural Machine Translation as a Domain Adaptation Problem","date":"2020-04-09","arxiv_id":"2004.04498","repositories_listed":2,"syntology":null},{"url":"/paper/speaker-aware-bert-for-multi-turn-response","slug":"speaker-aware-bert-for-multi-turn-response","title":"Speaker-Aware BERT for Multi-Turn Response Selection in Retrieval-Based Chatbots","date":"2020-04-07","arxiv_id":"2004.03588","repositories_listed":2,"syntology":null},{"url":"/paper/gradually-vanishing-bridge-for-adversarial","slug":"gradually-vanishing-bridge-for-adversarial","title":"Gradually Vanishing Bridge for Adversarial Domain Adaptation","date":"2020-03-30","arxiv_id":"2003.13183","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gradually-vanishing-bridge-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2003.13183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13183"}},"official":{"repos":["cuishuhao/GVB"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-discriminability-and-diversity-batch","slug":"towards-discriminability-and-diversity-batch","title":"Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations","date":"2020-03-27","arxiv_id":"2003.12237","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-discriminability-and-diversity-batch#ran","syntology_url":"https://syntology.ai/paper/2003.12237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12237"}},"official":{"repos":["cuishuhao/BNM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-domain-adaptation-via-4","slug":"unsupervised-domain-adaptation-via-4","title":"Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering","date":"2020-03-19","arxiv_id":"2003.08607","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-domain-adaptation-via-4#ran","syntology_url":"https://syntology.ai/paper/2003.08607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08607"}},"official":{"repos":["huitangtang/SRDC-CVPR2020"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/unified-image-and-video-saliency-modeling","slug":"unified-image-and-video-saliency-modeling","title":"Unified Image and Video Saliency Modeling","date":"2020-03-11","arxiv_id":"2003.05477","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unified-image-and-video-saliency-modeling#ran","syntology_url":"https://syntology.ai/paper/2003.05477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05477"}},"official":{"repos":["rdroste/unisal"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mind-the-gap-enlarging-the-domain-gap-in-open","slug":"mind-the-gap-enlarging-the-domain-gap-in-open","title":"Mind the Gap: Enlarging the Domain Gap in Open Set Domain Adaptation","date":"2020-03-08","arxiv_id":"2003.03787","repositories_listed":2,"syntology":null},{"url":"/paper/rectifying-pseudo-label-learning-via","slug":"rectifying-pseudo-label-learning-via","title":"Rectifying Pseudo Label Learning via Uncertainty Estimation for Domain Adaptive Semantic Segmentation","date":"2020-03-08","arxiv_id":"2003.03773","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rectifying-pseudo-label-learning-via#ran","syntology_url":"https://syntology.ai/paper/2003.03773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03773"}},"official":null}},{"url":"/paper/understanding-self-training-for-gradual","slug":"understanding-self-training-for-gradual","title":"Understanding Self-Training for Gradual Domain Adaptation","date":"2020-02-26","arxiv_id":"2002.11361","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-multi-class-domain-adaptation","slug":"unsupervised-multi-class-domain-adaptation","title":"Unsupervised Multi-Class Domain Adaptation: Theory, Algorithms, and Practice","date":"2020-02-20","arxiv_id":"2002.08681","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-multi-class-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2002.08681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08681"}},"official":{"repos":["YBZh/MultiClassDA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/madan-multi-source-adversarial-domain","slug":"madan-multi-source-adversarial-domain","title":"MADAN: Multi-source Adversarial Domain Aggregation Network for Domain Adaptation","date":"2020-02-19","arxiv_id":"2003.00820","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/madan-multi-source-adversarial-domain#ran","syntology_url":"https://syntology.ai/paper/2003.00820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00820"}},"official":{"repos":["Luodian/MADAN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-deep-network-embedding-for-cross","slug":"adversarial-deep-network-embedding-for-cross","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","date":"2020-02-18","arxiv_id":"2002.07366","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":7,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-deep-network-embedding-for-cross#ran","syntology_url":"https://syntology.ai/paper/2002.07366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07366"}},"official":{"repos":["shenxiaocam/ACDNE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/generative-pseudo-label-refinement-for","slug":"generative-pseudo-label-refinement-for","title":"Generative Pseudo-label Refinement for Unsupervised Domain Adaptation","date":"2020-01-09","arxiv_id":"2001.02950","repositories_listed":2,"syntology":null},{"url":"/paper/missing-class-robust-domain-adaptation-by","slug":"missing-class-robust-domain-adaptation-by","title":"Missing-Class-Robust Domain Adaptation by Unilateral Alignment for Fault Diagnosis","date":"2020-01-07","arxiv_id":"2001.02015","repositories_listed":2,"syntology":null},{"url":"/paper/homm-higher-order-moment-matching-for","slug":"homm-higher-order-moment-matching-for","title":"HoMM: Higher-order Moment Matching for Unsupervised Domain Adaptation","date":"2019-12-27","arxiv_id":"1912.11976","repositories_listed":2,"syntology":null},{"url":"/paper/simulating-content-consistent-vehicle","slug":"simulating-content-consistent-vehicle","title":"Simulating Content Consistent Vehicle Datasets with Attribute Descent","date":"2019-12-18","arxiv_id":"1912.08855","repositories_listed":2,"syntology":null},{"url":"/paper/learning-from-synthetic-animals","slug":"learning-from-synthetic-animals","title":"Learning from Synthetic Animals","date":"2019-12-17","arxiv_id":"1912.08265","repositories_listed":2,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/learning-from-synthetic-animals#ran","syntology_url":"https://syntology.ai/paper/1912.08265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08265"}},"official":{"repos":["JitengMu/Learning-from-Synthetic-Animals"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/associative-alignment-for-few-shot-image","slug":"associative-alignment-for-few-shot-image","title":"Associative Alignment for Few-shot Image Classification","date":"2019-12-11","arxiv_id":"1912.05094","repositories_listed":2,"syntology":null},{"url":"/paper/discriminative-adversarial-domain-adaptation","slug":"discriminative-adversarial-domain-adaptation","title":"Discriminative Adversarial Domain Adaptation","date":"2019-11-27","arxiv_id":"1911.12036","repositories_listed":2,"syntology":null},{"url":"/paper/open-cross-domain-visual-search","slug":"open-cross-domain-visual-search","title":"Open Cross-Domain Visual Search","date":"2019-11-19","arxiv_id":"1911.08621","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/open-cross-domain-visual-search#ran","syntology_url":"https://syntology.ai/paper/1911.08621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08621"}},"official":{"repos":["twuilliam/open-search"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/the-techqa-dataset","slug":"the-techqa-dataset","title":"The TechQA Dataset","date":"2019-11-08","arxiv_id":"1911.02984","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-techqa-dataset#ran","syntology_url":"https://syntology.ai/paper/1911.02984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02984"}},"official":null}},{"url":"/paper/multi-domain-dialogue-state-tracking-as","slug":"multi-domain-dialogue-state-tracking-as","title":"Multi-domain Dialogue State Tracking as Dynamic Knowledge Graph Enhanced Question Answering","date":"2019-11-07","arxiv_id":"1911.06192","repositories_listed":2,"syntology":null},{"url":"/paper/pointdan-a-multi-scale-3d-domain-adaption","slug":"pointdan-a-multi-scale-3d-domain-adaption","title":"PointDAN: A Multi-Scale 3D Domain Adaption Network for Point Cloud Representation","date":"2019-11-07","arxiv_id":"1911.02744","repositories_listed":2,"syntology":null}],"record_sha256":"9828ee8e2d415125d2025b65f41633fe24ad05c79e032b9d05bbc6f566a499f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}