Prediction Is Not Memory: Dual-Timescale Gated Profile Writing for Persistent User Modeling

• URL: http://arxiv.org/abs/2607.24798v1
• Date: Fri, 03 Jul 2026 14:49:15 GMT
• Title: Prediction Is Not Memory: Dual-Timescale Gated Profile Writing for Persistent User Modeling
• Abstract summary: Persistent user profiles increasingly serve as reusable memory in recommender systems.<n>We formulate this boundary as selective profile-write control.<n>We instantiate the controller as SPW-Gate, a lightweight write-risk gate using long-term, short-term, and candidate-profile drift features.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Persistent user profiles increasingly serve as reusable memory in recommender systems, but common update pipelines conflate two decisions: predicting an interaction and deciding whether it should persist in the profile. After an interaction is observed, many systems treat it as evidence for updating durable user state. This assumption can be harmful when the event reflects transient context, exploration, exposure, or short-term satisfaction rather than stable preference formation. We formulate this boundary as selective profile-write control: after an observed interaction, a system should decide whether, and how strongly, to write it into the persistent profile. We introduce a chronological near/far offline protocol in which near-future evidence provides weak write-risk supervision and far-future evidence is reserved for evaluation. We instantiate the controller as SPW-Gate, a lightweight write-risk gate using long-term, short-term, and candidate-profile drift features. On MicroLens-100K, write-all updating hurts far-future profile alignment in 22.45% of test cases under the main protocol. SPW-Gate reduces far hurt to about 14.5% while preserving about 77% write coverage. Matched-coverage controls and prediction-confidence baselines show that the gain is not merely a by-product of writing less, and that next-item confidence is not a sufficient proxy for persistent write validity.

Related papers

• Less Is Personal: Learning Minimal Sufficient User Profiles for Personalized Language Models [77.02066500576528]
  Enough is a method that iteratively appends behavioral records or emits STOP to construct profiles with adaptive lengths.<n>Enough consistently outperforms strong and retrieval-augmented baselines in both effectiveness and efficiency.
  arXiv  Detail & Related papers  (2026-09-08T03:09:19Z)
• RECAP: Feedback-Driven Streaming Semantic User Profiles for Short-Video Recommendation [74.86562505934961]
  Language-based user profiles convert long behavioral histories into explicit semantic representations for recommendation.<n>We study this problem in real-world short-video recommendation, where user behaviors continuously arrive as streams and profiles must be incrementally updated under limited capacity.<n>We propose RECAP, an offline closed-loop framework for optimizing streaming structured semantic profiles with historical recommendation feedback.
  arXiv  Detail & Related papers  (2026-07-17T08:10:37Z)
• Agents Don't Just Agree, They Remember: Benchmarking Persistent Sycophancy in Stateful Personal Agents [33.055253684457625]
  Stateful personal agents increasingly maintain long-term user profiles, episodic memories, and reusable skills.<n>We call this persistent sycophancy and introduce the Personal Agent Sycophancy Benchmark (PASB)<n>PASB traces whether a conversational claim is accepted, written into durable agent state, and reused in a later neutral query.
  arXiv  Detail & Related papers  (2026-07-12T01:08:59Z)
• CogGuard: Cognitive and Operational Profiling for Proactive Warning in Edge Intelligent Services [13.919915237984036]
  We propose CogGuard, a proactive-warning framework for edge intelligent services.<n>CogGuard decouples offline LLM-based profile construction from online Small Language Model (SLM)-based score prediction.<n>Experiments show that CogGuard reduces profile construction time by up to 48% and distributed fine-tuning time by 19%.
  arXiv  Detail & Related papers  (2026-06-13T08:47:32Z)
• StreamProfileBench: A Benchmark for Fine-Grained User Profile Inference in Real-World Streaming Scenarios [38.37032285408029]
  We introduce StreamProfileBench, a benchmark for fine-grained streaming user profiling.<n>We curate a highly authentic dataset of over 120,000 posts from 7,000+ real users across five diverse platforms.<n>By leveraging the temporal correlation of user interests, we propose a novel, annotation-free evaluation framework.
  arXiv  Detail & Related papers  (2026-05-25T12:10:15Z)
• Learning Next Action Predictors from Human-Computer Interaction [53.41504288073184]
  LongNAP is a user model that combines parametric and in-context learning to reason over long interaction histories.<n>We label over 360K actions across one month of continuous phone usage from 20 users, amounting to 1,800 hours of screen time.<n>LongNAP significantly outperforms supervised finetuning and prompted baselines on held-out data.
  arXiv  Detail & Related papers  (2026-03-06T05:31:04Z)
• Defenses Against Prompt Attacks Learn Surface Heuristics [40.392588465939106]
  Large language models (LLMs) are increasingly deployed in security-sensitive applications.<n>LLMs may override intended logic when adversarial instructions appear in user queries or retrieved content.<n>Recent defenses rely on supervised fine-tuning with benign and malicious labels.
  arXiv  Detail & Related papers  (2026-01-12T04:12:48Z)
• Memory in Large Language Models: Mechanisms, Evaluation and Evolution [8.158439933515131]
  We propose a four-part taxonomy (parametric, contextual, external, procedural/episodic) and a memory quadruple (location, persistence, write/access path, controllability)<n>For updating and forgetting, we present DMM Gov: coordinating DAPT/TAPT, PEFT, model editing (ROME, MEND, MEMIT, SERAC), and RAG to form an auditable loop.<n>This yields a reproducible, comparable, and governable coordinate system for research and deployment.
  arXiv  Detail & Related papers  (2025-09-23T10:06:58Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Prompt Tuning as User Inherent Profile Inference Machine [68.16976932088708]
  We propose UserIP-Tuning, which uses prompt-tuning to infer user profiles.<n>UserIP-Tuning outperforms state-of-the-art recommendation algorithms.<n>The presented solution has been deployed in Huawei AppGallery's Explore page since May 2025.
  arXiv  Detail & Related papers  (2024-08-13T02:25:46Z)
• Conservative Prediction via Data-Driven Confidence Minimization [70.93946578046003]
  In safety-critical applications of machine learning, it is often desirable for a model to be conservative. We propose the Data-Driven Confidence Minimization framework, which minimizes confidence on an uncertainty dataset.
  arXiv  Detail & Related papers  (2023-06-08T07:05:36Z)
• AutoCP: Automated Pipelines for Accurate Prediction Intervals [84.16181066107984]
  This paper proposes an AutoML framework called Automatic Machine Learning for Conformal Prediction (AutoCP) Unlike the familiar AutoML frameworks that attempt to select the best prediction model, AutoCP constructs prediction intervals that achieve the user-specified target coverage rate. We tested AutoCP on a variety of datasets and found that it significantly outperforms benchmark algorithms.
  arXiv  Detail & Related papers  (2020-06-24T23:13:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.