Backend
From Waste to Discovery: Recycling High-Scored Unexposed Candidates in Taobao Feed Recommendation
arXiv cs.IR0 views
arXiv:2611.05997v1 Announce Type: cross Abstract: Helping users discover new interests is vital to the long-term health of industrial recommender systems, yet the usual remedy, boosting exposure of under-explored (discovery) content, often backfires in production. We report URED (Unexposed Recycling for Efficient Discovery), a training-free recall-stage system serving Taobao feed recommendation at Alibaba for over six months to tens of millions of daily active users. It rests on a production-validated insight: naive boosting fails because it injects cold, information-poor candidates that rankers systematically over-estimate, buying no discovery gain while risking engagement. Items scored highly but never exposed (signals industrial pipelines routinely discard) form a pool that is both relevant and reliably predictable. Over a 30-day horizon URED aggregates them and re-injects at recall time through a lightweight pipeline spanning offline storage, distributed aggregation, and low-latency online serving, adding under 1% latency via a single O(1) lookup per request with no model retraining. Online A/B tests show +3.47% discovered categories and +8.47% content richness with engagement preserved: completion video views rise significantly (+2.62%) and total views move positive (+0.36%, not significant). Ablations confirm both design pillars are necessary: a one-day window collapses the discovery gain to +0.55% (not significant), and random injection without score filtering yields no gain while trending negative on engagement (-0.17%). Across production recall channels, URED reaches 13.9x the platform-average discovery rate (6.3x the strongest nearline baseline) at engagement quality on par with the platform average. We share deployment details and lessons for practitioners facing the exploration-exploitation dilemma under tight resource constraints.
Source:https://arxiv.org/abs/2611.05997PreviousToward a Compositional Knowledge Architecture for a Shared Organizational CortexNextArcRAG: Agentic Compositional Retrieval over Knowledge Graphs
Related posts
Cloud Storage CORS Support for Direct Browser Receipt Uploads (A Go Retention Boundary)
0dev.to Go
5 Ways to Publish Timed Caption Segments with Reconnect Handling in Live Rooms
0dev.to Go

Efficiently Growing Unowned Maps in Go: Avoiding Resizes and Reducing Memory Overhead
0dev.to Go
Syncing 1C and Bitrix24 Without Duplicates: Designing an Idempotent Exchange
0dev.to Database
Kimball's Data Warehouse Architecture: Evaluating the Challenges of Conformed Data against the Inmon Model
0arXiv cs.DB
COL-Trees: Efficient Hierarchical Object Search in Spatial Networks
0arXiv cs.DB