TY - GEN
T1 - Not all domains are equally complex
T2 - 25th International Conference on Pattern Recognition, ICPR 2020
AU - Senhaji, Ali
AU - Raitoharju, Jenni
AU - Gabbouj, Moncef
AU - Iosifidis, Alexandros
N1 - Funding Information:
This work was supported by Business Finland and NSF CVDI project AMALIA co-funded by Dead Set Bit and TietoEvry. Special thanks to Pauli Ervi (Dead Set Bit) and Tomi Teikko and Matti Vakkuri (TietoEvry) for their support.
Publisher Copyright:
© 2020 IEEE
PY - 2021
Y1 - 2021
N2 - Deep learning approaches are highly specialized and require training separate models for different tasks. Multi-domain learning looks at ways to learn a multitude of different tasks, each coming from a different domain, at once. The most common approach in multi-domain learning is to form a domain agnostic model, the parameters of which are shared among all domains, and learn a small number of extra domain-specific parameters for each individual new domain. However, different domains come with different levels of difficulty; parameterizing the models of all domains using an augmented version of the domain agnostic model leads to unnecessarily inefficient solutions, especially for easy to solve tasks. We propose an adaptive parameterization approach to deep neural networks for multidomain learning. The proposed approach performs on par with the original approach while reducing by far the number of parameters, leading to efficient multi-domain learning solutions.
AB - Deep learning approaches are highly specialized and require training separate models for different tasks. Multi-domain learning looks at ways to learn a multitude of different tasks, each coming from a different domain, at once. The most common approach in multi-domain learning is to form a domain agnostic model, the parameters of which are shared among all domains, and learn a small number of extra domain-specific parameters for each individual new domain. However, different domains come with different levels of difficulty; parameterizing the models of all domains using an augmented version of the domain agnostic model leads to unnecessarily inefficient solutions, especially for easy to solve tasks. We propose an adaptive parameterization approach to deep neural networks for multidomain learning. The proposed approach performs on par with the original approach while reducing by far the number of parameters, leading to efficient multi-domain learning solutions.
U2 - 10.1109/ICPR48806.2021.9412215
DO - 10.1109/ICPR48806.2021.9412215
M3 - Conference contribution
AN - SCOPUS:85110442948
T3 - Proceedings - International Conference on Pattern Recognition
SP - 8663
EP - 8670
BT - Proceedings of ICPR 2020 - 25th International Conference on Pattern Recognition
PB - IEEE
Y2 - 10 January 2021 through 15 January 2021
ER -