Multi-Epoch Learning for Deep Click-Through Rate Prediction Models

The one-epoch overfitting phenomenon has been widely observed in industrial Click-Through Rate (CTR) applications, where the model performance experiences a significant degradation at the beginning of the second epoch. Recent advances try to understand the underlying factors behind this phenomenon t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liu, Zhaocheng, Fan, Zhongxiang, Liang, Jian, Kong, Dongying, Li, Han
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Liu, Zhaocheng
Fan, Zhongxiang
Liang, Jian
Kong, Dongying
Li, Han
description The one-epoch overfitting phenomenon has been widely observed in industrial Click-Through Rate (CTR) applications, where the model performance experiences a significant degradation at the beginning of the second epoch. Recent advances try to understand the underlying factors behind this phenomenon through extensive experiments. However, it is still unknown whether a multi-epoch training paradigm could achieve better results, as the best performance is usually achieved by one-epoch training. In this paper, we hypothesize that the emergence of this phenomenon may be attributed to the susceptibility of the embedding layer to overfitting, which can stem from the high-dimensional sparsity of data. To maintain feature sparsity while simultaneously avoiding overfitting of embeddings, we propose a novel Multi-Epoch learning with Data Augmentation (MEDA), which can be directly applied to most deep CTR models. MEDA achieves data augmentation by reinitializing the embedding layer in each epoch, thereby avoiding embedding overfitting and simultaneously improving convergence. To our best knowledge, MEDA is the first multi-epoch training paradigm designed for deep CTR prediction models. We conduct extensive experiments on several public datasets, and the effectiveness of our proposed MEDA is fully verified. Notably, the results show that MEDA can significantly outperform the conventional one-epoch training. Besides, MEDA has exhibited significant benefits in a real-world scene on Kuaishou.
doi_str_mv 10.48550/arxiv.2305.19531
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2305_19531</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2305_19531</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-e5ecbfcb194fe2a79709de2cb72670abc02890d6d0aa941e91ba55c97b315feb3</originalsourceid><addsrcrecordid>eNotz71OwzAUQGEvDKjwAEz1CzjYThzXI4TyI6UCVdmja_u6sQhx5KYI3h5RmM52pI-QG8GLaqMUv4X8FT8LWXJVCKNKcUnud6dxiWw7JzfQFiFPcTrQkDJ9QJxpM0b3zrohp9NhoHtYkL5l9NEtMU10lzyOxytyEWA84vV_V6R73HbNM2tfn16au5ZBrQVDhc4GZ4WpAkrQRnPjUTqrZa05WMflxnBfew5gKoFGWFDKGW1LoQLackXWf9szop9z_ID83f9i-jOm_AF3ckSe</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Multi-Epoch Learning for Deep Click-Through Rate Prediction Models</title><source>arXiv.org</source><creator>Liu, Zhaocheng ; Fan, Zhongxiang ; Liang, Jian ; Kong, Dongying ; Li, Han</creator><creatorcontrib>Liu, Zhaocheng ; Fan, Zhongxiang ; Liang, Jian ; Kong, Dongying ; Li, Han</creatorcontrib><description>The one-epoch overfitting phenomenon has been widely observed in industrial Click-Through Rate (CTR) applications, where the model performance experiences a significant degradation at the beginning of the second epoch. Recent advances try to understand the underlying factors behind this phenomenon through extensive experiments. However, it is still unknown whether a multi-epoch training paradigm could achieve better results, as the best performance is usually achieved by one-epoch training. In this paper, we hypothesize that the emergence of this phenomenon may be attributed to the susceptibility of the embedding layer to overfitting, which can stem from the high-dimensional sparsity of data. To maintain feature sparsity while simultaneously avoiding overfitting of embeddings, we propose a novel Multi-Epoch learning with Data Augmentation (MEDA), which can be directly applied to most deep CTR models. MEDA achieves data augmentation by reinitializing the embedding layer in each epoch, thereby avoiding embedding overfitting and simultaneously improving convergence. To our best knowledge, MEDA is the first multi-epoch training paradigm designed for deep CTR prediction models. We conduct extensive experiments on several public datasets, and the effectiveness of our proposed MEDA is fully verified. Notably, the results show that MEDA can significantly outperform the conventional one-epoch training. Besides, MEDA has exhibited significant benefits in a real-world scene on Kuaishou.</description><identifier>DOI: 10.48550/arxiv.2305.19531</identifier><language>eng</language><subject>Computer Science - Information Retrieval ; Computer Science - Learning</subject><creationdate>2023-05</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2305.19531$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2305.19531$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Liu, Zhaocheng</creatorcontrib><creatorcontrib>Fan, Zhongxiang</creatorcontrib><creatorcontrib>Liang, Jian</creatorcontrib><creatorcontrib>Kong, Dongying</creatorcontrib><creatorcontrib>Li, Han</creatorcontrib><title>Multi-Epoch Learning for Deep Click-Through Rate Prediction Models</title><description>The one-epoch overfitting phenomenon has been widely observed in industrial Click-Through Rate (CTR) applications, where the model performance experiences a significant degradation at the beginning of the second epoch. Recent advances try to understand the underlying factors behind this phenomenon through extensive experiments. However, it is still unknown whether a multi-epoch training paradigm could achieve better results, as the best performance is usually achieved by one-epoch training. In this paper, we hypothesize that the emergence of this phenomenon may be attributed to the susceptibility of the embedding layer to overfitting, which can stem from the high-dimensional sparsity of data. To maintain feature sparsity while simultaneously avoiding overfitting of embeddings, we propose a novel Multi-Epoch learning with Data Augmentation (MEDA), which can be directly applied to most deep CTR models. MEDA achieves data augmentation by reinitializing the embedding layer in each epoch, thereby avoiding embedding overfitting and simultaneously improving convergence. To our best knowledge, MEDA is the first multi-epoch training paradigm designed for deep CTR prediction models. We conduct extensive experiments on several public datasets, and the effectiveness of our proposed MEDA is fully verified. Notably, the results show that MEDA can significantly outperform the conventional one-epoch training. Besides, MEDA has exhibited significant benefits in a real-world scene on Kuaishou.</description><subject>Computer Science - Information Retrieval</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUQGEvDKjwAEz1CzjYThzXI4TyI6UCVdmja_u6sQhx5KYI3h5RmM52pI-QG8GLaqMUv4X8FT8LWXJVCKNKcUnud6dxiWw7JzfQFiFPcTrQkDJ9QJxpM0b3zrohp9NhoHtYkL5l9NEtMU10lzyOxytyEWA84vV_V6R73HbNM2tfn16au5ZBrQVDhc4GZ4WpAkrQRnPjUTqrZa05WMflxnBfew5gKoFGWFDKGW1LoQLackXWf9szop9z_ID83f9i-jOm_AF3ckSe</recordid><startdate>20230530</startdate><enddate>20230530</enddate><creator>Liu, Zhaocheng</creator><creator>Fan, Zhongxiang</creator><creator>Liang, Jian</creator><creator>Kong, Dongying</creator><creator>Li, Han</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230530</creationdate><title>Multi-Epoch Learning for Deep Click-Through Rate Prediction Models</title><author>Liu, Zhaocheng ; Fan, Zhongxiang ; Liang, Jian ; Kong, Dongying ; Li, Han</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-e5ecbfcb194fe2a79709de2cb72670abc02890d6d0aa941e91ba55c97b315feb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Information Retrieval</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Liu, Zhaocheng</creatorcontrib><creatorcontrib>Fan, Zhongxiang</creatorcontrib><creatorcontrib>Liang, Jian</creatorcontrib><creatorcontrib>Kong, Dongying</creatorcontrib><creatorcontrib>Li, Han</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Liu, Zhaocheng</au><au>Fan, Zhongxiang</au><au>Liang, Jian</au><au>Kong, Dongying</au><au>Li, Han</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multi-Epoch Learning for Deep Click-Through Rate Prediction Models</atitle><date>2023-05-30</date><risdate>2023</risdate><abstract>The one-epoch overfitting phenomenon has been widely observed in industrial Click-Through Rate (CTR) applications, where the model performance experiences a significant degradation at the beginning of the second epoch. Recent advances try to understand the underlying factors behind this phenomenon through extensive experiments. However, it is still unknown whether a multi-epoch training paradigm could achieve better results, as the best performance is usually achieved by one-epoch training. In this paper, we hypothesize that the emergence of this phenomenon may be attributed to the susceptibility of the embedding layer to overfitting, which can stem from the high-dimensional sparsity of data. To maintain feature sparsity while simultaneously avoiding overfitting of embeddings, we propose a novel Multi-Epoch learning with Data Augmentation (MEDA), which can be directly applied to most deep CTR models. MEDA achieves data augmentation by reinitializing the embedding layer in each epoch, thereby avoiding embedding overfitting and simultaneously improving convergence. To our best knowledge, MEDA is the first multi-epoch training paradigm designed for deep CTR prediction models. We conduct extensive experiments on several public datasets, and the effectiveness of our proposed MEDA is fully verified. Notably, the results show that MEDA can significantly outperform the conventional one-epoch training. Besides, MEDA has exhibited significant benefits in a real-world scene on Kuaishou.</abstract><doi>10.48550/arxiv.2305.19531</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2305.19531
ispartof
issn
language eng
recordid cdi_arxiv_primary_2305_19531
source arXiv.org
subjects Computer Science - Information Retrieval
Computer Science - Learning
title Multi-Epoch Learning for Deep Click-Through Rate Prediction Models
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T15%3A50%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multi-Epoch%20Learning%20for%20Deep%20Click-Through%20Rate%20Prediction%20Models&rft.au=Liu,%20Zhaocheng&rft.date=2023-05-30&rft_id=info:doi/10.48550/arxiv.2305.19531&rft_dat=%3Carxiv_GOX%3E2305_19531%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true