基于文本证据的服务系统设计 / Designing Service Systems from Textual Evidence
1️⃣ 一句话总结
这篇论文提出了一种新算法,能够利用廉价但有偏见的大语言模型自动评分,结合少量精准但昂贵的人工审核,高效且可靠地找出最佳服务系统配置,从而大幅降低评估成本。
Designing service systems requires selecting among alternative configurations -- choosing the best chatbot variant, the optimal routing policy, or the most effective quality control procedure. In many service systems, the primary evidence of performance quality is textual -- customer support transcripts, complaint narratives, compliance review reports -- rather than the scalar measurements assumed by classical optimization methods. Large language models (LLMs) can read such textual evidence and produce standardized quality scores, but these automated judges exhibit systematic biases that vary across alternatives and evaluation instances. Human expert review remains accurate but costly. We study how to identify the best service configuration with high confidence while minimizing expensive human audits, given that automated evaluation is cheap but biased. We formalize this as a sequential decision problem where a biased proxy score is observed for every evaluation, and a verified outcome can be acquired selectively at additional cost. We prove that LLM-only selection fails under arm-dependent bias, and that naive selective-audit estimators can be asymptotically biased. We develop an estimator combining proxy scores with inverse-propensity-weighted residuals and construct anytime-valid confidence sequences. Our algorithm, PP-LUCB, jointly decides which alternatives to evaluate and whether to request human audits, concentrating reviews where the LLM judge is least reliable. We prove correctness and establish instance-dependent cost bounds showing near-optimal efficiency. On a customer support ticket classification task, our algorithm correctly identifies the best model in 40/40 trials while achieving 90\% audit cost reduction.
基于文本证据的服务系统设计 / Designing Service Systems from Textual Evidence
这篇论文提出了一种新算法,能够利用廉价但有偏见的大语言模型自动评分,结合少量精准但昂贵的人工审核,高效且可靠地找出最佳服务系统配置,从而大幅降低评估成本。
源自 arXiv: 2603.10400