{"id":38973,"date":"2026-08-21T15:27:30","date_gmt":"2026-08-21T15:27:30","guid":{"rendered":"https:\/\/lamarr-institute.org\/publication\/interactive-pareto-navigation-for-deep-multi-task-learning\/"},"modified":"2026-09-17T11:17:26","modified_gmt":"2026-09-17T11:17:26","slug":"interactive-pareto-navigation-for-deep-multi-task-learning","status":"publish","type":"publication","link":"https:\/\/lamarr-institute.org\/de\/publication\/interactive-pareto-navigation-for-deep-multi-task-learning\/","title":{"rendered":"Interactive Pareto navigation for deep multi-task learning"},"content":{"rendered":"<p>In multi-task learning, handling an increasing number of objectives can quickly become challenging, both in terms of the computational resources and the decision maker&#8217;s capacity to choose appropriate trade-offs. A widely used approach is thus to aggregate the individual losses in a single loss function by a weighted sum. This often fails to capture either the decision maker&#8217;s preferences as a result of the shape of the Pareto front, or requires multiple adjustments and computations which becomes prohibitively expensive in deep learning applications. To address these issues, we introduce a novel framework, Preference Pareto Exploration (PPE), which enforces the decision maker&#8217;s preferences while accounting for the geometry of the Pareto set in an interactive exploration process. PPE is based on a predictor-corrector method that performs predictor steps tangential to the manifold of Pareto-optimal solutions, following the decision maker&#8217;s preference. The subsequent corrector step results in a new trade-off reflecting this preference. To avoid explicit Hessian computations when characterizing the tangent space of the manifold, we employ a Krylov subspace method that relies solely on matrix-vector products. These products can be efficiently obtained via automatic differentiation, ensuring both efficiency and robustness throughout the optimization process. The method&#8217;s functionality and performance are demonstrated using both toy problems and examples from deep learning.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In multi-task learning, handling an increasing number of objectives can quickly become challenging, both in terms of the computational resources and the decision maker&#8217;s capacity to choose appropriate trade-offs. A widely used approach is thus to aggregate the individual losses in a single loss function by a weighted sum. This often fails to capture either the decision maker&#8217;s preferences as a result of the shape of the Pareto front, or [&hellip;]<\/p>\n","protected":false},"author":14,"featured_media":0,"template":"","meta":{"_acf_changed":false,"footnotes":""},"publication-type":[30],"class_list":["post-38973","publication","type-publication","status-publish","hentry","publication-type-article"],"acf":[],"publishpress_future_workflow_manual_trigger":{"enabledWorkflows":[]},"_links":{"self":[{"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/publication\/38973","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/publication"}],"about":[{"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/types\/publication"}],"author":[{"embeddable":true,"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/users\/14"}],"version-history":[{"count":0,"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/publication\/38973\/revisions"}],"wp:attachment":[{"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/media?parent=38973"}],"wp:term":[{"taxonomy":"publication-type","embeddable":true,"href":"https:\/\/lamarr-institute.org\/de\/wp-json\/wp\/v2\/publication-type?post=38973"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}