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

将约束规划推理与大语言模型预测相结合

Combining Constraint Programming Reasoning with Large Language Model Predictions

CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所)

Florian Régin, Elisabetta De Maria, Alexandre Bonlarron

AI总结:

针对约束规划难以实现语义和机器学习难以处理结构约束的挑战,本文提出将大语言模型嵌入约束规划的方法GenCP,由LLM负责词汇生成与语义,CP管理结构约束,相比Beam Search速度更快且能确保满足所有约束。

摘要:

由于约束规划(CP)难以实现“意义”,且机器学习(ML)难以处理结构约束,两者在文本生成中面临挑战。本文提出一种结合两种方法并将大语言模型(LLM)嵌入CP的解决方案。LLM负责词汇生成与意义,CP管理结构约束。该方法基于GenCP,即使用LLM生成域的On-the-fly Constraint Programming Search(OTFS)的改进版本。与标准NLP方法Beam Search(BS)相比,这种组合方法(带LLM的GenCP)速度更快且结果更好,确保所有约束得到满足。CP与ML的融合为增强约束下的文本生成提供了新可能。

英文摘要:

Constraint Programming (CP) and Machine Learning (ML) face challenges in text generation due to CP's struggle with implementing "meaning'' and ML's difficulty with structural constraints. This paper proposes a solution by combining both approaches and embedding a Large Language Model (LLM) in CP. The LLM handles word generation and meaning, while CP manages structural constraints. This approach builds on GenCP, an improved version of On-the-fly Constraint Programming Search (OTFS) using LLM-generated domains. Compared to Beam Search (BS), a standard NLP method, this combined approach (GenCP with LLM) is faster and produces better results, ensuring all constraints are satisfied. This fusion of CP and ML presents new possibilities for enhancing text generation under constraints.

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

↑