paper-with-me

홈 › Papers

Hierarchical LoRA MoE for Efficient CTR Model Scaling

2025-10-12 · Zhichen Zeng, Mengyue Hang, Xiaolong Liu, Xiaoyi Liu, Xiao Lin, Ruizhong Qiu, Tianxin Wei, Zhining Liu, Siyang Yuan, Chaofei Yang, Yiqun Liu, Hang Yin, Jiyan Yang, Hanghang Tong arxiv

Deep models have driven significant advances in click-through rate (CTR) prediction. While vertical scaling via layer stacking improves model expressiveness, the layer-by-layer sequential computation poses challenges to efficient scaling. Conversely, horizontal scaling through Mixture of Experts (MoE) achieves efficient scaling by activating a small subset of experts in parallel, but flat MoE layers may struggle to capture the hierarchical structure inherent in recommendation tasks. To push the Return-On-Investment (ROI) boundary, we explore the complementary strengths of both directions and propose HiLoMoE, a hierarchical LoRA MoE framework that enables holistic scaling in a parameter-efficient manner. Specifically, HiLoMoE employs lightweight rank-1 experts for parameter-efficient horizontal scaling, and stacks multiple MoE layers with hierarchical routing to enable combinatorially diverse expert compositions. Unlike conventional stacking, HiLoMoE routes based on prior layer scores rather than outputs, allowing all layers to execute in parallel. A principled three-stage training framework ensures stable optimization and expert diversity. Experiments on four public datasets show that HiLoMoE achieving better performance-efficiency tradeoff, achieving an average AUC improvement of 0.20\% in AUC and 18.5\% reduction in FLOPs compared to the non-MoE baseline.

📄 PDF Abstract BibTeX arXiv:2510.10432

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Hierarchical Behaviour Spaces

2026-04-27 · Michael Tryfan Matthews, Anssi Kanervisto, Jakob Foerster, Pierluca D'Oro 외 arxiv

Recent work in hierarchical reinforcement learning has shown success in scaling to billions of timesteps when learning over a set of predefined option reward functions. We show that, instead of using a single reward func…

Hierarchical Reinforcement Learning

A Hierarchical Approach to Scaling Batch Active Search Over Structured Data

2020-07-20 · Vivek Myers, Peyton Greenside

Active search is the process of identifying high-value data points in a large and often high-dimensional parameter space that can be expensive to evaluate. Traditional active search techniques like Bayesian optimization …

Bayesian Optimization

TMAS: Scaling Test-Time Compute via Multi-Agent Synergy

2026-05-11 · George Wu, Nan Jing, Qing Yi, Chuan Hao 외 arxiv

Test-time scaling has become an effective paradigm for improving the reasoning ability of large language models by allocating additional computation during inference. Recent structured approaches have further advanced th…

Reinforcement Learning

Generative World Models of Tasks: LLM-Driven Hierarchical Scaffolding for Embodied Agents

2025-09-05 · Brennen Hill arxiv

Recent advances in agent development have focused on scaling model size and raw interaction data, mirroring successes in large language models. However, for complex, long-horizon multi-agent tasks such as robotic soccer,…

Multi-agent Reinforcement Learning

HTPO: Towards Exploration-Exploitation Balanced Policy Optimization via Hierarchical Token-level Objective Control

2026-05-08 · Xincheng Yao, Ruoqi Li, Cheng Chen, Daoxin Zhang 외 arxiv

Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a pivotal technique for enhancing the reasoning capabilities of Large Language Models (LLMs). However, the de facto practice of mainstream RL algorithm…

Reinforcement Learning