Pith. sign in

REVIEW 3 cited by

A Practical Incremental Method to Train Deep CTR 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 2009.02147 v1 pith:CZE7TTG7 submitted 2020-09-04 cs.IR cs.LG

classification cs.IRcs.LG
keywords trainingincrementallearningbatchdeepmethodmodemodel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deep learning models in recommender systems are usually trained in the batch mode, namely iteratively trained on a fixed-size window of training data. Such batch mode training of deep learning models suffers from low training efficiency, which may lead to performance degradation when the model is not produced on time. To tackle this issue, incremental learning is proposed and has received much attention recently. Incremental learning has great potential in recommender systems, as two consecutive window of training data overlap most of the volume. It aims to update the model incrementally with only the newly incoming samples from the timestamp when the model is updated last time, which is much more efficient than the batch mode training. However, most of the incremental learning methods focus on the research area of image recognition where new tasks or classes are learned over time. In this work, we introduce a practical incremental method to train deep CTR models, which consists of three decoupled modules (namely, data, feature and model module). Our method can achieve comparable performance to the conventional batch mode training with much better training efficiency. We conduct extensive experiments on a public benchmark and a private dataset to demonstrate the effectiveness of our proposed method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Knowledge-Geometry Decoupling: Refreshable Pretrained Transfer for Streaming Recommendation

    cs.IR 2026-08 conditional novelty 7.0 of 10

    KGD decouples a refreshable pretrained encoder from a task learner via read-only cross-attention and an orthogonal residual, improving streaming recommendation accuracy and surviving 90 days of distribution drift.

  2. Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning

    cs.IR 2024-11 conditional novelty 6.0 of 10

    PAM uses popularity-based task partitioning in meta-learning, plus data augmentation and self-supervised losses, to improve cold-start item recommendation in online streaming recommenders.

  3. MEGG: Replay via Maximally Extreme GGscore in Incremental Learning for Neural Recommendation Models

    cs.IR 2025-09 conditional novelty 5.0 of 10

    A gradient-alignment influence score (GGscore) that selects the highest- and lowest-scoring old interactions for replay improves incremental neural recommendation slightly over random replay, mainly at large replay ratios.

Pith tools