Sign inGet started
Paper · arXiv

Counterfactual Regret for Reflective Agents with Lean-Verified Guarantees

Reflective language agents reuse feedback and memory to adapt across tasks without updating model weights. However, existing guarantees for policy selection and action generation do not by themselves establish when local reflection yields long-term performance guarantees for the complete agent under resource constraints. In this paper, we address this gap by deriving sufficient conditions for sublinear counterfactual regret from local generation and deployment guarantees, while retaining the native controller. Specifically, we establish a resource-sensitive transfer that bounds full-state deployment discrepancies along actual execution paths and preserves the own-history laws of both lear...

AuthorsZhongnian Li, Shi Xu, Mengting Xu et al.
Primary categorycs.AI
Published10 October 2026
Last updated at source10 October 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/edc90440-fcc0-4961-bd59-85fdccd99077" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.