{"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/multitask-learning-a-knowledge-based-source","title":"Multitask Learning: A Knowledge-Based Source of Inductive Bias","arxiv_id":null,"date":"1993-01-01","proceeding":"ICML 1993 1","authors":["Richard A. Caruana"],"abstract":"This paper suggests that it may be easier to learn\r\nseveral hard tasks at one time than to learn these\r\nsame tasks separately. In effect, the information provided by the training signal for each task\r\nserves as a domain-specific inductive bias for the\r\nother tasks. Frequently the world gives us clusters\r\nof related tasks to learn. When it does not, it is often straightforward to create additional tasks. For\r\nmany domains, acquiring inductive bias by collecting additional teaching signal may be more\r\npractical than the traditional approach of codifying domain-specific biases acquired from human\r\nexpertise. We call this approach Multitask Learning (MTL). Since much of the power of an inductive learner follows directly from its inductive\r\nbias, multitask learning may yield more powerful learning. An empirical example of multitask\r\nconnectionist learning is presented where learning improves by training one network on several\r\nrelated tasks at the same time. Multitask decision\r\ntree induction is also outlined.","url_abs":"https://www.semanticscholar.org/paper/Multitask-Learning%3A-A-Knowledge-Based-Source-of-Caruana/9464d15f4f8d578f93332db4aa1c9c182fd51735","url_pdf":"http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=F45CA386897E5A6EBCF74D5DBAC85A13?doi=10.1.1.57.3196&rep=rep1&type=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":"multitask-learning-a-knowledge-based-source","repo_url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/2.1.0/models/multitask/share_bottom","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"multitask-learning-a-knowledge-based-source","repo_url":"https://github.com/shenweichen/DeepCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"inductive-bias","task_name":"Inductive Bias"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"PaddlePaddle/PaddleRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.05125"],"harvested_for_calls":[{"arxiv_id":"2204.05125","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.05125"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.05125\")"}]},{"repo":"shenweichen/DeepCTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1803.05170"],"harvested_for_calls":[{"arxiv_id":"1803.05170","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.05170"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.05170\")"}]}],"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":"e5dd2f495f8f6c470219d0bebc3467b9b49bd08d4c9ba966645ef7faca04e30c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}