{"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-asymmetrically-relaxed","title":"Domain Adaptation with Asymmetrically-Relaxed Distribution Alignment","arxiv_id":"1903.01689","date":"2019-03-05","proceeding":"ICLR Workshop LLD 2019","authors":["Yifan Wu","Ezra Winston","Divyansh Kaushik","Zachary Lipton"],"abstract":"Domain adaptation addresses the common problem when the target distribution\ngenerating our test data drifts from the source (training) distribution. While\nabsent assumptions, domain adaptation is impossible, strict conditions, e.g.\ncovariate or label shift, enable principled algorithms. Recently-proposed\ndomain-adversarial approaches consist of aligning source and target encodings,\noften motivating this approach as minimizing two (of three) terms in a\ntheoretical bound on target error. Unfortunately, this minimization can cause\narbitrary increases in the third term, e.g. they can break down under shifting\nlabel distributions. We propose asymmetrically-relaxed distribution alignment,\na new approach that overcomes some limitations of standard domain-adversarial\nalgorithms. Moreover, we characterize precise assumptions under which our\nalgorithm is theoretically principled and demonstrate empirical benefits on\nboth synthetic and real datasets.","url_abs":"http://arxiv.org/abs/1903.01689v2","url_pdf":"http://arxiv.org/pdf/1903.01689v2.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-asymmetrically-relaxed","repo_url":"https://github.com/timgaripov/asa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.01689","atlas_url":"https://app.syntology.ai/?focus=1903.01689","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1903.01689"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.01689\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.01689"},"call":"get_concepts_for_paper(arxiv_id=\"1903.01689\")"}],"by_repo":[{"repo":"timgaripov/asa","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["1505.07818","2003.04475","2203.08908"],"harvested_for_calls":[{"arxiv_id":"1505.07818","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.07818"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.07818\")"},{"arxiv_id":"2003.04475","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.04475"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.04475\")"},{"arxiv_id":"2203.08908","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.08908"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.08908\")"}]}],"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":"c5fb08f939b1bd507c7ee6b41c920573e25a0bc5f41061186901285100c6850d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}