Hierarchical multi-task learning with application to wafer quality prediction

Jingrui He, Yada Zhu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Many real problems of multi-task learning exhibit hierarchical task relatedness. In other words, the tasks are partitioned into multiple groups. Different tasks within the same group are related on the task-level, whereas different groups are related on the group-level. For example, in semiconductor manufacturing, the problem of wafer quality prediction can be considered as hierarchical multi-task learning, where each task corresponds to a single side of a chamber with side-level relatedness, and a group of tasks corresponds to a chamber of multiple sides with chamber-level relatedness. Motivated by this application, in this paper, we propose an optimization framework for hierarchical multi-task learning, which partitions all the input features into 2 sets based on their characteristics, and models task-level and group-level relatedness by imposing different constraints on the coefficient vectors of the 2 sets. This is different from existing work on task clustering where the goal is to uncover the grouping of tasks, the tasks do not exhibit group-level relatedness, and the input features are not discriminated in the prediction model to model task-level and group-level relatedness. To solve this framework, we propose the HEAR algorithm based on block coordinate descent, and demonstrate its effectiveness on both synthetic and real data sets from domains of semiconductor manufacturing and document classification.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Data Mining, ICDM
Pages290-298
Number of pages9
DOIs
StatePublished - 2012
Externally publishedYes
Event12th IEEE International Conference on Data Mining, ICDM 2012 - Brussels, Belgium
Duration: Dec 10 2012Dec 13 2012

Other

Other12th IEEE International Conference on Data Mining, ICDM 2012
CountryBelgium
CityBrussels
Period12/10/1212/13/12

Fingerprint

Semiconductor materials

Keywords

  • Hierarchical multi-task learning
  • Task relatedness
  • Wafer quality

ASJC Scopus subject areas

  • Engineering(all)

Cite this

He, J., & Zhu, Y. (2012). Hierarchical multi-task learning with application to wafer quality prediction. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 290-298). [6413894] https://doi.org/10.1109/ICDM.2012.63

Hierarchical multi-task learning with application to wafer quality prediction. / He, Jingrui; Zhu, Yada.

Proceedings - IEEE International Conference on Data Mining, ICDM. 2012. p. 290-298 6413894.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

He, J & Zhu, Y 2012, Hierarchical multi-task learning with application to wafer quality prediction. in Proceedings - IEEE International Conference on Data Mining, ICDM., 6413894, pp. 290-298, 12th IEEE International Conference on Data Mining, ICDM 2012, Brussels, Belgium, 12/10/12. https://doi.org/10.1109/ICDM.2012.63
He J, Zhu Y. Hierarchical multi-task learning with application to wafer quality prediction. In Proceedings - IEEE International Conference on Data Mining, ICDM. 2012. p. 290-298. 6413894 https://doi.org/10.1109/ICDM.2012.63
He, Jingrui ; Zhu, Yada. / Hierarchical multi-task learning with application to wafer quality prediction. Proceedings - IEEE International Conference on Data Mining, ICDM. 2012. pp. 290-298
@inproceedings{669705c05bd742dc8b01ec9ac56ac977,
title = "Hierarchical multi-task learning with application to wafer quality prediction",
abstract = "Many real problems of multi-task learning exhibit hierarchical task relatedness. In other words, the tasks are partitioned into multiple groups. Different tasks within the same group are related on the task-level, whereas different groups are related on the group-level. For example, in semiconductor manufacturing, the problem of wafer quality prediction can be considered as hierarchical multi-task learning, where each task corresponds to a single side of a chamber with side-level relatedness, and a group of tasks corresponds to a chamber of multiple sides with chamber-level relatedness. Motivated by this application, in this paper, we propose an optimization framework for hierarchical multi-task learning, which partitions all the input features into 2 sets based on their characteristics, and models task-level and group-level relatedness by imposing different constraints on the coefficient vectors of the 2 sets. This is different from existing work on task clustering where the goal is to uncover the grouping of tasks, the tasks do not exhibit group-level relatedness, and the input features are not discriminated in the prediction model to model task-level and group-level relatedness. To solve this framework, we propose the HEAR algorithm based on block coordinate descent, and demonstrate its effectiveness on both synthetic and real data sets from domains of semiconductor manufacturing and document classification.",
keywords = "Hierarchical multi-task learning, Task relatedness, Wafer quality",
author = "Jingrui He and Yada Zhu",
year = "2012",
doi = "10.1109/ICDM.2012.63",
language = "English (US)",
isbn = "9780769549057",
pages = "290--298",
booktitle = "Proceedings - IEEE International Conference on Data Mining, ICDM",

}

TY - GEN

T1 - Hierarchical multi-task learning with application to wafer quality prediction

AU - He, Jingrui

AU - Zhu, Yada

PY - 2012

Y1 - 2012

N2 - Many real problems of multi-task learning exhibit hierarchical task relatedness. In other words, the tasks are partitioned into multiple groups. Different tasks within the same group are related on the task-level, whereas different groups are related on the group-level. For example, in semiconductor manufacturing, the problem of wafer quality prediction can be considered as hierarchical multi-task learning, where each task corresponds to a single side of a chamber with side-level relatedness, and a group of tasks corresponds to a chamber of multiple sides with chamber-level relatedness. Motivated by this application, in this paper, we propose an optimization framework for hierarchical multi-task learning, which partitions all the input features into 2 sets based on their characteristics, and models task-level and group-level relatedness by imposing different constraints on the coefficient vectors of the 2 sets. This is different from existing work on task clustering where the goal is to uncover the grouping of tasks, the tasks do not exhibit group-level relatedness, and the input features are not discriminated in the prediction model to model task-level and group-level relatedness. To solve this framework, we propose the HEAR algorithm based on block coordinate descent, and demonstrate its effectiveness on both synthetic and real data sets from domains of semiconductor manufacturing and document classification.

AB - Many real problems of multi-task learning exhibit hierarchical task relatedness. In other words, the tasks are partitioned into multiple groups. Different tasks within the same group are related on the task-level, whereas different groups are related on the group-level. For example, in semiconductor manufacturing, the problem of wafer quality prediction can be considered as hierarchical multi-task learning, where each task corresponds to a single side of a chamber with side-level relatedness, and a group of tasks corresponds to a chamber of multiple sides with chamber-level relatedness. Motivated by this application, in this paper, we propose an optimization framework for hierarchical multi-task learning, which partitions all the input features into 2 sets based on their characteristics, and models task-level and group-level relatedness by imposing different constraints on the coefficient vectors of the 2 sets. This is different from existing work on task clustering where the goal is to uncover the grouping of tasks, the tasks do not exhibit group-level relatedness, and the input features are not discriminated in the prediction model to model task-level and group-level relatedness. To solve this framework, we propose the HEAR algorithm based on block coordinate descent, and demonstrate its effectiveness on both synthetic and real data sets from domains of semiconductor manufacturing and document classification.

KW - Hierarchical multi-task learning

KW - Task relatedness

KW - Wafer quality

UR - http://www.scopus.com/inward/record.url?scp=84874061480&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874061480&partnerID=8YFLogxK

U2 - 10.1109/ICDM.2012.63

DO - 10.1109/ICDM.2012.63

M3 - Conference contribution

SN - 9780769549057

SP - 290

EP - 298

BT - Proceedings - IEEE International Conference on Data Mining, ICDM

ER -