{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/efficient-continuous-pareto-exploration-in","title":"Efficient Continuous Pareto Exploration in Multi-Task Learning","arxiv_id":"2006.16434","date":"2020-06-29","proceeding":"ICML 2020 1","authors":["Pingchuan Ma","Tao Du","Wojciech Matusik"],"abstract":"Tasks in multi-task learning often correlate, conflict, or even compete with each other. As a result, a single solution that is optimal for all tasks rarely exists. Recent papers introduced the concept of Pareto optimality to this field and directly cast multi-task learning as multi-objective optimization problems, but solutions returned by existing methods are typically finite, sparse, and discrete. We present a novel, efficient method that generates locally continuous Pareto sets and Pareto fronts, which opens up the possibility of continuous analysis of Pareto optimal solutions in machine learning problems. We scale up theoretical results in multi-objective optimization to modern machine learning problems by proposing a sample-based sparse linear system, for which standard Hessian-free solvers in machine learning can be applied. We compare our method to the state-of-the-art algorithms and demonstrate its usage of analyzing local Pareto sets on various multi-task classification and regression problems. The experimental results confirm that our algorithm reveals the primary directions in local Pareto sets for trade-off balancing, finds more solutions with different trade-offs efficiently, and scales well to tasks with millions of parameters.","url_abs":"https://arxiv.org/abs/2006.16434v2","url_pdf":"https://arxiv.org/pdf/2006.16434v2.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":"efficient-continuous-pareto-exploration-in","repo_url":"https://github.com/mit-gfx/ContinuousParetoMTL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"multiobjective-optimization","task_name":"Multiobjective Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2006.16434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16434"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/mit-gfx/ContinuousParetoMTL","reach":null}],"summary":{"ran_draft_wrong":1,"ran_honours":1,"ran_fixture":3},"by_repo_kind":{"official":{"samples":5,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":5,"samples":[{"code_sha256_prefix":"6b4535e71b3443c9","entry":"_min_norm_2d","repo":"mit-gfx/ContinuousParetoMTL","repo_kind":"official","path":"pareto/optim/min_norm_solver.py","file_url":"https://github.com/mit-gfx/ContinuousParetoMTL/blob/HEAD/pareto/optim/min_norm_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6b4535e71b3443c9"}},{"code_sha256_prefix":"62754f5394a78501","entry":"_min_norm_element_from2","repo":"mit-gfx/ContinuousParetoMTL","repo_kind":"official","path":"pareto/optim/min_norm_solver.py","file_url":"https://github.com/mit-gfx/ContinuousParetoMTL/blob/HEAD/pareto/optim/min_norm_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"62754f5394a78501"}},{"code_sha256_prefix":"1de2512786c971c3","entry":"_next_point","repo":"mit-gfx/ContinuousParetoMTL","repo_kind":"official","path":"pareto/optim/min_norm_solver.py","file_url":"https://github.com/mit-gfx/ContinuousParetoMTL/blob/HEAD/pareto/optim/min_norm_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1de2512786c971c3"}},{"code_sha256_prefix":"a4ce8c4af95a958f","entry":"_projection2simplex","repo":"mit-gfx/ContinuousParetoMTL","repo_kind":"official","path":"pareto/optim/min_norm_solver.py","file_url":"https://github.com/mit-gfx/ContinuousParetoMTL/blob/HEAD/pareto/optim/min_norm_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a4ce8c4af95a958f"}},{"code_sha256_prefix":"0cd42644b034aaaf","entry":"find_min_norm_element","repo":"mit-gfx/ContinuousParetoMTL","repo_kind":"official","path":"pareto/optim/min_norm_solver.py","file_url":"https://github.com/mit-gfx/ContinuousParetoMTL/blob/HEAD/pareto/optim/min_norm_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"0cd42644b034aaaf"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}