Yunzhen Feng, Yuhang Wu, Pu Yang, Ziyuan Chen, Zhuoyuan Li
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Modern foundation models often undergo iterative "bootstrapping" in their posttraining phase: a model generates synthetic data, an external verifier filters out low-quality samples, and the high-quality subset is used for further fine-tuning. Over multiple iterations, the model performance improves, raising a crucial question: How should the total budget for generation and training be allocated across iterations to maximize final performance? In this work, we develop a theoretical framework for analyzing budget allocation strategies. Specifically, we show that constant policies fail to converge with high probability, while increasing policiesparticularly exponential growth policies-exhibit significant theoretical advantages. Experiments on image denoising with diffusion probabilistic models and math reasoning with large language models show that both exponential and polynomial growth policies consistently outperform constant policies, with exponential policies often providing more stable performance.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2501.18962")
get_code_for_paper("2501.18962")
have("2501.18962")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2501.18962.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2501.18962)
Connect an agent — have() is free.