arXiv:2606.03221cs.IR2026-06

用AI工程师自动优化推荐模型,少试几次就见效

VirtualMLE: A Virtual ML Engineer that Optimizes Sequential Recommenders

论文配图:VirtualMLE: A Virtual ML Engineer that Optimizes Sequential Recommenders
图 1 · 摘自论文原文
  • 让大模型当虚拟工程师,自动试错并反思优化过程
  • 在三个亚马逊数据集上,用更少尝试达到媲美人工的推荐效果
  • 历史经验可复用,新数据上调参速度显著提升

大型语言模型在推理、反思和工具使用方面展现出强大能力,为自动化复杂工程流程开辟了新范式。然而,在序列推荐领域,针对新数据集的模型调优仍严重依赖经验工程师的试错。为此,我们提出VirtualMLE,一个基于大模型认知能力的代理框架,将推荐优化过程组织为执行-反思-记忆更新的闭环。每次试验后,代理会显式分析结果,并将简洁的启发式反馈存入分层记忆系统。我们在三个亚马逊序列推荐基准上,采用SASRec和HSTU两种主流模型进行评估。结果表明,VirtualMLE仅需少量试验即可达到与人工调优相当的推荐性能。此外,从过往数据集提炼的认知摘要能显著加速对未见数据集的搜索过程,证明了调参启发式可迁移。整体而言,具备反思与记忆能力的大模型代理可作为实用的虚拟工程师,实现序列推荐优化中的启发式学习自动化与成本摊销。代码已开源。

原文摘要 · Abstract (English)

Recent advancements in Large Language Models (LLMs) have demonstrated remarkable capabilities in reasoning, reflection, and tool utilization, unlocking new paradigms for automating complex engineering workflows. However, in the domain of sequential recommendation (SR), tuning models on new datasets still relies heavily on the manual trial-and-error of experienced machine learning engineers. To bridge this gap, we propose \textbf{VirtualMLE}, an LLM-agent framework that leverages the cognitive capabilities of LLMs to organize recommender optimizing into a closed loop of execution, reflection, and memory update. After each trial, the agent explicitly analyzes the observed outcomes and stores concise heuristic feedback in a hierarchical memory system. We evaluate VirtualMLE on three Amazon SR benchmarks with two representative backbones, SASRec and HSTU. VirtualMLE reaches competitive recommendation quality with substantially fewer trials. Furthermore, we observe that cognition summaries distilled from previous datasets can significantly accelerate the search process on unseen datasets, demonstrating the potential of transferring tuning heuristics. Overall, our results provide compelling evidence that LLM agents equipped with reflection and memory can serve as practical virtual engineers to automate and amortize heuristic learning in SR optimization. Our codes are available.

序列推荐LLM代理自动化调优

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。