Sudipta Paul
Author directory2026
TrustMem: Learning Trustworthy Memory Consolidation for LLM Agents with Long-Term Memory
Tianyu Yang | Sudipta Paul | Vijay Srinivasan | Vivek Kulkarni | Srinivas Chappidi
Findings of the Association for Computational Linguistics: EMNLP 2026
Tianyu Yang | Sudipta Paul | Vijay Srinivasan | Vivek Kulkarni | Srinivas Chappidi
Findings of the Association for Computational Linguistics: EMNLP 2026
Large language model (LLM) agents rely on long-term memory to support extended interactions and personalized assistance beyond finite context windows. Existing memory agents actively update external memory through generated write, revise, and delete operations, but these updates may omit important information, corrupt existing memory, or introduce unsupported hallucinated content. Once stored, such errors become persistent system-state failures that can affect future reasoning and generation. In this paper, we propose TrustMem, a framework designed to improve the trustworthiness of memory consolidation. TrustMem relies on a Memory Transition Verifier to evaluate the transition process of memory updates in terms of coverage, preservation, and faithfulness. It further constructs preference pairs among candidate updates under the same memory state, enabling preference-guided reinforcement learning to directly optimize memory updating behaviors. Extensive experiments demonstrate that TrustMem improves both memory utility and reliability: it achieves state-of-the-art results across MemoryAgentBench, HaluMem, and the Mem-alpha validation set, improves HaluMem memory extraction by 12.14 F1 points, and reduces transition-level omission, corruption, and hallucination by 40.1%, 79.1%, and 50.0%, respectively, compared with the strongest baseline for each error type.
Switching Heads and Softening Tokens: Turnkey Solutions to Visually Grounded Document QA
Ximing Wen | Wenbo Li | Sudipta Paul | Yashas Malur Saidutta | Kalpa Gunaratna | Srinivas Chappidi
Findings of the Association for Computational Linguistics: ACL 2026
Ximing Wen | Wenbo Li | Sudipta Paul | Yashas Malur Saidutta | Kalpa Gunaratna | Srinivas Chappidi
Findings of the Association for Computational Linguistics: ACL 2026
Visually Grounded Document Question Answering often lacks robust, end-to-end solutions capable of handling complex, multi-answer queries without reliance on ad-hoc processing. In this work, we propose two turnkey LLM architectures to address this gap. We first introduce a single-head architecture where coordinates are represented as special tokens within the unified vocabulary. While structurally robust, this approach suffers from the limitations of discrete supervision; to address this, we propose a novel “softening token” method that enables differentiable Mean-Squared-Error loss over token probabilities. Although this significantly improves visual grounding, the spatial precision remains bound by discretization. Consequently, we propose a second solution: a dual-head architecture that alternates between text generation and regression-based bounding box prediction. This method offers high spatial precision via a regression head, further stabilized by our introduction of an Intersection-over-Union loss. Finally, by combining the single head model’s structural robustness with the high precision of the dual head model, we propose an ensemble method that yields significant performance gains beyond each of individual components.