arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.13612cs.AI
收藏

LLM路由作为推理:一种MaxSAT视角

LLM Routing as Reasoning: A MaxSAT View

Arizona State University(亚利桑那州立大学)

Son Nguyen, Xinyuan Liu, Ransalu Senanayake

AI总结:

本文提出基于约束的LLM路由方法,将其建模为加权MaxSAT问题,通过自然语言反馈生成硬约束和软约束,实验证明语言反馈能产生近可行推荐集,揭示了语言条件下的结构化约束优化。

摘要:

将查询路由通过合适的LLM视为挑战,特别是当用户偏好用自然语言表达且模型属性仅部分可观察时。本文提出一种基于约束的语言条件LLM路由解释,将其建模为加权MaxSAT/MaxSMT问题,其中自然语言反馈诱导模型属性上的硬约束和软约束。在25个模型基准的实证分析中,语言反馈产生近可行的推荐集,而无反馈场景揭示系统先验。结果表明,LLM路由可以理解为在语言条件偏好下的结构化约束优化。

英文摘要:

Routing a query through an appropriate LLM is challenging, particularly when user preferences are expressed in natural language and model attributes are only partially observable. We propose a constraint-based interpretation of language-conditioned LLM routing, formulating it as a weighted MaxSAT/MaxSMT problem in which natural language feedback induces hard and soft constraints over model attributes. Under this view, routing corresponds to selecting models that approximately maximize satisfaction of feedback-conditioned clauses. Empirical analysis on a 25-model benchmark shows that language feedback produces near-feasible recommendation sets, while no-feedback scenarios reveal systematic priors. Our results suggest that LLM routing can be understood as structured constraint optimization under language-conditioned preferences.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑