2 papers
cs.CL2026
Can LLMs Be Constrained to the Past? Improving Knowledge Cutoff through Recall-Based Prompting
Michiro Asai, Ailiang Lin, Yu Kishimoto +4
Prompted knowledge cutoff instructs a large language model (LLM) to act as if information beyond a specified cutoff date were unavailable. However, prior work mainly relies on dire…
cs.LG2025
Revisiting Dynamic Graph Clustering via Matrix Factorization
Dongyuan Li, Satoshi Kosugi, Ying Zhang +3
Dynamic graph clustering aims to detect and track time-varying clusters in dynamic graphs, revealing the evolutionary mechanisms of complex real-world dynamic systems. Matrix facto…