mlsanityData to 7 Oct 2026

PRIME: Mitigating Subgroup Optimization Competition in Shared CTR Top Networks with Plug-in Residual Input-Conditioned Mixture of Expert

arXiv 2608.30449 ↗First posted 31 Aug 2026cs.LG cs.IRcited by 0

On the map: Mixture-of-experts → Expert routing strategies

Abstract (arXiv)

Click-through rate (CTR) models vary in feature-interaction design, yet their top networks usually remain a single multilayer perceptron shared by all examples. Heterogeneous user, item, and context subgroups therefore update the same parameters; weakly aligned learning signals make the aggregate gradient a compromise among competing directions. We study the competition on Avazu with 4 models and 4 semantic fields. Across all architectures, semantic subgroups show lower Top-NN gradient cosine similarity than random groups matched by sample size and label ratio, with reductions of 0.23-0.37. This competition motivates input-conditioned experts, but directly replacing an established Dense mapping changes its initial function, sharing pattern, and capacity, obscuring the source of gains. We introduce PRIME (Plug-in Residual Input-conditioned Mixture of Experts), a Dense-anchored mixture of low-rank residual experts. PRIME anchors the original prediction and uses zero-residual initialization to match the Dense baseline exactly at training onset. Input-dependent routing weights low-rank experts for example-specific logit corrections; multi-bag aggregation and EMA load biases stabilize conditional estimation. We evaluate PRIME on held-out Avazu and Criteo test sets across 13 CTR architectures and five paired seeds. Median paired AUC gains are +0.0022 and +0.0066, with LogLoss reductions of 0.0011 and 0.0081, respectively. On FiBiNET and DCNv2, PRIME outperforms APG in all ten seed-level AUC comparisons while using fewer parameters and lower inference latency on both backbones. These results show that function-preserving conditional residuals add input-dependent capacity while preserving the Dense path and its optimization stability. Code is available at https://github.com/YH-learning/PRIME.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 30 of its 43 references that are in the map. First posted on arXiv 31 Aug 2026.

Builds on

30 of 43 references.

Closest ancestors · 6

Same direction, newest first

  1. 2025Coupling Experts and Routers in Mixture-of-Experts via an Auxiliary Loss29 Dec
  2. 2025Routing Manifold Alignment Improves Generalization of Mixture-of-Experts LLMs10 Nov
  3. 2024ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routing19 Dec
  4. 2024Auxiliary-Loss-Free Load Balancing Strategy for Mixture-of-Experts28 Aug
  5. 2022Mixture-of-Experts with Expert Choice Routing18 Feb
  6. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan

Other references · 24

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016HyperNetworkscited by 1,003
  3. 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
  4. 2016Wide & Deep Learning for Recommender Systemscited by 745
  5. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  6. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  7. 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 391
  8. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
  9. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  10. 2023From Sparse to Soft Mixtures of Expertscited by 245
  11. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  12. 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
12 more
  1. 2019FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Predictioncited by 83
  2. 2021One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Predictioncited by 78
  3. 2023PEPNet: Parameter and Embedding Personalized Network for Infusing with Personalized Prior Informationcited by 60
  4. 2018Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertisingcited by 59
  5. 2022BARS: Towards Open Benchmarking for Recommender Systemscited by 54
  6. 2020Open Benchmarking for Click-Through Rate Predictioncited by 53
  7. 2021MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Maskcited by 48
  8. 2023FinalMLP: An Enhanced Two-Stream MLP Model for CTR Predictioncited by 37
  9. 2023Towards Deeper, Lighter and Interpretable Cross Network for CTR Predictioncited by 20
  10. 2022APG: Adaptive Parameter Generation Network for Click-Through Rate Predictioncited by 12
  11. 2025Hierarchical LoRA MoE for Efficient CTR Model Scalingcited by 10
  12. 2025MoE-MLoRA for Multi-Domain CTR Prediction: Efficient Adaptation with Expert Specializationcited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025CompeteSMoE -- Statistically Guaranteed Mixture of Experts Training via Competition
  2. 2026The Illusion of Specialization: Unveiling the Domain-Invariant "Standing Committee" in Mixture-of-Experts Models
  3. 2026Hierarchical Mixture-of-Experts with Two-Stage Optimization
  4. 2024CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competition
  5. 2026Monkey Jump : MoE-Style PEFT for Efficient Multi-Task Learning
  6. 2026Beyond Geometric Complementarity: Coherent Overlap in Sparse Mixture-of-Experts Routing
  7. 2026Dense Mixture-of-Experts as a Reparameterized Wide FFN: A Granularity Sweep at Fixed Compute
  8. 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs