Skip to main content
Search

# Recommender systems

5 related articles

Subscribe to updates
  1. arXiv

    Skip the full retrain: small-scale runs plus a shared scaling law can tell whether a recommendation feature is worth shipping

    Every feature change in a recommendation system normally needs a full-scale retrain for A/B testing, which is expensive, while a single small-scale run often gives a misleading signal. Wukong, HSTU and LLM-based recommenders are shown to follow the same functional form of scaling law after different features are added, differing only in fitted coefficients. Fitting that law to a handful of small-scale runs and applying statistical inference predicts, with confidence intervals, whether a feature helps, is neutral or regresses at full scale, using a fraction of full-scale compute.

  2. arXiv

    Meta hands ranking-model scaling laws to an automated search: 34 shipped iterations average 0.66% lower normalized entropy and 0.36% cumulative online lift

    Meta's ads ranking and retrieval fleet no longer allocates capacity by hand, one model at a time. Previously each scaling decision cost days to weeks of training, and the architecture dimensions are coupled, so they cannot be enlarged independently. Axia maps embedding dimension, interaction depth and interaction width through a scaling layer into complete architectures, then uses Bayesian surrogates to pick a small number of training trials. Across 34 model iterations in two development cycles, offline normalized entropy improved by a mean 0.66% relative and the online key metric by a cumulative 0.36%.

  3. arXiv

    Reward no longer goes only to the nearest action: letting a language model explain outcomes traces delayed credit to its source

    A credit-assignment framework that redistributes delayed reward by explanation rather than temporal proximity traces sparse terminal reward back to the actions that actually mattered hundreds of steps earlier, across Crafter, WordCraft, KuaiRand, and an industry-scale generative recommender.

  4. Google Deploys a Dual-Loop LLM Agent System on YouTube That Autonomously Found RMSprop, Gated Path, and a Multi-Objective Reward, Lifting Multiple A/B Metrics

    The work proposes and deploys a self-evolving recommendation system in which Gemini-family LLM agents act as machine learning engineers: an Offline Agent (Fast Loop, waking every 5 minutes and running daily) generates and offline-scores candidate configurations, while an Online Agent (Slow Loop, running daily) ranks candidates and drives A/B experiments; across several YouTube recommendation surfaces the agents autonomously discovered optimizer switches (Adagrad to RMSprop, FTRL), a Gated Path (GLU) architecture, activation refinement, multi-objective reward synthesis, and reward hyperparameter tuning, with multiple online metrics improving at the 95% confidence level and experiment throughput rising from Θ(1)-Θ(10) per week to Θ(100) per week.

  5. SAGE optimizer lifts accuracy, cold-start recall, and diversity together on Amazon and RecIF-Bench generative recommendation

    The work identifies a "Symmetric Conservatism" failure mode of GBPO in generative recommendation (symmetric update bounds suppress rare positive signals such as cold-start items, static negative-sample constraints fail to prevent diversity collapse, and group-normalized multi-objective rewards yield low-resolution training signals) and proposes SAGE, which uses a geometric-mean sequence-level importance ratio and a decoupled multi-objective advantage estimator to reduce token-level variance and mitigate reward collapse, plus asymmetric adaptive bounding that applies a positive Boost to successful slates and an entropy-aware penalty to low-diversity failures; on three Amazon Product Reviews categories and the large-scale RecIF-Bench, the native-text TextRec optimized with SAGE outperforms O

You’re all caught up