Joint Verification and Refinement of Language Models for Safety-Constrained Planning
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915603071107072 |
|---|---|
| author | Yang, Yunhao Bhatt, Neel P. Ward, William Hu, Zichao Biswas, Joydeep Topcu, Ufuk |
| author_facet | Yang, Yunhao Bhatt, Neel P. Ward, William Hu, Zichao Biswas, Joydeep Topcu, Ufuk |
| contents | Large language models possess impressive capabilities in generating programs (e.g., Python) from natural language descriptions to execute robotic tasks. However, these generated programs often contain errors that violate externally given task specifications. Without an effective method to verify their correctness, the reliable deployment of language models in real-world systems is practically infeasible. We develop a method that converts generated robot programs into an automaton-based representation and verifies them against task-relevant safety specifications. We establish a theorem that any arbitrary combination of the verified programs will also satisfy the safety specifications. Hence, the method eliminates the need to verify complex programs composed of multiple simpler ones, reducing computation complexity. We then introduce an automated fine-tuning procedure that leverages verification outcomes for supervision. By applying the theorem, this procedure only requires training the model to generate safe sub-components, thereby improving training efficiency. Empirical results on robot applications show a 30 percent increase in the probability of generating specification-compliant programs, with training time reduced by half compared to fine-tuning on generating full programs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_14865 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Joint Verification and Refinement of Language Models for Safety-Constrained Planning Yang, Yunhao Bhatt, Neel P. Ward, William Hu, Zichao Biswas, Joydeep Topcu, Ufuk Artificial Intelligence Formal Languages and Automata Theory Robotics Large language models possess impressive capabilities in generating programs (e.g., Python) from natural language descriptions to execute robotic tasks. However, these generated programs often contain errors that violate externally given task specifications. Without an effective method to verify their correctness, the reliable deployment of language models in real-world systems is practically infeasible. We develop a method that converts generated robot programs into an automaton-based representation and verifies them against task-relevant safety specifications. We establish a theorem that any arbitrary combination of the verified programs will also satisfy the safety specifications. Hence, the method eliminates the need to verify complex programs composed of multiple simpler ones, reducing computation complexity. We then introduce an automated fine-tuning procedure that leverages verification outcomes for supervision. By applying the theorem, this procedure only requires training the model to generate safe sub-components, thereby improving training efficiency. Empirical results on robot applications show a 30 percent increase in the probability of generating specification-compliant programs, with training time reduced by half compared to fine-tuning on generating full programs. |
| title | Joint Verification and Refinement of Language Models for Safety-Constrained Planning |
| topic | Artificial Intelligence Formal Languages and Automata Theory Robotics |
| url | https://arxiv.org/abs/2410.14865 |