paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
AŠ

Adam Štorek

COLM 2026代码推理可解释性
新星分新星
51
一作贡献30
核心/参与0
方向广度6
合作网络3
1 一作 · 1 篇 · COLM 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

1
一作COLM 2026Poster· Poster Session 5· Imperial Ballroom· #49

Routesplain: Towards Faithful and Intervenable Routing for Software-related Tasks

Adam Štorek · Vikas Upadhyay · Marianne Menglin Liu · Daniel W. Peterson · Anshul Mittal · Sujeeth Bharadwaj · Fahad Shah · Sujith Ravi · Dan Roth

Routesplain is an interpretable LLM router for software tasks that matches or beats black-box routing approaches while providing faithful rationales.

摘要

LLMs now tackle a wide range of software-related tasks, yet we show that their performance varies markedly both across and within these tasks. Routing user queries to the appropriate LLMs can therefore help improve response quality while reducing cost. Prior work, however, has focused mainly on general-purpose LLM routing via black-box models. We introduce Routesplain, an interpretable LLM router for software-related tasks, including multilingual code generation and repair, input/output prediction, and computer science QA. Unlike existing routing approaches, Routesplain first extracts human-interpretable concepts from each query (e.g., task, domain, reasoning complexity) and only routes based on these concepts, thereby providing intelligible, faithful rationales. We evaluate Routesplain on 16 state-of-the-art LLMs across eight software-related tasks; Routesplain outperforms individual models both in terms of accuracy and cost, and equals or surpasses all black-box baselines, with concept-level intervention highlighting avenues for further router improvements.

代码推理可解释性LLM routinginterpretabilityexplainabilityintervenabilityOpenReview

常见合作者