---
title: "可变低秩草图实现免重训练推荐"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2607.15242v1"
permalink: "https://feed.astralor.com/items/itm_5fc509f605f273c4cd40c508"
published: "2026-07-16T17:39:38.000Z"
score: 78
channel: "ai"
tags: ["ALS","KP-tree","低秩分解","可变草图","推荐系统","范数比例采样"]
---

# 可变低秩草图实现免重训练推荐

## AI 点评

> 这篇论文直击推荐系统线上服务的核心痛点——嵌入陈旧。我尤其欣赏其理论保证（定理1）和高效采样策略的对比分析。对推荐系统工程师和数据科学家来说，这是一个能直接减少重训练成本并提升冷启动体验的实用方案。

## 速览

论文提出可变草图（Mutable Sketch），利用KP-tree（一种带求和聚合的稀疏段树）存储用户偏好，仅需一次性低秩投影，即可在评分到达时实时计算嵌入，无需模型重训练。在KuaiRec数据集上，以1.8%数据读取量达到RMSE 0.810，优于ALS使用100%数据的0.822，且批量更新速度提升8倍。新用户首次评分后即可在<1ms内获得个性化推荐。针对稀疏数据（密度<1%），KP-tree的范数比例采样对比均匀采样可提高40-130%的物品覆盖率。

## 关键点

- 提出可变草图，解决推荐系统中嵌入陈旧问题，无需重训练即可实时更新。
- KP-tree实现稀疏段树求和聚合，一次性拟合低秩投影，动态重计算嵌入。
- KuaiRec上RMSE 0.810（1.8%数据）vs ALS 0.822（100%数据），批量更新快8倍。
- KP-tree范数比例采样在稀疏数据下覆盖提升40-130%，统一采样仅适用于稠密矩阵。

## 全文

A common bottleneck in two-stage recommendation is embedding staleness: when a user rates a new item, their embedding remains fixed until the next retrain cycle. We propose mutable sketches, which store each user's preferences in a KP-tree (a sparse segment tree with sum aggregation), fit a low-rank projection once, and recompute embeddings on-the-fly as ratings arrive. We prove that each new observation monotonically tightens the prediction error envelope (Theorem 1), a guarantee that FunkSVD and eALS lack. On KuaiRec, the mutable sketch achieves 0.810 RMSE at 1.8% data read vs. ALS 0.822 at 100%, with 8x faster per-batch updates. A new user receives personalized recommendations in <1 ms after their first rating, with no model retraining required. A comparison of sampling strategies across density regimes shows that the KP-tree's norm-proportional sampling provides 40-130% better item coverage on sparse data (<1% density), while uniform sampling suffices on dense matrices.

---

引用前请核对原文;本文由星际流动整理:https://feed.astralor.com/items/itm_5fc509f605f273c4cd40c508