RAG-FGO paper frames RAG query rewriting as black-box optimization over prompts and decoding
_reachsumit · x · 2026-11-18
The arXiv paper RAG-FGO proposes a dynamic optimization framework for generative RAG query rewriting:
- Problem: noisy retrieval feedback, joint optimization of discrete prompt templates with continuous decoding parameters, and poor generalization of static rewriting strategies.
- Method: formulates rewriting as non-differentiable black-box optimization in a mixed discrete-continuous space, with global search for semantic jumps escaping local optima plus local perturbations for fine-grained refinement; an elite-preserving memory pool accumulates high-quality strategies across iterations to buffer noise.
- The abstract reports stable gains, though detailed results are truncated in the post.
More from coding & agent
- Jetriever ranks agent memories by utility not similarity, hitting gold in 84.8% of cases — _reachsumit · 2026-11-18
- Ramen open-sources eval gates and guardrails for shipping MCP tools like code — Ok_Plum3595 · 2026-11-18
- StreamEmbed: 3.7x faster screenshot embedding via pixel-diff pruning and KV reuse — _reachsumit · 2026-11-18
- Reddit debate: does having multiple AIs cross-check each other actually save time? — shopaholic88 · 2026-11-18
- As agents do the work, project management tools should track invariants, not tasks — _AustinCalvert_ · 2026-11-18
- Sol6.2 does PCB layout for ~$4 in 40 min, rivaling fable5.2 at 1/15 the cost — yacineMTB · 2026-11-18