高效处理长文本共指消解,内存占用更低且效果顶尖
MEIC-DT: Memory-Efficient Incremental Clustering for Long-Text Coreference Resolution with Dual-Threshold Constraints
- 双阈值机制控制输入规模,动态管理内存使用
- 在严格内存限制下仍达顶尖消解性能
- 适合资源受限场景的长文本共指处理
大语言模型时代,监督神经方法仍是共指消解的最先进(SOTA)方案。然而,其在增量聚类任务中潜力未被充分挖掘,尤其面临长文本下效率与性能难以兼顾的挑战。为此,我们提出基于轻量Transformer的新型双阈值、内存高效增量聚类方法MEIC-DT。该方法设计双阈值约束机制,精确控制Transformer输入规模在预设内存预算内。机制融合统计感知淘汰策略(SAES),利用训练与推理阶段的差异统计特征实现智能缓存管理。此外,引入内部正则化策略(IRP),通过选取最具代表性提及对聚类进行压缩,保持语义完整性。在主流基准上的大量实验表明,MEIC-DT在严苛内存约束下实现了极具竞争力的共指消解性能。
原文摘要 · Abstract (English)
In the era of large language models (LLMs), supervised neural methods remain the state-of-the-art (SOTA) for Coreference Resolution. Yet, their full potential is underexplored, particularly in incremental clustering, which faces the critical challenge of balancing efficiency with performance for long texts. To address the limitation, we propose \textbf{MEIC-DT}, a novel dual-threshold, memory-efficient incremental clustering approach based on a lightweight Transformer. MEIC-DT features a dual-threshold constraint mechanism designed to precisely control the Transformer's input scale within a predefined memory budget. This mechanism incorporates a Statistics-Aware Eviction Strategy (\textbf{SAES}), which utilizes distinct statistical profiles from the training and inference phases for intelligent cache management. Furthermore, we introduce an Internal Regularization Policy (\textbf{IRP}) that strategically condenses clusters by selecting the most representative mentions, thereby preserving semantic integrity. Extensive experiments on common benchmarks demonstrate that MEIC-DT achieves highly competitive coreference performance under stringent memory constraints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。