AI & ML
ReflectRec: Cycle-Consistency Preference Verification for LLM-based Recommendation
arXiv cs.IR0 views
arXiv:2611.23969v1 Announce Type: cross Abstract: CoT-style LLM recommenders generate a natural-language preference note as a chain-of-thought prefix to ranking, but the note is trusted without verification, and the ranker never consults behaviorally similar users. We propose ReflectRec, organized around a preference-to-history round-trip verifier whose recall score serves as an operational signal of preference-to-history recoverability, enabling conditional regeneration for low-recoverability preferences and selection among regeneration attempts. Around this verifier, we wire a semantic Stage-1 prompt, conditional regeneration, and Forward-Look retrieval that injects future watches of behaviorally similar users as a collaborative hint. On MovieLens-100K and MovieLens-1M, the full pipeline outperforms CoT4Rec-ICL by +16.25 / +4.46 pp Hit@10, with positive gains across all ValScore buckets and three LLM backbones (Qwen3-30B, Qwen2.5-72B, and Llama-3.3-70B). We also observe a similar verifier-guided regeneration pattern on Amazon Electronics.
Source:https://arxiv.org/abs/2611.23969PreviousKnowMe Paper Radar: Lightweight Discovery of Promising Papers in the Age of AutoresearchNextVariance-Optimal Counterfactual Policy Design for Sample-Efficient Online A/B Testing
Related posts
Chaos, then control: the maturity model most AI rollouts skip over
0Stack Overflow Blog
ChatGPT at a venture firm: an engineer's checklist for deal data
0dev.to
I checked 183 vibe-coded apps. 92% are almost blank to AI crawlers.
0dev.to
What a Rule Engine, a Model and a Graph Can Each Know About a Mule Chain
0dev.to

I made the model end every post with a question. The replies stayed the same
0dev.to
How powerful is modern "low-end" hardware?
0dev.to