Paper deep dive
Beyond Successor Accuracy: State Retention for Recursive Self-Improvement in Recommendation
Jinfeng Xu, Zheyu Chen, Ziyue Peng, Zheng Lin, Wenhao Yuan, Jian Chen, Shujie Li, Edith Ngai
Intelligence
Status: succeeded | Model: Gemma-4-26B-A4B | Prompt: intel-v1 | Confidence: 95%
Last extracted: 10/7/2026, 8:43:07 AM
Summary
The paper introduces 'distributed progress' in Recommendation Recursive Self-Improvement (Rec-RSI), arguing that progress is not always consolidated in the successor model but may reside in the relationship between pre- and post-update models. It proposes Cross-Generation Advantage (CGA) to quantify this and Rank Separation to select the optimal retention strategy (cross- vs. within-generation pairing). Experiments show that retaining cross-generation pairs often outperforms the direct successor, particularly for GRU4Rec and SASRec, while FMLP shows different dynamics.
Entities (11)
Relation Signals (7)
CGA → measures → Distributed Progress
confidence 96% · We term this distributed progress and quantify it using cross-generation advantage (CGA)
Rec-RSI → uses → CGA
confidence 95% · We term this distributed progress and quantify it using cross-generation advantage (CGA)
Rank Separation → outperforms → direct successor
confidence 94% · on held-out tests, the selected family outperforms the direct successor in 34/36 trajectories.
Rank Separation → predicts → retention regime
confidence 93% · A rank-separation statistic, label-free at selection time, predicts which family to retain.
GRU4Rec → benefitsfrom → cross-generation pairing
confidence 92% · cross-generation pairing benefits GRU4Rec and SASRec
SASRec → benefitsfrom → cross-generation pairing
confidence 92% · cross-generation pairing benefits GRU4Rec and SASRec
FMLP → shiftsto → cross-generation pairing
confidence 90% · FMLP initially favors within-generation pairing and shifts toward cross-generation pairing after a second update.
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Recommendation recursive self-improvement (Rec-RSI) feeds recommender outputs into subsequent training. Evaluating each round solely through its latest model assumes that the successor consolidates the update, although pre- and post-update models may retain complementary ranking decisions. We term this \emph{distributed progress} and quantify it using cross-generation advantage (CGA), a marginally matched contrast between cross- and within-generation model pairs. A rank-separation statistic, label-free at selection time, predicts which family to retain. Across four datasets and three sequential recommendation encoders, the preferred retention regime varies by architecture: cross-generation pairing benefits GRU4Rec and SASRec, whereas FMLP initially favors within-generation pairing and shifts toward cross-generation pairing after a second update. Rank separation selects the stronger family in 12/12 first-update and 5/6 second-update dataset-encoder settings; on held-out tests, the selected family outperforms the direct successor in 34/36 trajectories. Five transfer mechanisms do not consistently reproduce these gains in one model. These findings establish state retention as a distinct Rec-RSI problem: progress may reside in relations between generations as well as in the latest model. Code is available at \href{this https URL}{this https URL}.
Tags
Links
- Source: https://arxiv.org/abs/2610.07105v1
- Canonical: https://arxiv.org/abs/2610.07105v1
Trouble viewing inline? Open PDF directly →
Full Text
24,843 characters extracted from source content.
Expand or collapse full text
Beyond Successor Accuracy: State Retention for Recursive Self-Improvement in Recommendation Conference: The 20th ACM International Conference on Web Search and Data Mining; February 15–19, 2027; Hong KongCCS: Information systems Recommender systems Jinfeng Xu email: jinfeng@connect.hku.hk Note: Corresponding author. Affiliation: The University of Hong Kong, HongKong SAR, China , Zheyu Chen email: zyueee.chen@connect.polyu.hk Affiliation: The Hong Kong Polytechnic University, HongKong SAR, China , Ziyue Peng email: zpengbe@connect.ust.hk Affiliation: The Hong Kong University of Science and Technology, HongKong SAR, China , Zheng Lin email: zhenglin@ieee.org Affiliation: University of Luxembourg, Luxembourg , Wenhao Yuan email: wenhao.yuan@connect.hku.hk Affiliation: The University of Hong Kong, HongKong SAR, China , Jian Chen email: ccccccj03@connect.hku.hk Affiliation: The University of Hong Kong, HongKong SAR, China , Shujie Li email: shujie.li@connect.hku.hk Affiliation: The University of Hong Kong, HongKong SAR, China and Edith C. H. Ngai email: chngai@hku.hk Affiliation: The University of Hong Kong, HongKong SAR, China 2027 Abstract. Recommendation recursive self-improvement (Rec-RSI) feeds recommender outputs into subsequent training. Evaluating each round solely through its latest model assumes that the successor consolidates the update, although pre- and post-update models may retain complementary ranking decisions. We term this distributed progress and quantify it using cross-generation advantage (CGA), a marginally matched contrast between cross- and within-generation model pairs. A rank-separation statistic, label-free at selection time, predicts which family to retain. Across four datasets and three sequential recommendation encoders, the preferred retention regime varies by architecture: cross-generation pairing benefits GRU4Rec and SASRec, whereas FMLP initially favors within-generation pairing and shifts toward cross-generation pairing after a second update. Rank separation selects the stronger family in 12/12 first-update and 5/6 second-update dataset–encoder settings; on held-out tests, the selected family outperforms the direct successor in 34/36 trajectories. Five transfer mechanisms do not consistently reproduce these gains in one model. These findings establish state retention as a distinct Rec-RSI problem: progress may reside in relations between generations as well as in the latest model. Code is available at https://github.com/Jinfeng-Xu/RecRSI. Keywords: Sequential Recommendation, Recursive Self-Improvement 1. Introduction Recommendation recursive self-improvement (Rec-RSI) places a recommender in a learning loop that generates supervision, trains a successor, and lets that successor shape later updates. Recent systems instantiate this loop through fidelity-controlled interaction generation (Zhang et al., 2026) or agent-based revision of objectives, code, and pipelines (Kim et al., 2026a; Wang et al., 2026). Each update changes both the ranking policy and the evidence available to future generations. Evaluating each round only through the latest model adopts a replacement view, attributing progress to the successor whenever Recall or NDCG rises. Yet these aggregate metrics obscure which relevant items support the score. Models with similar utility may retrieve different items, and an improved successor may not preserve all useful predecessor behavior. Since the retained state governs the next round, Rec-RSI raises a question beyond successor accuracy. What should persist across an update? We posit that recursive progress can be relational. An update may create complementarity across its boundary even when no individual model contains the joint behavior. We call this stage-structured complementarity distributed progress and ask whether cross-generation pairs provide greater utility than pairs formed within either generation. We quantify this state with cross-generation advantage (CGA), which contrasts cross- and within-generation pairs under matched marginal exposure and equal inference cost. The contrast targets the interaction associated with crossing the update boundary. Rank separation then uses earlier-window top-k overlap to select a pair family without outcome labels at selection time. Figure 1 illustrates the relational state and its matched contrast. Across four datasets, three encoders, and two recursive updates, retention regimes vary by architecture. Rank separation predicts these regimes, and the selected family outperforms the direct successor in 34/36 held-out trajectories. Five transfer routes spanning data, predictions, rankings, targets, and parameters fail to consolidate these gains reliably, identifying relational state retention as a central Rec-RSI problem. Panel a shows a pre-update and post-update recommender with similar aggregate utility but different correct top-ranked items. Panel b retains models from both generations and compares cross-generation fusion with within-generation fusion under matched model marginals. Figure 1. Successor accuracy can obscure where useful behavior persists. (a) Similar aggregate utility may arise from different relevant top-ranked items. (b) CGA contrasts cross-generation pairs, including parent–child and non-genealogical pairs, against marginally matched within-generation pairs.Panel a shows a pre-update and post-update recommender with similar aggregate utility but different correct top-ranked items. Panel b retains models from both generations and compares cross-generation fusion with within-generation fusion under matched model marginals. 2. Relational State across Updates 2.1. Single-Model Consolidation In Recommendation RSI, progress may be encoded in generated supervision, predictive distributions, ranked lists, complementary targets, or parameters. To study whether a single successor can consolidate such progress, let z denote one source configuration, z0z_0 its matched control, and Q(z)Q(z) the ranking utility obtained in its native form. The source gain is Δsrc=Q(z)−Q(z0) _src=Q(z)-Q(z_0). A transfer operator T consolidates each source into one successor, whose gain is Δsucc=Q(T(z))−Q(T(z0)) _succ=Q(T(z))-Q(T(z_0)). The residual: Δsrc−Δsucc _src- _succ, quantifies the gain left outside that successor. We instantiate T with five common consolidation routes. 2.2. Cross-Generation Advantage If transfer is incomplete, useful behavior may remain across update stages. Each trajectory contains four models. Models P and B are independent pre-update runs. Model P generates the interactions used to train post-update model A; A′A is trained on the same data with a different seed. For item i and user u, we fuse two full-catalog distributions as Sβ(i∣u;X,Y)=(1−β)logpX(i∣u)+βlogpY(i∣u)S_β(i u;X,Y)=(1-β) p_X(i u)+β p_Y(i u) and rank by SβS_β, with β=0.5β=0.5. Let U(X,Y)U(X,Y) be the resulting ranking utility. The cross- and within-generation families are: =(P,A),(P,A′),(B,A),(B,A′), =\(P,A),(P,A ),(B,A),(B,A )\, =(P,B),(A,A′). =\(P,B),(A,A )\. We define: (1) CGA=14∑(X,Y)∈U(X,Y)−12∑(X,Y)∈U(X,Y).CGA= 14 _(X,Y) U(X,Y)- 12 _(X,Y) U(X,Y). Each side assigns total weight 0.50.5 to P,A,B,P,A,B, and A′A . Under an additive decomposition of pair utility into constituent main effects and an interaction, matching the marginals cancels the main effects. CGA then captures the difference between average cross- and within-generation interaction terms. Under the fixed fusion rule, this interaction can reflect calibration, score scale, and top-rank decisions without being assigned to one mechanism. Positive CGACGA means that cross-generation pairing yields higher utility. Because C contains both genealogical and non-genealogical pairs, CGACGA characterizes the update as a whole rather than a specific parent–child edge. 2.3. Rank Separation for State Selection For model X, let LXk(u)L_X^k(u) be user u’s top-k list, and define Ok(X,Y)=u[|LXk(u)∩LYk(u)|/k]O_k(X,Y)=E_u[|L_X^k(u)∩ L_Y^k(u)|/k]. We measure whether the update separates rankings more than seed variation: (2) Sepk=1||∑(X,Y)∈Ok(X,Y)−1||∑(X,Y)∈Ok(X,Y).Sep_k= 1|W| _(X,Y) O_k(X,Y)- 1|C| _(X,Y) O_k(X,Y). Positive Sep20Sep_20 means that adjacent generations disagree near the recommendation boundary more than do two models from the same generation. Computing it at selection time requires no relevance labels. 3. Evaluation Protocol Datasets and encoders. We use Amazon Toys, Amazon Beauty, Yelp, and Amazon Sports with GRU4Rec (Hidasi et al., 2016), SASRec (Kang and McAuley, 2018), and FMLP (Zhou et al., 2022), spanning recurrent, attention, and frequency-domain sequence encoders. The evaluation cohorts contain 9,011, 10,980, 17,168, and 17,297 users, respectively. Each dataset–encoder setting has three independently seeded trajectories. First-update protocol. Each trajectory trains pre-update models P,BP,B and post-update models A,A′A,A for 10,000 updates. Model P generates the interactions used by A and A′A . Models A and A′A share the same data and configuration but use different seeds. Here m=5m=5 produces five continuations per fit history, k=20k=20 is the upstream rank-fidelity threshold, and pair fusion fixes β=0.5β=0.5. The final three events define windows for checkpoint selection, diagnosis, and confirmation; earlier events form the fit prefix, and only the selection window chooses checkpoints. Same-data seeds control for initialization. The snapshot control is the best of four within-model pairs: 5k–10k and best–final checkpoints for P and A. Each uses the same two-model computation and fusion as the candidate families. The protocol and indicator were specified on Toys, Beauty, and Yelp; Sports was evaluated prospectively, while the original validation and test splits were used only for final evaluation. Second-update extension. On Toys, Beauty, and Sports, model A generates D2D_2 from the fit prefix augmented with D1D_1. Two new seeds, C and C′C , then train on the fit prefix augmented with D1D_1 and D2D_2 using the same 10,000-update budget. We denote the post-update generations after D1D_1 and D2D_2 by G1 and G2, and compare their adjacent families on train-derived windows. This yields 18 second-update trajectories across GRU4Rec and FMLP. Table 1. Original held-out test (three-trajectory mean). W and C denote within- and cross-generation families. CGA is NDCG@20 (×10−3× 10^-3), followed by positive trajectories. Bold follows the unrounded values. Encoder Metric Toys Beauty Yelp Sports W C W C W C W C GRU4Rec R@10 .0203 .0210 .0446 .0458 .0271 .0281 .0196 .0209 N@10 .0101 .0105 .0240 .0247 .0137 .0140 .0098 .0106 R@20 .0344 .0354 .0683 .0700 .0460 .0477 .0326 .0347 N@20 .0136 .0141 .0300 .0308 .0184 .0189 .0131 .0141 CGA +.442 (3/3) +.789 (3/3) +.466 (3/3) +.951 (3/3) SASRec R@10 .0532 .0533 .0667 .0676 .0319 .0324 .0313 .0319 N@10 .0302 .0304 .0383 .0387 .0162 .0164 .0177 .0179 R@20 .0748 .0752 .0923 .0932 .0533 .0539 .0465 .0474 N@20 .0357 .0359 .0448 .0451 .0216 .0218 .0215 .0218 CGA +.280 (3/3) +.342 (3/3) +.238 (3/3) +.277 (3/3) FMLP R@10 .0466 .0466 .0625 .0625 .0224 .0226 .0235 .0235 N@10 .0275 .0276 .0381 .0381 .0115 .0115 .0132 .0132 R@20 .0618 .0612 .0838 .0834 .0371 .0368 .0341 .0335 N@20 .0314 .0313 .0435 .0434 .0151 .0150 .0159 .0157 CGA -.063 (2/3) -.044 (1/3) -.098 (1/3) -.240 (0/3) Consolidation baselines and training. The consolidation study evaluates hard generated-data retraining, full-catalog KL distillation, top-50 listwise distillation, complementary item targets, and linear parameter interpolation. Hard retraining is compared with retraining from independent teacher B; both distillation routes with an A-only student; complementary targets with context-matched random targets; and interpolation with the stronger endpoint. Shared pairs are averaged first within each trajectory; dataset–encoder settings are the primary comparison units, while trajectory rates are descriptive. Effect intervals are computed from 20,000 dataset-cluster bootstrap replicates. All models use 64-dimensional item embeddings. GRU4Rec has two recurrent layers (hidden size 256, dropout 0.2); SASRec has two attention layers (two heads, hidden size 128, dropout 0.5); FMLP has two filter layers (dropout 0.5). We use Adam at 10−310^-3, a batch size of 256, 256 sampled negatives, and a maximum sequence length of 50; evaluation runs every 500 updates. Full-catalog evaluation masks padding and observed items. Users must have at least four original training events. 4. Empirical Results 4.1. Distributed Progress after Consolidation The direct post-update model A exceeds its parent P in 26/36 trajectories on the original held-out test. Improved successor accuracy therefore does not preclude distributed progress, as the pairwise results show. The five consolidation routes recover different portions of that progress: generated-data retraining changes sign across domains; full-catalog, listwise, and complementary-target transfer beat their controls in 1/4, 2/4, and 1/4 settings, respectively; parameter interpolation never beats its stronger endpoint in ten trajectories. Listwise transfer retains the most, reducing the mean source-to-successor loss from 2.313×10−32.313× 10^-3 to 1.375×10−31.375× 10^-3 NDCG@20, while leaving a measurable share of the source gain distributed across models. A broken-axis dot plot compares five routes for consolidating recursive state into one model on Sports and Yelp. Every route has a negative result in at least one domain, and most change sign across domains. Figure 2. Single-model consolidation varies across domains. Points show Δ @20 relative to route-specific comparators (×10−3× 10^-3); labels report the value and wins among applicable trajectories.A broken-axis dot plot compares five routes for consolidating recursive state into one model on Sports and Yelp. Every route has a negative result in at least one domain, and most change sign across domains. 4.2. Encoder-Dependent Pair Utility Table 1 reports the matched families. The cross-generation family improves GRU4Rec and SASRec on every dataset at both cutoffs and under both metrics; all eight NDCG@20 setting means are positive with 3/3 trajectory wins. FMLP reverses this ordering at k=20k=20, while its k=10k=10 differences remain near zero. The NDCG@20 family preference agrees with the confirmation window in all 12 settings. Separately, FMLP’s cross-generation family exceeds the snapshot control in 11/12 test trajectories, while its negative CGA favors the matched within-generation family. 4.3. Rank Separation as a Retention Signal Figure 3 connects earlier-window rank separation to later-window CGACGA. The zero-threshold indicator retains the cross-generation family when Sep20>0Sep_20>0 and the within-generation family otherwise. Sep20Sep_20 and CGA have the same sign in all nine development settings and all three Sports settings; across the 12 settings, Spearman ρ=0.916ρ=0.916. Leave-one-dataset-out and leave-one-encoder-out analyses preserve every remaining setting sign (9/99/9 and 8/88/8, respectively), with corresponding ρ ranges of 0.8500.850–0.9300.930 and 0.7100.710–0.9300.930. On the development datasets, the correlations of CGACGA with top-20 separation and unique-hit advantage are 0.8500.850 and 0.8700.870, respectively, compared with 0.5000.500 and 0.2700.270 for full-catalog Jensen–Shannon and total-variation separation. This contrast locates the predictive signal near the ranking boundary: entry into the exposed list is more informative about later pair utility than global agreement over the full catalog. The association is primarily between architectures rather than between seeds within an architecture. Across individual trajectories, the correlation is 0.8140.814 but falls to 0.2050.205 after ranks are centered within each architecture. Rank separation therefore diagnoses how an encoder responds to the current update; it is not a reliable selector among seeds of the same encoder. A scatter plot shows that rank separation measured on an earlier window marks later cross-generation advantage. GRU4Rec and SASRec occupy the positive region, while FMLP occupies the negative region across four datasets; Sports points are outlined. Figure 3. On the first update, rank separation marks the CGACGA sign on nine development settings and all three Sports settings (outlined).A scatter plot shows that rank separation measured on an earlier window marks later cross-generation advantage. GRU4Rec and SASRec occupy the positive region, while FMLP occupies the negative region across four datasets; Sports points are outlined. 4.4. Generalization across Datasets and Update Rounds At the setting level, the indicator chooses the stronger family in all 12 first-update settings, including 3/3 Sports settings; at the trajectory level, it succeeds in 32/36 cases. The selected family beats the snapshot control in 35/36 trajectories by 2.065×10−32.065× 10^-3 NDCG@20, with a 95% dataset-cluster bootstrap interval of [1.597,2.512]×10−3[1.597,2.512]× 10^-3. Table 2. Selection-time label-free decisions. Setting and Traj. count correct family choices; Snap. counts wins over the snapshot control. Gain is selected-family minus snapshot-control NDCG@20 (×10−3× 10^-3). Evidence Setting Traj. Snap. Gain Development 9/9 24/27 26/27 +1.884 Sports (prospective) 3/3 8/9 9/9 +2.605 All first update 12/12 32/36 35/36 +2.065 Second update 5/6 15/18 17/18 +2.057 The original held-out test preserves the architecture sign in 12/12 settings, and setting effects track the confirmation window (ρ=0.921ρ=0.921, Pearson r=0.963r=0.963). The selected family exceeds successor A in 34/36 trajectories by 2.018×10−32.018× 10^-3 NDCG@20 on average (a 10.6% relative gain), with a dataset-cluster interval of [1.380,2.613]×10−3[1.380,2.613]× 10^-3. It also exceeds the best single model in 33/36 trajectories by 1.457×10−31.457× 10^-3; retaining the pair adds one stored model and one forward pass. The second update is not a replay of the first. GRU4Rec preserves positive CGA on all three datasets and in all 9 trajectories, although its pooled magnitude falls from 1.196×10−31.196× 10^-3 to 0.749×10−30.749× 10^-3. FMLP’s pooled CGA moves from −0.187×10−3-0.187× 10^-3 to +0.035×10−3+0.035× 10^-3, while Sep20Sep_20 becomes positive in all 18 trajectories. The indicator selects 5/6 setting-level and 15/18 trajectory-level regimes, and beats the G2 snapshot control in 17/18 trajectories by 2.057×10−32.057× 10^-3. G2 thus shifts toward cross-generation divergence, while realized CGA remains setting-dependent (5/6 settings). 5. Related Work Recursive self-improvement in recommendation. RSIR generates interactions and retrains successors under fidelity control (Zhang et al., 2026); self-evolving systems revise objectives, code, and pipelines (Kim et al., 2026a; Wang et al., 2026). We study the relational state created by such loops through a marginally matched contrast across their update boundary. Consolidating relational state. RISE uses policy distillation for recursive improvement (Li et al., 2026). Recommender distillation transfers scores or ranks (Tang and Wang, 2018; Kang et al., 2023); EMKD combines sequential encoders (Du et al., 2023), while Hydra and FLAME preserve ensemble diversity in one network (Tran et al., 2020; Kim et al., 2026b). These methods consolidate ensemble diversity; CGA diagnoses complementarity aligned with an update boundary under matched marginals. Temporal and ensemble diversity. Continual recommendation balances stability and plasticity (Yoo et al., 2025); ReLoop and meta-learning carry errors or experience forward (Cai et al., 2022; Zhang et al., 2020). Snapshot ensembles retain an optimization path (Li et al., 2021). CGA targets update-boundary complementarity through marginally matched cross- and within-generation pairs. 6. Conclusion Recommendation recursive self-improvement produces learning states that need not collapse into the latest model. CGA exposes progress distributed across an update, while rank separation identifies the stronger pair family at selection time. Their variation across architectures and rounds, together with incomplete single-model consolidation, establishes relational state retention as a central design problem for self-improving recommender systems. References Cai et al. (2022) G. Cai, J. Zhu, Q. Dai, Z. Dong, X. He, R. Tang, and R. Zhang ReLoop: a self-correction continual learning loop for recommender systems. In ACM SIGIR Conference on Research and Development in Information Retrieval, Cited by: §5. Du et al. (2023) H. Du, H. Yuan, P. Zhao, F. Zhuang, G. Liu, L. Zhao, Y. Liu, and V. S. Sheng Ensemble modeling with contrastive knowledge distillation for sequential recommendation. In ACM SIGIR Conference on Research and Development in Information Retrieval, p. 58–67. Cited by: §5. Hidasi et al. (2016) B. Hidasi, A. Karatzoglou, L. Baltrunas, and D. Tikk Session-based recommendations with recurrent neural networks. Note: International Conference on Learning Representations Cited by: §3. Kang et al. (2023) S. Kang, W. Kweon, D. Lee, J. Lian, X. Xie, and H. Yu Distillation from heterogeneous models for top-k recommendation. In Proceedings of the ACM Web Conference 2023, p. 801–811. Cited by: §5. Kang and McAuley (2018) W. Kang and J. McAuley Self-attentive sequential recommendation. In IEEE International Conference on Data Mining, p. 197–206. Cited by: §3. Kim et al. (2026a) S. Kim, S. Park, H. Kang, W. Kim, J. Seo, Y. In, K. Yoon, H. Jeon, and C. Park Self-evolverec: self-evolving recommender systems with LLM-based directional feedback. In KDD 2026 Workshop on Agentic Software Engineering, Cited by: §1, §5. Kim et al. (2026b) W. Kim, J. Kim, J. Lim, S. Choi, S. Kang, and H. Yu FLAME: condensing ensemble diversity into a single network for efficient sequential recommendation. In ACM SIGIR Conference on Research and Development in Information Retrieval, p. 823–833. Cited by: §5. Li et al. (2021) D. Li, H. Liu, C. Chen, Y. Zhao, S. M. Chu, and B. Yang Neuse: a neural snapshot ensemble method for collaborative filtering. ACM Transactions on Knowledge Discovery from Data (TKDD) 15 (6), p. 1–20. Cited by: §5. Li et al. (2026) Y. Li, S. Yavuz, and S. Joty RISE: recursive improvement via self-extrapolating policy distillation. External Links: 2609.05295 Cited by: §5. Tang and Wang (2018) J. Tang and K. Wang Ranking distillation: learning compact ranking models with high performance for recommender system. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p. 2289–2298. Cited by: §5. Tran et al. (2020) L. Tran, B. S. Veeling, K. Roth, J. Swiatkowski, J. V. Dillon, J. Snoek, S. Mandt, T. Salimans, S. Nowozin, and R. Jenatton Hydra: preserving ensemble diversity for model distillation. External Links: 2001.04694 Cited by: §5. Wang et al. (2026) H. Wang, Y. Wu, D. Chang, L. Wei, and L. Heldt Self-evolving recommendation system: end-to-end autonomous model optimization with llm agents. In Proceedings of the 20th ACM Conference on Recommender Systems, p. 1462–1470. Cited by: §1, §5. Yoo et al. (2025) H. Yoo, S. Kang, and H. Tong Continual recommender systems. In Proceedings of the 34th ACM International Conference on Information and Knowledge Management, p. 6857–6860. Cited by: §5. Zhang et al. (2026) L. Zhang, H. Wang, Z. Liu, M. Yin, Y. Huang, J. Li, W. Guo, Y. Liu, H. Guo, D. Lian, and E. Chen Can recommender systems teach themselves? a recursive self-improving framework with fidelity control. In Forty-third International Conference on Machine Learning, Cited by: §1, §5. Zhang et al. (2020) Y. Zhang, F. Feng, C. Wang, X. He, M. Wang, Y. Li, and Y. Zhang How to retrain recommender system? a sequential meta-learning method. In ACM SIGIR Conference on Research and Development in Information Retrieval, p. 1479–1488. Cited by: §5. Zhou et al. (2022) K. Zhou, H. Yu, W. X. Zhao, and J. Wen Filter-enhanced mlp is all you need for sequential recommendation. In The Web Conference, p. 2388–2399. Cited by: §3.