Hector J. Garcia, Nick Clayton
Recommender systems have an annoying lag. You rate a new movie, but your taste profile (your embedding) stays frozen until the next full retrain, which might be hours or days away. This paper updates that profile the moment a rating arrives, no retraining needed. It stores each user's preferences in a specialized tree, fits a low-rank projection once, and recomputes the embedding on the fly.
There's a real guarantee behind it: they prove each new rating can only tighten the error bound, never loosen it, which some classic methods don't promise. On the KuaiRec dataset they report slightly better accuracy than a standard method while reading under 2% of the data and updating batches about eight times faster, and a brand-new user gets personalized picks within a millisecond of their first rating. On very sparse data their norm-based sampling covers far more items than plain uniform sampling.
These are the abstract's numbers on one dataset, so see the paper for the theorem's assumptions and how it behaves elsewhere.
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…
Presentation, Not Mechanism: A Render Confound in Deprecation-Aware Memory Evaluation
arXiv (cs.CV) · July 17, 2026PIXIE: A Zero-Shot texture-invariant 6D pose estimation framework for unseen objects with assembly defects
arXiv (cs.AI) · July 17, 2026DPNeXt: A Lightweight Multi-Scale Feature Fusion Framework for Efficient ViT-Based Multi-Task Dense Prediction
arXiv (cs.CL) · July 17, 2026AI Watermark Evidence Fails Forensic Readiness: An Empirical Evaluation