CORAL is an LLM‑native harness that automates continual optimization of production recommender systems. It operates in a closed loop: an agent observes system signals, reasons over past decisions, and uses tools—including a numerical optimizer—to reconfigure the recommender while staying within a fixed operating budget. In A/B experiments on two large social platforms, CORAL improved engagement without extra serving cost on one platform and reduced serving cost without harming engagement on the other, demonstrating that a single agentic loop can replace manual engineering for ongoing system tuning.
arXiv:2602. 10226v2 Announce Type: replace-cross Abstract: Optimizing large-scale machine learning systems, such as recommendation models for global video platforms, requires navigating a massive hyperparameter search space and, more critically, designing sophisticated optimizers, architectures, and reward functions to capture nuanced user behaviors.
The paper presents a method for fine‑tuning a large language model (LLM) recommender to generate personalized, non‑harmful explanations for its recommendations. By training two LLM‑judge reward models and using constrained GRPO, the authors achieve a significant increase in the PASS rate for all three criteria, from 0.649 to 0.956 on their own judges and from 0.677 to 0.931 on an independent judge. The fine‑tuned model maintains its original recommendation performance, demonstrating that LLM‑based recommenders can be adapted to complex tasks without loss of effectiveness.
arXiv:2607. 29241v1 Announce Type: cross Abstract: Optimizing modern recommender models still depends heavily on engineers manually iterating over architectural, objective, and training-strategy changes.
The paper introduces a lifecycle framework for LLM-as-a-Judge systems used to evaluate recommendation explanations at Netflix. It outlines four phases—Birth, Training, Deployment, and Monitoring—detailing how each stage addresses specific technical and operational challenges. The authors report that after five weeks of A/B testing, judge-aligned explanations increased novel content viewing and successful browse-to-play sessions without quality takedowns.
AutoLR is an autonomous harness designed to streamline the iterative research‑and‑engineering cycle for industrial recommender systems, exemplified by NetEase’s gaming‑community app DASHEN. It integrates a multi‑expert council for adversarial review, a deterministic evidence‑weighted selector to allocate trial budgets, and a layered knowledge system that fuses external research with domain‑specific insights and empirical evidence. Large language model agents handle semantic reasoning and code generation, while deterministic controllers maintain control over execution, metrics, guardrails, and state management.
TGR‑EvoDAG is a DAG‑based multi‑agent framework that automates code evolution for generative recommendation systems, addressing cost blindness and short‑sighted evaluation issues in existing recursive self‑improvement methods. It incorporates stage‑aware cost planning and active downstream co‑adaptation to manage GPU‑hour budgets and navigate temporary regressions, enabling autonomous evolution of a complete generative recommendation pipeline. Experiments on Amazon datasets and deployment on Tencent’s media platform show significant offline metric gains and a measurable increase in online click‑through rate.
Auto-RecSys is an autonomous research system designed to scale long-horizon experimentation for industry‑scale recommendation models. It tackles long feedback loops and system complexity by enabling distributed asynchronous execution, centralized cross‑server memory, and a cognitive‑procedural separation that combines natural‑language skill files with deterministic scripts. The system incorporates a dual‑loop self‑evolving architecture—Execution Evolution and Idea Evolution loops—to refine operational playbooks and guide future experiments, thereby reducing human effort per cycle and improving reliability as playbooks mature.
The paper proposes treating an LLM agent’s long‑term memory selection as a budgeted slate recommendation problem, framing each request as a user, stored memories as items, and the context window as a slate. By applying recommender‑system techniques—candidate generation, learning‑to‑rank, and slate construction—AgentMemRec selects relevant memories without any LLM calls. Experiments on LongMemEval and LoCoMo show that AgentMemRec outperforms existing memory and context‑selection methods by 10–31 accuracy points and achieves comparable or better performance than an LLM reranker while reducing serving cost and eliminating LLM calls at write time.
arXiv:2608. 06714v1 Announce Type: new Abstract: Recent systems for optimizing prompts, programs, and ML workflows typically rely on explicit outer-loop controllers such as evolutionary search, bandits, or textual-gradient methods.
Recent systems for optimizing prompts, programs, and ML workflows typically rely on explicit outer-loop controllers such as evolutionary search, bandits, or textual-gradient methods. We ask a fundamentally different question: how much of this search policy can be internalized by a single tool-using agent?
arXiv:2607. 19739v1 Announce Type: cross Abstract: Although large language models (LLMs) have recently gained traction in recommender systems due to their strong reasoning capabilities and extensive world knowledge, previous LLM-based agents suffer from hallucination and context-length limitations, and thus are not suitable for full-ranking recommendation tasks.
Although large language models (LLMs) have recently gained traction in recommender systems due to their strong reasoning capabilities and extensive world knowledge, previous LLM-based agents suffer from hallucination and context-length limitations, and thus are not suitable for full-ranking recommendation tasks. To circumvent these limitations through architectural design rather than modifying the LLM itself, we propose an agent-based recommendation framework, memory-based $\textbf{P}$ersonalized $\textbf{R}$ecommendation $\textbf{T}$ool learning via autonomous language $\textbf{A}$gents (PRTA), in which an LLM acts as a central planner interacting with multiple recommendation models as tools.