{"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/auxiliary-tasks-in-multi-task-learning","title":"Auxiliary Tasks in Multi-task Learning","arxiv_id":"1805.06334","date":"2018-05-16","proceeding":null,"authors":["Lukas Liebel","Marco Körner"],"abstract":"Multi-task convolutional neural networks (CNNs) have shown impressive results\nfor certain combinations of tasks, such as single-image depth estimation (SIDE)\nand semantic segmentation. This is achieved by pushing the network towards\nlearning a robust representation that generalizes well to different atomic\ntasks. We extend this concept by adding auxiliary tasks, which are of minor\nrelevance for the application, to the set of learned tasks. As a kind of\nadditional regularization, they are expected to boost the performance of the\nultimately desired main tasks. To study the proposed approach, we picked\nvision-based road scene understanding (RSU) as an exemplary application. Since\nmulti-task learning requires specialized datasets, particularly when using\nextensive sets of tasks, we provide a multi-modal dataset for multi-task RSU,\ncalled synMT. More than 2.5 $\\cdot$ 10^5 synthetic images, annotated with 21\ndifferent labels, were acquired from the video game Grand Theft Auto V (GTA V).\nOur proposed deep multi-task CNN architecture was trained on various\ncombination of tasks using synMT. The experiments confirmed that auxiliary\ntasks can indeed boost network performance, both in terms of final results and\ntraining time.","url_abs":"http://arxiv.org/abs/1805.06334v2","url_pdf":"http://arxiv.org/pdf/1805.06334v2.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":"auxiliary-tasks-in-multi-task-learning","repo_url":"https://github.com/Mikoto10032/AutomaticWeightedLoss","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"auxiliary-tasks-in-multi-task-learning","repo_url":"https://github.com/MindCode-4/code-11/tree/main/auxiliary-tasks-in-multi-task-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"auxiliary-tasks-in-multi-task-learning","repo_url":"https://github.com/MindCode-4/code-6/tree/main/auxiliary-tasks-in-multi-task-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"depth-estimation","task_name":"Depth Estimation"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"scene-understanding","task_name":"Scene Understanding"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"road-scene-understanding","task_name":"road scene understanding"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.06334","atlas_url":"https://app.syntology.ai/?focus=1805.06334","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":"1805.06334"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.06334\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.06334"},"call":"get_concepts_for_paper(arxiv_id=\"1805.06334\")"}],"by_repo":[{"repo":"Mikoto10032/AutomaticWeightedLoss","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindCode-4/code-11","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.06645"],"harvested_for_calls":[{"arxiv_id":"2407.06645","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.06645"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.06645\")"}]},{"repo":"MindCode-4/code-6","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"4827590f9fafbcdad172a16309b8037cecfd642bfa7bff8c076fdb8fc93f0dce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}