{"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/transductive-adversarial-networks-tan","title":"Transductive Adversarial Networks (TAN)","arxiv_id":"1802.02798","date":"2018-02-08","proceeding":null,"authors":["Sean Rowan"],"abstract":"Transductive Adversarial Networks (TAN) is a novel domain-adaptation machine\nlearning framework that is designed for learning a conditional probability\ndistribution on unlabelled input data in a target domain, while also only\nhaving access to: (1) easily obtained labelled data from a related source\ndomain, which may have a different conditional probability distribution than\nthe target domain, and (2) a marginalised prior distribution on the labels for\nthe target domain. TAN leverages a fully adversarial training procedure and a\nunique generator/encoder architecture which approximates the transductive\ncombination of the available source- and target-domain data. A benefit of TAN\nis that it allows the distance between the source- and target-domain\nlabel-vector marginal probability distributions to be greater than 0 (i.e.\ndifferent tasks across the source and target domains) whereas other\ndomain-adaptation algorithms require this distance to equal 0 (i.e. a single\ntask across the source and target domains). TAN can, however, still handle the\nlatter case and is a more generalised approach to this case. Another benefit of\nTAN is that due to being a fully adversarial algorithm, it has the potential to\naccurately approximate highly complex distributions. Theoretical analysis\ndemonstrates the viability of the TAN framework.","url_abs":"http://arxiv.org/abs/1802.02798v1","url_pdf":"http://arxiv.org/pdf/1802.02798v1.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":"transductive-adversarial-networks-tan","repo_url":"https://github.com/sean-rowan/tan","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"transductive-adversarial-networks-tan","repo_url":"https://github.com/seanrowan/tan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"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":"sean-rowan/tan","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"seanrowan/tan","kind":"listed","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":"ae3986097d3a10904a39ff41fc65dabf8dabeda23bb8e9819a18922b90c2d92f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}