Adversarial Multimodal Representation Learning for Click-Through Rate Prediction

被引:32
|
作者
Li, Xiang [1 ,2 ]
Wang, Chao [1 ,2 ]
Tan, Jiwei [1 ,2 ]
Zeng, Xiaoyi [1 ,2 ]
Ou, Dan [1 ,2 ]
Zheng, Bo [1 ,2 ]
机构
[1] Alibaba Grp, Hangzhou, Peoples R China
[2] Alibaba Grp, Beijing, Peoples R China
关键词
multimodal learning; adversarial learning; recurrent neural network; attention; representation learning; e-commerce search;
D O I
10.1145/3366423.3380163
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For better user experience and business effectiveness, Click-Through Rate (CTR) prediction has been one of the most important tasks in E-commerce. Although extensive CTR prediction models have been proposed, learning good representation of items from multimodal features is still less investigated, considering an item in E-commerce usually contains multiple heterogeneous modalities. Previous works either concatenate the multiple modality features, that is equivalent to giving a fixed importance weight to each modality; or learn dynamic weights of different modalities for different items through technique like attention mechanism. However, a problem is that there usually exists common redundant information across multiple modalities. The dynamic weights of different modalities computed by using the redundant information may not correctly reflect the different importance of each modality. To address this, we explore the complementarity and redundancy of modalities by considering modality-specific and modality-invariant features differently. We propose a novel Multimodal Adversarial Representation Network (MARN) for the CTR prediction task. A multimodal attention network first calculates the weights of multiple modalities for each item according to its modality-specific features. Then a multimodal adversarial network learns modality-invariant representations where a double-discriminators strategy is introduced. Finally, we achieve the multimodal item representations by combining both modality-specific and modality-invariant representations. We conduct extensive experiments on both public and industrial datasets, and the proposed method consistently achieves remarkable improvements to the state-of-the-art methods. Moreover, the approach has been deployed in an operational E-commerce system and online A/B testing further demonstrates the effectiveness.
引用
收藏
页码:827 / 836
页数:10
相关论文
共 50 条
  • [31] Adversarial Filtering Modeling on Long-term User Behavior Sequences for Click-Through Rate Prediction
    Li, Xiaochen
    Liang, Jian
    Liu, Xialong
    Zhang, Yu
    PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, : 1969 - 1973
  • [32] Click-through rate prediction using transfer learning with fine-tuned parameters
    Yang, Xiangli
    Liu, Qing
    Su, Rong
    Tang, Ruiming
    Liu, Zhirong
    He, Xiuqiang
    Yang, Jianxi
    INFORMATION SCIENCES, 2022, 612 : 188 - 200
  • [33] Learning Dynamic User Interest Sequence in Knowledge Graphs for Click-Through Rate Prediction
    Li, Youru
    Guo, Xiaobo
    Lin, Wenfang
    Zhong, Mingjie
    Li, Qunwei
    Liu, Zhongyi
    Zhong, Wenliang
    Zhu, Zhenfeng
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (01) : 647 - 657
  • [34] Dual Attentive Sequential Learning for Cross-Domain Click-Through Rate Prediction
    Li, Pan
    Jiang, Zhichao
    Que, Maofei
    Hu, Yao
    Tuzhili, Alexander
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 3172 - 3180
  • [35] Res-embedding for Deep Learning Based Click-Through Rate Prediction Modeling
    Zhou, Guorui
    Wu, Kailun
    Bian, Weijie
    Zhu, Xiaoqiang
    Gai, Kun
    1ST INTERNATIONAL WORKSHOP ON DEEP LEARNING PRACTICE FOR HIGH-DIMENSIONAL SPARSE DATA WITH KDD (DLP-KDD 2019), 2019,
  • [36] Hierarchical attention and feature projection for click-through rate prediction
    Jinjin Zhang
    Chengliang Zhong
    Shouxiang Fan
    Xiaodong Mu
    Zhen Ni
    Applied Intelligence, 2022, 52 : 8651 - 8663
  • [37] Deep Interest Evolution Network for Click-Through Rate Prediction
    Zhou, Guorui
    Mou, Na
    Fan, Ying
    Pi, Qi
    Bian, Weijie
    Zhou, Chang
    Zhu, Xiaoqiang
    Gai, Kun
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 5941 - 5948
  • [38] Continual Transfer Learning for Cross-Domain Click-Through Rate Prediction at Taobao
    Liu, Lixin
    Wang, Yanling
    Wang, Tianming
    Guan, Dong
    Wu, Jiawei
    Chen, Jingxu
    Xiao, Rong
    Zhu, Wenxiang
    Fang, Fei
    COMPANION OF THE WORLD WIDE WEB CONFERENCE, WWW 2023, 2023, : 346 - 350
  • [39] Deep User Match Network for Click-Through Rate Prediction
    Huang, Zai
    Tao, Mingyuan
    Zhang, Bufeng
    SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 1890 - 1894
  • [40] Feature refinement and attention enhancement for click-through rate prediction
    Li, Sumin
    Xie, Zhen
    Pan, Xiuqin
    COMPUTER JOURNAL, 2025,