LAD-VF

LLM-Automatic Differentiation Enables Fine-Tuning-Free Robot Planning from Formal Methods Feedback

Published at ICRA 2026

Yunhao Yang1, Junyuan Hong1, Gabriel Jacob Perin2, Zhiwen Fan3, Li Yin4, Zhangyang Wang1, Ufuk Topcu1

1University of Texas at Austin    2University of São Paulo    3Texas A&M University    4SylphAI

Planning with formal feedback, without fine-tuning

LAD-VF uses formal verification outcomes as feedback for automatic prompt optimization. Instead of updating model weights, it treats prompts as trainable textual variables, refines them through LLM-AutoDiff, and asks the LLM to produce robot-executable plans that satisfy temporal-logic safety specifications.

Overview of the LAD-VF planning and verification pipeline

The LLM generates a formal plan, the verifier checks it against safety specifications, and LAD-VF converts violations into textual feedback that improves the next prompt.

Why LAD-VF?

Fine-tuning-free

Improves safety compliance by optimizing prompts, avoiding expensive parameter updates and additional human preference labels.

Verifier-grounded

Uses model-checking feedback from temporal-logic specifications, turning formal violations into structured supervision.

Auditable behavior changes

Prompt refinements remain human-readable, making the optimization process easier to inspect than weight-level updates.

Method

Given a task description and a set of prompts, the LLM produces a NuSMV-based plan. A model checker verifies the plan against safety specifications and returns which constraints were violated. LAD-VF defines a verification-informed textual loss from these failures and back-propagates it through the LLM-AutoDiff workflow to update the prompts.

Generate a plan

The LLM maps a natural-language robot task into a formally verifiable plan.

Verify safety

A model checker evaluates the plan against temporal-logic specifications.

Build text loss

Specification violations become structured feedback for prompt improvement.

Update prompts

LLM-AutoDiff refines the prompt, then the loop repeats until plans are safer.

Step-by-step prompt optimization example

A step-by-step example of prompt optimization for robot navigation.

Example safety specification

A navigation rule can be written as a temporal-logic formula:

G(Pedestrian → F(Action = Stop))

Intuitively: always stop after a pedestrian is observed. LAD-VF uses violations of such formulas to improve the prompt automatically.

Results

0.860

LAD-VF test safety score after prompt optimization.

0.950

LAD-VF + ICL test safety score, matching fine-tuning-level compliance while remaining parameter-free.

0.013

Prompt+Spec test safety score when specifications are simply placed in the prompt.

Method Validation safety score Test safety score
RLVF0.978 ± 0.0320.978 ± 0.032
Prompt+Spec0.156 ± 0.0410.013 ± 0.013
ICL0.825 ± 0.0150.800 ± 0.021
LAD-VF (TextGrad)0.725 ± 0.0250.683 ± 0.024
LAD-VF0.880 ± 0.0750.860 ± 0.058
LAD-VF + ICL0.950 ± 0.0360.950 ± 0.072
Safety score over optimization steps

Safety scores improve over iterative re-prompting steps.

Specification-level safety improvement

Specification-level satisfaction improves after optimization.

Safety score and training time tradeoff versus sample size

LAD-VF reaches strong safety scores with a favorable performance-efficiency trade-off compared with fine-tuning.

Robot demonstration

LAD-VF was evaluated on real robot deployments, including Jackal navigation, indoor delivery, and tabletop manipulation. The optimized prompts produce formally verified plans that transfer to execution without re-optimizing for each robot domain.

Navigation demo I.

Navigation demo II.

Out-of-domain tabletop manipulation.

Jackal Clearpath robot demonstration

Jackal Clearpath navigation deployment.

Indoor robot and robot arm demonstrations

Out-of-domain indoor delivery and robot arm manipulation demonstrations.

Citation

@inproceedings{yang2026ladvf,
  title     = {LAD-VF: LLM-Automatic Differentiation Enables Fine-Tuning-Free Robot Planning from Formal Methods Feedback},
  author    = {Yang, Yunhao and Hong, Junyuan and Perin, Gabriel Jacob and Fan, Zhiwen and Yin, Li and Wang, Zhangyang and Topcu, Ufuk},
  booktitle = {Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)},
  year      = {2026},
  month     = {June},
  address   = {Vienna, Austria}
}