<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Multi-Objective Optimization for Sparse Deep Multi-Task Learning</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Sedjro Salomon</namePart>
  <namePart type="family">Hotegni</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">97995</identifier></name>
<name type="personal">
  <namePart type="given">Manuel Bastian</namePart>
  <namePart type="family">Berkemeier</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">51701</identifier></name>
<name type="personal">
  <namePart type="given">Sebastian</namePart>
  <namePart type="family">Peitz</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">47427</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-3389-793X</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">655</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>2024 International Joint Conference on Neural Networks (IJCNN)</namePart>
</name>






<abstract lang="eng">Different conflicting optimization criteria arise naturally in various Deep
Learning scenarios. These can address different main tasks (i.e., in the
setting of Multi-Task Learning), but also main and secondary tasks such as loss
minimization versus sparsity. The usual approach is a simple weighting of the
criteria, which formally only works in the convex setting. In this paper, we
present a Multi-Objective Optimization algorithm using a modified Weighted
Chebyshev scalarization for training Deep Neural Networks (DNNs) with respect
to several tasks. By employing this scalarization technique, the algorithm can
identify all optimal solutions of the original problem while reducing its
complexity to a sequence of single-objective problems. The simplified problems
are then solved using an Augmented Lagrangian method, enabling the use of
popular optimization techniques such as Adam and Stochastic Gradient Descent,
while efficaciously handling constraints. Our work aims to address the
(economical and also ecological) sustainability issue of DNN models, with a
particular focus on Deep Multi-Task models, which are typically designed with a
very large number of weights to perform equally well on multiple tasks. Through
experiments conducted on two Machine Learning datasets, we demonstrate the
possibility of adaptively sparsifying the model during training without
significantly impacting its performance, if we are willing to apply
task-specific adaptations to the network weights. Code is available at
https://github.com/salomonhotegni/MDMTN.</abstract>

<originInfo><publisher>IEEE</publisher><dateIssued encoding="w3cdtf">2024</dateIssued><place><placeTerm type="text">Yokohama, Japan</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>2024 International Joint Conference on Neural Networks (IJCNN)</title></titleInfo>
  <identifier type="eIssn"> 2161-4407</identifier><identifier type="doi">10.1109/IJCNN60899.2024.10650994</identifier>
<part><extent unit="pages">9</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>S.S. Hotegni, M.B. Berkemeier, S. Peitz, in: 2024 International Joint Conference on Neural Networks (IJCNN), IEEE, Yokohama, Japan, 2024, p. 9.</short>
<ama>Hotegni SS, Berkemeier MB, Peitz S. Multi-Objective Optimization for Sparse Deep Multi-Task Learning. In: &lt;i&gt;2024 International Joint Conference on Neural Networks (IJCNN)&lt;/i&gt;. IEEE; 2024:9. doi:&lt;a href=&quot;https://doi.org/10.1109/IJCNN60899.2024.10650994&quot;&gt;10.1109/IJCNN60899.2024.10650994&lt;/a&gt;</ama>
<chicago>Hotegni, Sedjro Salomon, Manuel Bastian Berkemeier, and Sebastian Peitz. “Multi-Objective Optimization for Sparse Deep Multi-Task Learning.” In &lt;i&gt;2024 International Joint Conference on Neural Networks (IJCNN)&lt;/i&gt;, 9. Yokohama, Japan: IEEE, 2024. &lt;a href=&quot;https://doi.org/10.1109/IJCNN60899.2024.10650994&quot;&gt;https://doi.org/10.1109/IJCNN60899.2024.10650994&lt;/a&gt;.</chicago>
<bibtex>@inproceedings{Hotegni_Berkemeier_Peitz_2024, place={Yokohama, Japan}, title={Multi-Objective Optimization for Sparse Deep Multi-Task Learning}, DOI={&lt;a href=&quot;https://doi.org/10.1109/IJCNN60899.2024.10650994&quot;&gt;10.1109/IJCNN60899.2024.10650994&lt;/a&gt;}, booktitle={2024 International Joint Conference on Neural Networks (IJCNN)}, publisher={IEEE}, author={Hotegni, Sedjro Salomon and Berkemeier, Manuel Bastian and Peitz, Sebastian}, year={2024}, pages={9} }</bibtex>
<mla>Hotegni, Sedjro Salomon, et al. “Multi-Objective Optimization for Sparse Deep Multi-Task Learning.” &lt;i&gt;2024 International Joint Conference on Neural Networks (IJCNN)&lt;/i&gt;, IEEE, 2024, p. 9, doi:&lt;a href=&quot;https://doi.org/10.1109/IJCNN60899.2024.10650994&quot;&gt;10.1109/IJCNN60899.2024.10650994&lt;/a&gt;.</mla>
<apa>Hotegni, S. S., Berkemeier, M. B., &amp;#38; Peitz, S. (2024). Multi-Objective Optimization for Sparse Deep Multi-Task Learning. &lt;i&gt;2024 International Joint Conference on Neural Networks (IJCNN)&lt;/i&gt;, 9. &lt;a href=&quot;https://doi.org/10.1109/IJCNN60899.2024.10650994&quot;&gt;https://doi.org/10.1109/IJCNN60899.2024.10650994&lt;/a&gt;</apa>
<ieee>S. S. Hotegni, M. B. Berkemeier, and S. Peitz, “Multi-Objective Optimization for Sparse Deep Multi-Task Learning,” in &lt;i&gt;2024 International Joint Conference on Neural Networks (IJCNN)&lt;/i&gt;, Yokohama, Japan, 2024, p. 9, doi: &lt;a href=&quot;https://doi.org/10.1109/IJCNN60899.2024.10650994&quot;&gt;10.1109/IJCNN60899.2024.10650994&lt;/a&gt;.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>46649</recordIdentifier><recordCreationDate encoding="w3cdtf">2023-08-24T07:44:36Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-09-27T10:24:22Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
