Domain-Aware Reinforcement Learning for Prompt Optimization

Prompt engineering provides an efficient way to adapt large language models (LLMs) to downstream tasks without retraining model parameters. However, designing effective prompts can be challenging, especially when model gradients are unavailable and human expertise is required. Existing automated methods based on gradient optimization or heuristic search exhibit inherent limitations under black box or limited-query conditions. We propose Domain-Aware Reinforcement Learning for Prompt Optimization (DA-RLPO), which treats prompt editing as a sequential decision process and leverages structured domain knowledge to constrain candidate edits. Our experimental results show that DA-RLPO achieves higher accuracy than baselines on text classification tasks and maintains robust performance with limited API calls, while also demonstrating effectiveness on text-to-image and reasoning tasks.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-08-09
DOI
https://doi.org/10.3390/math13162552
Citations
1
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Domain-Aware Reinforcement Learning for Prompt Optimization

Ziyu Fan, Z. M. Zheng, Tong Wang, Tongpo Zhang et al.
1 citations
Mathematics
Topic Modeling
2.48
article

Domain-Aware Reinforcement Learning for Prompt Optimization

Ziyu Fan, Z. M. Zheng, Tong Wang, Tongpo Zhang, Bowen Sun, Mengqi Gao
article en
1 citations

Abstract

Prompt engineering provides an efficient way to adapt large language models (LLMs) to downstream tasks without retraining model parameters. However, designing effective prompts can be challenging, especially when model gradients are unavailable and human expertise is required. Existing automated methods based on gradient optimization or heuristic search exhibit inherent limitations under black box or limited-query conditions. We propose Domain-Aware Reinforcement Learning for Prompt Optimization (DA-RLPO), which treats prompt editing as a sequential decision process and leverages structured domain knowledge to constrain candidate edits. Our experimental results show that DA-RLPO achieves higher accuracy than baselines on text classification tasks and maintains robust performance with limited API calls, while also demonstrating effectiveness on text-to-image and reasoning tasks.

MathematicsVol. 13(16)
Shanghai Polytechnic University (CN), Durham University (GB), China Jiliang University (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 9%
Topic Modeling
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Domain-Aware Reinforcement Learning for Prompt Optimization — Ziyu Fan, Z. M. Zheng, et al. · Mathematics (2025) | TGRS Research Map | TGRS