Shanghai AI Lab's PUST splits RL exploration from policy training
TL;DR
- Shanghai AI Lab's PUST framework decouples RL exploration from policy alignment by running exploration on a cheap proxy model, then transferring the update signal.
- The authors report that update signals from substantially weaker proxies can adjustably enhance stronger Qwen3-family primary models on math and code.
- The abstract does not quantify overhead savings, and evaluations are limited to Qwen3 across math and code, so generalization is unproven.
A team from Shanghai AI Lab has posted a paper on Hugging Face that goes at RL post-training from an unusual angle. Instead of running the expensive exploration step on the model you actually want to improve, the proposed method (they call it Proxy-guided Update Signal Transfer, or PUST) does the exploration on a smaller proxy model, extracts the directional update between the proxy's initial and optimized states, and then transfers that signal to the primary model to guide its policy alignment.
The pitch, in the paper, is that this decoupling of update-signal exploration from distribution alignment lets the exploration step be done asynchronously, cached, and reused across models, rather than being locked into a single expensive online pass on the biggest model in your stack. The authors also argue this enables a genuine weak-to-strong path, where signals mined from a much smaller proxy can still adjustably enhance a stronger primary model.
If that holds up, the practical read is on cost. Reinforcement-style post-training on frontier-scale models is one of the reasons agent-oriented fine-tuning has largely lived inside frontier labs. A method where the exploration bill is paid by a small proxy, and the resulting signal is a reusable artifact, would push some of that work into reach for teams that cannot afford to run RL loops on the largest models. It would also give the open-source stack a new kind of shareable object, an update signal you can hand out the way people hand out LoRAs today.
The honest caveat is that the reported evaluations are on Qwen3-family models across math and code, which is a narrow slice. The abstract does not put a hard number on how much overhead is saved, and there is no independent replication yet, so take the 'significantly reduces computational overhead' line as the authors' framing rather than a settled result. Whether the trick generalizes to different tokenizers, architectures, or open-ended agent tasks is the more interesting question, and the one worth watching over the next couple of months.
Originally reported by huggingface.co
Read the original article →Original headline: HF Paper 'Proxy Exploration and Reusable Guidance': Modular LLM Post-Training Paradigm Uses Proxy-Guided Update Signals, Separates Exploration From Policy Training for Cheaper Sample-Efficient RL Fine-Tuning