Pith. sign in

REVIEW 2 cited by

Mutual Learning for Finetuning Click-Through Rate Prediction Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.12087 v1 pith:UHRVZLHV submitted 2024-06-17 cs.IR cs.LG

classification cs.IRcs.LG
keywords modelslearningmutualotherperformancepredictionalgorithmbecome
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Click-Through Rate (CTR) prediction has become an essential task in digital industries, such as digital advertising or online shopping. Many deep learning-based methods have been implemented and have become state-of-the-art models in the domain. To further improve the performance of CTR models, Knowledge Distillation based approaches have been widely used. However, most of the current CTR prediction models do not have much complex architectures, so it's hard to call one of them 'cumbersome' and the other one 'tiny'. On the other hand, the performance gap is also not very large between complex and simple models. So, distilling knowledge from one model to the other could not be worth the effort. Under these considerations, Mutual Learning could be a better approach, since all the models could be improved mutually. In this paper, we showed how useful the mutual learning algorithm could be when it is between equals. In our experiments on the Criteo and Avazu datasets, the mutual learning algorithm improved the performance of the model by up to 0.66% relative improvement.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Collapse to Stability: A Knowledge-Driven Ensemble Framework for Scaling Up Click-Through Rate Prediction Models

    cs.IR 2024-11 conditional novelty 6.0 of 10

    KDEF combines knowledge distillation and deep mutual learning with adaptive exam-score weighting so that CTR ensembles with up to ten sub-networks improve instead of collapse.

  2. A Collaborative Ensemble Framework for CTR Prediction

    cs.IR 2024-11 conditional novelty 4.0 of 10

    CETNet combines two CTR models with separate embeddings, KL collaboration, and entropy-based confidence fusion, yielding small AUC gains on public benchmarks but not in the internal deployment.

Pith tools