Continuous Input Embedding Size Search For Recommender Systems
To address memory inefficiency caused by fixed high-dimensional embeddings in recommender systems, this paper proposes a memory-constrained continuous embedding dimension optimization framework. Unlike conventional approaches that employ uniform high-dimensional embeddings or existing reinforcement learning (RL)-based methods limited to discrete dimension selection, our work introduces the first continuous-space embedding dimension search paradigm. We design a stochastic walk-driven exploration strategy to efficiently navigate the continuous dimension space, enabling joint optimization of recommendation accuracy and memory efficiency. The method is model-agnostic and plug-and-play. Extensive experiments on two real-world datasets and three state-of-the-art recommendation models demonstrate that our approach achieves superior performance across multiple memory budgets, consistently outperforming discrete-search baselines and establishing new state-of-the-art results.