TY - GEN
T1 - Weighted Contrastive Learning With False Negative Control to Help Long-tailed Product Classifcation
AU - Wang, Tianqi
AU - Chen, Lei
AU - Zhu, Xiaodan
AU - Lee, Younghun
AU - Gao, Jing
N1 - Publisher Copyright:
© ACL 2023.All rights reserved.
PY - 2023
Y1 - 2023
N2 - Item categorization (IC) aims to classify product descriptions into leaf nodes in a categorical taxonomy, which is a key technology used in a wide range of applications. Along with the fact that most datasets often has a long-tailed distribution, classifcation performances on tail labels tend to be poor due to scarce supervision, causing many issues in real-life applications. To address IC task's long-tail issue, K-positive contrastive loss (KCL) is proposed on image classifcation task and can be applied on the IC task when using text-based contrastive learning, e.g., SimCSE. However, one shortcoming of using KCL has been neglected in previous research: false negative (FN) instances may harm the KCL's representation learning. To address the FN issue in the KCL, we proposed to re-weight the positive pairs in the KCL loss with a regularization that the sum of weights should be constrained to K+1 as close as possible. After controlling FN instances with the proposed method, IC performance has been further improved and is superior to other LT-addressing methods.
AB - Item categorization (IC) aims to classify product descriptions into leaf nodes in a categorical taxonomy, which is a key technology used in a wide range of applications. Along with the fact that most datasets often has a long-tailed distribution, classifcation performances on tail labels tend to be poor due to scarce supervision, causing many issues in real-life applications. To address IC task's long-tail issue, K-positive contrastive loss (KCL) is proposed on image classifcation task and can be applied on the IC task when using text-based contrastive learning, e.g., SimCSE. However, one shortcoming of using KCL has been neglected in previous research: false negative (FN) instances may harm the KCL's representation learning. To address the FN issue in the KCL, we proposed to re-weight the positive pairs in the KCL loss with a regularization that the sum of weights should be constrained to K+1 as close as possible. After controlling FN instances with the proposed method, IC performance has been further improved and is superior to other LT-addressing methods.
UR - https://www.scopus.com/pages/publications/85174262408
U2 - 10.18653/v1/2023.acl-industry.55
DO - 10.18653/v1/2023.acl-industry.55
M3 - Conference contribution
AN - SCOPUS:85174262408
T3 - Proceedings of the Annual Meeting of the Association for Computational Linguistics
SP - 574
EP - 580
BT - Industry Track
PB - Association for Computational Linguistics (ACL)
T2 - 61st Annual Meeting of the Association for Computational Linguistics, ACL 2023
Y2 - 9 July 2023 through 14 July 2023
ER -