Weixin Chen

Author directory

2026

LLM-based recommendation agents personalize what they know through evolving per-user semantic memory, yet how they perform reasoning relies on a universal, static system prompt shared across all users. When a recommendation fails, the agent only updates its memory, but never examines or revises the reasoning that leads to the failure. To close this gap, we propose SAGER (Self-Evolving Agent for Personalized Recommendation), the first framework to equip each user with a dedicated, continuously evolving policy skill. SAGER incorporates three tailored mechanisms for recommendation scenarios: (i) a two-representation skill architecture constrained by a Cognitive Injection Boundary, decoupling a rich evolution substrate from a minimal inference-time injection; (ii) a contrastive differential chain-of-thought engine that diagnoses ranking errors against unchosen near-misses under a refine-not-replace principle; and (iii) skill-augmented listwise reasoning that mitigates the Score-Tie Bottleneck, enabling the slim skill to serve as an active tie-breaker. Evaluated on four public benchmarks, SAGER achieves state-of-the-art accuracy. Furthermore, plugging its policy skill layer into three structurally distinct host agents delivers consistent 9%–12% gains on the H@1 metric. These results indicate that policy skill evolution provides architecture-agnostic improvements that are largely complementary to memory accumulation.
Long-context conversational agents require robust memory, but existing frameworks struggle to organize information effectively across dimensions like time and topic, leading to poor retrieval. To address this, we introduce H-Mem, a novel Hybrid Multi-Dimensional Memory architecture. H-Mem stores conversational facts in two parallel, hierarchical data structures: a temporal tree that organizes information chronologically and a semantic tree that organizes it conceptually. This dual-tree design enables a hybrid retrieval mechanism managed by an intelligent Mode Controller. Based on the query, the controller dynamically chooses between a sequential search using semantic anchors and an intersective search combining both hierarchies. Our experiments on long-context QA datasets demonstrate that H-Mem provides a more flexible approach to memory management, leading to significant improvements of over 8.4% compared to other state-of-the-art systems.
The evolution of recommender systems has shifted from traditional collaborative filtering to LLM-based agentic systems, which rely on semantic user and item memories to make predictions. However, existing agents maintain these memories in isolation. This overlooks crucial collaborative signals, such as user-item co-engagements and peer relationships across the community, which significantly limits their ability to uncover hidden preferences and accurately infer user needs, particularly for data-sparse users. To bridge this gap, we introduce collaborative memory, a paradigm that connects isolated semantics to enable the sharing of relational insights. Yet, naively utilizing collaborative memory causes severe context overload and introduces noise to downstream LLMs, alongside prohibitive computational costs. To resolve this, we propose MemRec, a framework that architecturally decouples memory management from reasoning. MemRec introduces a dedicated, lightweight language model LM_Mem to efficiently manage and synthesize a dynamic collaborative memory graph in the background. It provides only distilled, high-signal contexts to a downstream, heavyweight large language model (LLM_Rec) for the final recommendation. Extensive experiments on four benchmarks demonstrate that MemRec achieves state-of-the-art performance. Code: https://github.com/rutgerswiselab/memrecHomepage: https://memrec.weixinchen.com