GFlowPO introduces a probabilistic framework for optimizing language model prompts by treating prompt search as posterior inference over latent prompts, regularized by a meta-prompted reference-LM prior. The method first fine‑tunes a lightweight prompt‑LM using an off‑policy Generative Flow Network objective that reuses past prompt evaluations for sample‑efficient exploration. It then applies a training‑free Dynamic Memory Update to refine the meta‑prompt with diverse and top‑performing prompts, leading to consistent improvements over recent discrete prompt optimization baselines on few‑shot classification, instruction induction, and question‑answering tasks.
By Junmo Cho, Suhan Kim, Sangjune An, Minsu Kim, Dong Bok Lee, Heejun Lee, Sung Ju Hwang, Hae Beom Lee
We study finite stochastic partial monitoring (PM) games with side information, a paradigm of sequential learning with partial feedback. On each round $t \in [T]$, both player and environment observe...
The paper investigates how Large Language Models (LLMs) handle the exploration–exploitation trade‑off in Bayesian Optimization, noting that single‑agent LLM approaches suffer from cognitive overload and unstable search dynamics. It proposes a multi‑agent framework that separates strategic policy mediation from tactical candidate generation, allowing explicit, observable, and adjustable exploration–exploitation decisions. Experiments on continuous optimization benchmarks show that this decomposition improves LLM‑mediated search effectiveness.
By Mohammadsina Almasi, Andrea Carbonati, Hadis Anahideh
arXiv:2610.19804v1 Announce Type: new
Abstract: We study finite stochastic partial monitoring (PM) games with side information, a paradigm of sequential learning with partial feedback. On each round...
By Kapilan Balagopalan, Hao Qin, Kwang-Sung Jun, Chicheng Zhang
arXiv:2604. 17244v2 Announce Type: replace-cross Abstract: Large language model (LLM) agents for sequential decision-making struggle to produce diverse outputs.
By Priya Gurjar, Md Farhan Ishmam, Kenneth Marino
CB-Orchestrator is an adaptive framework for optimizing large language model (LLM) agent workflows. It separates workflow generation—via evolutionary search—from workflow selection, which is treated as a contextual bandit problem to enable sample‑efficient learning. The approach reduces training‑phase API token usage by up to 40.55% and overall token overhead by at least 29.73%, while outperforming baselines on five benchmarks, including the MATH dataset.
By Jiahang Sun, Zhiwei Shang, Zhipiao Liu, Hongwei Yang, Guoqing Xie, Shuang Qiu, Zhongxiang Dai
Reinforcement learning with verifiable rewards (RLVR) improves the reasoning capabilities of large language models, but prompt groups with identical rollout rewards consume generation budget without effective learning signals. Pre-rollout prompt selection can reduce this waste by screening prompts before rollout generation.
arXiv:2607.28077v2 Announce Type: replace
Abstract: Reinforcement learning with verifiable rewards (RLVR) improves the reasoning capabilities of large language models, but prompt groups with identica...
By Shuang Liang, Haoyang Zhou, Yifan Gong, Guowei Wang, Xiting Wang
The paper introduces Meta-Frieren, a framework for two‑stage online optimization where a meta‑learner selects an agent‑environment pair before the agent interacts and receives a reward. It derives a UCB‑style criterion for meta‑level selection, extends prior guarantees, and instantiates the framework with GP‑UCB under Bayesian and frequentist settings. Additionally, it presents the first high‑probability regret bound for Feel‑Good Thompson Sampling, applies it to finite and parametric function classes, and demonstrates Meta‑Frieren’s effectiveness in hyperparameter optimization across multiple model classes through experiments.
By Vahan Arsenyan, Arnak Dalalyan
arXiv:2602. 17976v2 Announce Type: replace-cross Abstract: In active sequential testing, also termed pure exploration, a learner is tasked with the goal to adaptively acquire information so as to identify an unknown ground-truth hypothesis with as few queries as possible.
By Alessio Russo, Yin-Ching Lee, Ryan Welch, Aldo Pacchiano
arXiv:2606. 09961v1 Announce Type: cross Abstract: Training large language models (LLMs) as autonomous agents via reinforcement learning (RL) has enabled frontier models to achieve superhuman performance in long-horizon tasks.
By Yu Han, Kailing Li, Yang Jiao, Yulin Dai, Yuqian Fu, Linhai Zhuo, Tianwen Qian
The article outlines a Ph.D. research agenda aimed at creating provably efficient and practical algorithms for data‑driven sequential decision‑making under uncertainty. It focuses on reinforcement learning and multi‑armed bandits, targeting applications such as recommendation systems, computer networks, video analytics, and large language models. The work seeks to overcome limitations of existing methods—such as reliance on idealized models, lack of robustness to adversarial perturbations, and poor instance‑dependent performance—by developing algorithms that are more efficient, robust, instance‑adaptive, and generalizable to new environments.
By Zhiyong Wang