{"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":"/paper/domain-adaptation-with-randomized-expectation","title":"Domain Adaptation with Randomized Expectation Maximization","arxiv_id":"1803.07634","date":"2018-03-20","proceeding":null,"authors":["Twan van Laarhoven","Elena Marchiori"],"abstract":"Domain adaptation (DA) is the task of classifying an unlabeled dataset\n(target) using a labeled dataset (source) from a related domain. The majority\nof successful DA methods try to directly match the distributions of the source\nand target data by transforming the feature space. Despite their success, state\nof the art methods based on this approach are either involved or unable to\ndirectly scale to data with many features. This article shows that domain\nadaptation can be successfully performed by using a very simple randomized\nexpectation maximization (EM) method. We consider two instances of the method,\nwhich involve logistic regression and support vector machine, respectively. The\nunderlying assumption of the proposed method is the existence of a good single\nlinear classifier for both source and target domain. The potential limitations\nof this assumption are alleviated by the flexibility of the method, which can\ndirectly incorporate deep features extracted from a pre-trained deep neural\nnetwork. The resulting algorithm is strikingly easy to implement and apply. We\ntest its performance on 36 real-life adaptation tasks over text and image data\nwith diverse characteristics. The method achieves state-of-the-art results,\ncompetitive with those of involved end-to-end deep transfer-learning methods.","url_abs":"http://arxiv.org/abs/1803.07634v1","url_pdf":"http://arxiv.org/pdf/1803.07634v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"domain-adaptation-with-randomized-expectation","repo_url":"https://github.com/twanvl/adrem","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"twanvl/adrem","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"81f17f15d760fb2059ebb24f5718b313c7edb9d5b233235f7c620285e7a4debd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}