{"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/regressive-domain-adaptation-for-unsupervised","title":"Regressive Domain Adaptation for Unsupervised Keypoint Detection","arxiv_id":"2103.06175","date":"2021-03-10","proceeding":"CVPR 2021 1","authors":["Junguang Jiang","Yifei Ji","Ximei Wang","Yufeng Liu","Jianmin Wang","Mingsheng Long"],"abstract":"Domain adaptation (DA) aims at transferring knowledge from a labeled source domain to an unlabeled target domain. Though many DA theories and algorithms have been proposed, most of them are tailored into classification settings and may fail in regression tasks, especially in the practical keypoint detection task. To tackle this difficult but significant task, we present a method of regressive domain adaptation (RegDA) for unsupervised keypoint detection. Inspired by the latest theoretical work, we first utilize an adversarial regressor to maximize the disparity on the target domain and train a feature generator to minimize this disparity. However, due to the high dimension of the output space, this regressor fails to detect samples that deviate from the support of the source. To overcome this problem, we propose two important ideas. First, based on our observation that the probability density of the output space is sparse, we introduce a spatial probability distribution to describe this sparsity and then use it to guide the learning of the adversarial regressor. Second, to alleviate the optimization difficulty in the high-dimensional space, we innovatively convert the minimax game in the adversarial training to the minimization of two opposite goals. Extensive experiments show that our method brings large improvement by 8% to 11% in terms of PCK on different datasets.","url_abs":"https://arxiv.org/abs/2103.06175v2","url_pdf":"https://arxiv.org/pdf/2103.06175v2.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":"regressive-domain-adaptation-for-unsupervised","repo_url":"https://github.com/thuml/Regressive-Domain-Adaptation-for-Unsupervised-Keypoint-Detection","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"regressive-domain-adaptation-for-unsupervised","repo_url":"https://github.com/thuml/Transfer-Learning-Library/tree/dev-tllib/examples/domain_adaptation/keypoint_detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"keypoint-detection","task_name":"Keypoint Detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2103.06175","atlas_url":"https://app.syntology.ai/?focus=2103.06175","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":"2103.06175"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2103.06175\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2103.06175"},"call":"get_concepts_for_paper(arxiv_id=\"2103.06175\")"}],"by_repo":[{"repo":"thuml/Regressive-Domain-Adaptation-for-Unsupervised-Keypoint-Detection","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thuml/Transfer-Learning-Library","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":7,"harvested_for":["1409.7495","1502.02791","1607.01719","1702.05464","1811.12833","1904.05801","2001.01526"],"harvested_for_calls":[{"arxiv_id":"1409.7495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1409.7495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1409.7495\")"},{"arxiv_id":"1502.02791","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.02791"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.02791\")"},{"arxiv_id":"1607.01719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.01719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.01719\")"},{"arxiv_id":"1702.05464","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.05464"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.05464\")"},{"arxiv_id":"1811.12833","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.12833"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.12833\")"},{"arxiv_id":"1904.05801","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.05801"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.05801\")"},{"arxiv_id":"2001.01526","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.01526"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.01526\")"}]}],"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":"601d6245449069b6df7573456a41d6e605c29096dc43c916b5fc4188ad50e0f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}