๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

cv usk
@cv_usk
AI / Software Research Notes AI Agent, LLMOps, MLOps, Software Architecture ๆŠ•็จฟใฏๅ€‹ไบบใฎๆ„่ฆ‹ใงใ™ใ€‚
๊ฐ€์ž… May 2026
280 ํŒ”๋กœ์ž‰ ์ค‘    415 ํŒฌ
What if you could leave your recommendation retriever completely untouched and just bolt on one lightweight "verifier" to significantly boost recall? A team at Meta just showed exactly that. Title: Recommendation Retrievers Need Verifiers: Universal Generative Reranking for Sequential Recommendations URL: The idea is a "drafter-verifier" pipeline: freeze the existing retrieval model (the drafter) entirely, and add a lightweight verifier that generatively scores candidate items via their identifier tokens. ๐ŸŒ Highlight 1: It scales with catalog size On the YaMBDa music recommendation dataset, gains grew larger as the catalog got bigger โ€” at the largest scale (4.65B interactions), Recall@10 improved by up to 29.8%. ๐Ÿงฉ Highlight 2: Works across wildly different drafters The same training recipe worked on 4 architecturally distinct drafters: attention-based SASRec, recurrent GRU4Rec, convolutional NextItNet, and even the LLM-based MiniOneRec. ๐Ÿ”ฌ Highlight 3: The gain really comes from generative verification Injecting content embeddings directly into the drafter actually hurt standalone performance, but adding the verifier on top recovered it โ€” proving the improvement comes from the output-side generative verification process itself, not simple feature injection. The fact that it bolts on without touching the retrieval index feels like a big deal for adopting this in large-scale production. #RecSys# #MachineLearning#
๋” ๋ณด๊ธฐ