REACTION: Parameter-Efficient Learning for Recommendation
Song-Li Wu, Zhaocheng Du, Qinglin Jia, Zhenhua Dong
Abstract
While deep learning (DL) has demonstrated significant success in recommender systems, it suffers from high computational complexity and poor scalability. In this work, we demonstrate, from an information-theoretic perspective, the redundancy of existing DL-based recommender models in two aspects: (1) Feature Redundancy. We show that many features are highly mutually correlated, noisy, or weakly predictive of user-item interaction labels. (2) Structural Redundancy. We further show that a large proportion of parameters in the dense layers contribute minimally to overall performance, indicating significant redundancy within the model architecture. To address these challenges, we propose REACTION (paRameter-Efficient LeArning for recommendaTION), an information-theoretic framework designed to reduce model complexity without sacrificing performance. REACTION consists of two core components: Adaptive Feature Extraction (AFE) leverages mutual information to project high-dimensional sparse features into a compact, informative subspace. This adaptively filters noisy or weak features, reduces embedding parameters, and preserves implicit feature interactions without explicit high-order computation. Dynamic Tower Fusion (DTF) bridges the representational gap between dual-tower expressiveness and single-tower efficiency. It facilitates rich cross-tower interactions during training, then merges the towers into a unified, low-latency single tower for inference. Extensive experiments on four large-scale benchmarks demonstrate that REACTION not only outperforms existing methods in accuracy but also achieves a drastic reduction in both model parameters and inference costs, thus establishing a new paradigm for efficient and scalable recommendation systems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 478f74e4-b96e-4f15-b675-e95a512267d1Builds on9
- DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank SystemsRuoxi Wang, Rakesh Shivanna, Derek Zhiyuan Cheng, Sagar Jain et al.WWW 2021 · 793 citations
- LLM-ESR: Large Language Models Enhancement for Long-tailed Sequential RecommendationQidong Liu, Xian Wu, Yejing Wang, Zijian Zhang et al.NeurIPS 2024 · 154 citations
- FinalMLP: An Enhanced Two-Stream MLP Model for CTR PredictionKelong Mao, Jieming Zhu, Liangcai Su, Guohao Cai et al.AAAI 2023 · 142 citations
- FM2: Field-matrixed Factorization Machines for Recommender SystemsYang Sun, Junwei Pan, Alex Zhang, Aaron FloresWWW 2021 · 98 citations
- AutoField: Automating Feature Selection in Deep Recommender SystemsYejing Wang, Xiangyu Zhao, Tong Xu, Xian WuWWW 2022 · 89 citations
Related papers
- Learnable Embedding sizes for Recommender SystemsSiyi Liu, Chen Gao, Yihong Chen, Depeng Jin et al.ICLR 2021 · 97 citations
- Kraken: memory-efficient continual learning for large-scale real-time recommendationsMinhui Xie, Kai Ren, Youyou Lu, Guangxu Yang et al.SC 2020 · 38 citations
- The trade-offs of model size in large recommendation models : 100GB to 10MB Criteo-tb DLRM modelAditya Desai, Anshumali ShrivastavaNeurIPS 2022 · 17 citations
- Beyond Dense Connectivity: Explicit Sparsity for Scalable RecommendationYantao Yu, Sen Qiao, Lei Shen, Bing Wang et al.SIGIR 2026 · 3 citations
- Lighter-X: An Efficient and Plug-and-play Strategy for Graph-based Recommendation through Decoupled PropagationYanping Zheng, Zhewei Wei, Frank De Hoo, Xu Chen et al.VLDB 2025
