{"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/target-contrastive-pessimistic-risk-for","title":"Target contrastive pessimistic risk for robust domain adaptation","arxiv_id":"1706.08082","date":"2017-06-25","proceeding":null,"authors":["Wouter M. Kouw","Marco Loog"],"abstract":"In domain adaptation, classifiers with information from a source domain adapt\nto generalize to a target domain. However, an adaptive classifier can perform\nworse than a non-adaptive classifier due to invalid assumptions, increased\nsensitivity to estimation errors or model misspecification. Our goal is to\ndevelop a domain-adaptive classifier that is robust in the sense that it does\nnot rely on restrictive assumptions on how the source and target domains relate\nto each other and that it does not perform worse than the non-adaptive\nclassifier. We formulate a conservative parameter estimator that only deviates\nfrom the source classifier when a lower risk is guaranteed for all possible\nlabellings of the given target samples. We derive the classical least-squares\nand discriminant analysis cases and show that these perform on par with\nstate-of-the-art domain adaptive classifiers in sample selection bias settings,\nwhile outperforming them in more general domain adaptation settings.","url_abs":"http://arxiv.org/abs/1706.08082v1","url_pdf":"http://arxiv.org/pdf/1706.08082v1.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":"target-contrastive-pessimistic-risk-for","repo_url":"https://github.com/wmkouw/libTLDA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"selection-bias","task_name":"Selection bias"}],"methods":[],"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":"wmkouw/libTLDA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1901.05335"],"harvested_for_calls":[{"arxiv_id":"1901.05335","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.05335"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.05335\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"1ca7ee607d123d800d3eaac5b5cb24b9c0a1e88ed464e4ea018fde1345792054","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}