用嵌入重加权整合多源诊断假设,实现高效可靠的故障根因分析。
Loom: Weaving Diagnostic Strands into Free-Text Consensus via Embedding-Space Reweighting

- 将诊断假设投影到嵌入空间,用迭代质心重加权解决冲突
- 单次LLM调用完成共识生成,速度比顶尖模型快26倍
- 适合需要可解释性与高可靠性的工业级故障诊断场景
在真实工业环境中,将噪声大、相互矛盾的文本假设整合为可信共识是一项基本挑战。虽然大型语言模型(LLM)代理具有无限表达能力,适用于根因分析(RCA),但存在上下文限制、幻觉加剧和推理延迟过高等问题。传统弱监督方法虽具统计严谨性,却仅限于离散类别。我们提出Loom,一个用于真实世界RCA的生成式共识框架,融合两种范式。Loom通过将模块化启发式生成的开放形式假设(动态填充事件特定实体、时间与指标的诊断模板)投影至连续嵌入空间,并采用迭代质心重加权算法解决冲突信号,最终以轻量级LLM合成一步生成共识。在OpenRCA基准上评估显示,Loom处于准确率-效率的帕累托前沿:在Bank和Market-2上达到顶尖自主代理性能,在Market-1和Telecom上略有落后;但在所有四个数据集上仅需一次LLM调用处理每起事件(比基准快约26倍;使用80亿参数合成器时快约33倍)。我们还分享了部署经验,包括代理深度与推理延迟的权衡、冗余检测的负结果,以及确定性共识如何增强领域专家的信任。
原文摘要 · Abstract (English)
Aggregating noisy, conflicting textual hypotheses into a reliable consensus is a fundamental challenge when deploying NLP systems in real-world industrial settings. While monolithic Large Language Model (LLM) agents offer unbounded expressivity for tasks like Root Cause Analysis (RCA), they suffer from context limits, compounding hallucinations, and prohibitive inference latency. Traditional weak supervision offers statistical rigor but is mathematically restricted to discrete classes. We present Loom, a generative consensus framework deployed for real-world RCA that bridges these paradigms. Loom aggregates open-form hypotheses emitted by modular heuristics (diagnostic templates dynamically populated with episode-specific entities, times, and metrics) by projecting them into a continuous embedding space, and resolves conflicting signals with an iterative centroid-based reweighting algorithm. The resulting consensus weights ground a single lightweight LLM synthesis step. Evaluated on the OpenRCA benchmark, Loom occupies the accuracy--efficiency Pareto frontier: it matches a state-of-the-art autonomous agent on Bank and Market-2 and trails on Market-1 and Telecom, while using a single LLM call per incident on all four datasets ($\sim$26$\times$ faster; $\sim$33$\times$ with an 8B-parameter synthesizer). We discuss our deployment experience, highlighting lessons learned regarding the trade-offs between agentic depth and inference latency, negative results in redundancy detection, and how deterministic consensus fosters trust among Subject Matter Experts~(SMEs).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。