{"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/asynchronous-multi-task-learning","title":"Asynchronous Multi-Task Learning","arxiv_id":"1609.09563","date":"2016-09-30","proceeding":null,"authors":["Inci M. Baytas","Ming Yan","Anil K. Jain","Jiayu Zhou"],"abstract":"Many real-world machine learning applications involve several learning tasks\nwhich are inter-related. For example, in healthcare domain, we need to learn a\npredictive model of a certain disease for many hospitals. The models for each\nhospital may be different because of the inherent differences in the\ndistributions of the patient populations. However, the models are also closely\nrelated because of the nature of the learning tasks modeling the same disease.\nBy simultaneously learning all the tasks, multi-task learning (MTL) paradigm\nperforms inductive knowledge transfer among tasks to improve the generalization\nperformance. When datasets for the learning tasks are stored at different\nlocations, it may not always be feasible to transfer the data to provide a\ndata-centralized computing environment due to various practical issues such as\nhigh data volume and privacy. In this paper, we propose a principled MTL\nframework for distributed and asynchronous optimization to address the\naforementioned challenges. In our framework, gradient update does not wait for\ncollecting the gradient information from all the tasks. Therefore, the proposed\nmethod is very efficient when the communication delay is too high for some task\nnodes. We show that many regularized MTL formulations can benefit from this\nframework, including the low-rank MTL for shared subspace learning. Empirical\nstudies on both synthetic and real-world datasets demonstrate the efficiency\nand effectiveness of the proposed framework.","url_abs":"http://arxiv.org/abs/1609.09563v1","url_pdf":"http://arxiv.org/pdf/1609.09563v1.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":"asynchronous-multi-task-learning","repo_url":"https://github.com/illidanlab/AMTL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1609.09563","atlas_url":"https://app.syntology.ai/?focus=1609.09563","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":"1609.09563"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1609.09563\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1609.09563"},"call":"get_concepts_for_paper(arxiv_id=\"1609.09563\")"}],"by_repo":[{"repo":"illidanlab/AMTL","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":"69e408d88cd0bd93568e86ccdd1c0be8a7178499d2ae08af2d34c745a9122833","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}