Saved in:
Bibliographic Details
Main Authors: Fan, Yaohou, Wang, Qingzhong, Huang, Yongsong, Liu, Junyi, Miyazaki, Tomo, Omachi, Shinichiro
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.24171
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910168811307008
author Fan, Yaohou
Wang, Qingzhong
Huang, Yongsong
Liu, Junyi
Miyazaki, Tomo
Omachi, Shinichiro
author_facet Fan, Yaohou
Wang, Qingzhong
Huang, Yongsong
Liu, Junyi
Miyazaki, Tomo
Omachi, Shinichiro
contents Current visual text generation models struggle with the trade-off between text accuracy and overall image coherence. We find that achieving high text accuracy can reduce aesthetic quality and instruction-following capability. Although reinforcement learning approaches can alleviate the problem through aligning with multiple rewards, they are often unstable for text generation, as existing approaches normally optimize multiple rewards in a weighted-sum way. In addition, it is difficult to balance the weight of each reward. Moreover, reinforcement learning requires a set of training instructions. A large number of prompts require more training time and computing resources, while a small set leads to poor performance. Hence, how to select the prompts for efficient training is an unsolved problem. In this study, we propose Pareto-Optimal Curriculum Alignment (POCA), a framework that addresses this issue as a multi-objective problem by: 1) identifying the Pareto-optimal set to avoid simple scalarization and 2) designing an adaptive curriculum alignment strategy to manage a learning sequence of a multi-reward dataset using automatic difficulty assessment, which is crucial for optimal convergence as RL methods explore in a limited data environment. In synergy, POCA finds the Pareto-optimal set in a unified reward space, which eliminates inconsistent signals to find the best trade-off solution from different rewards under an easy-to-hard optimization landscape. The experimental results show that POCA significantly improves all metrics such as CLIP, HPS scores and sentence accuracy.
format Preprint
id arxiv_https___arxiv_org_abs_2604_24171
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle POCA: Pareto-Optimal Curriculum Alignment for Visual Text Generation
Fan, Yaohou
Wang, Qingzhong
Huang, Yongsong
Liu, Junyi
Miyazaki, Tomo
Omachi, Shinichiro
Computer Vision and Pattern Recognition
Current visual text generation models struggle with the trade-off between text accuracy and overall image coherence. We find that achieving high text accuracy can reduce aesthetic quality and instruction-following capability. Although reinforcement learning approaches can alleviate the problem through aligning with multiple rewards, they are often unstable for text generation, as existing approaches normally optimize multiple rewards in a weighted-sum way. In addition, it is difficult to balance the weight of each reward. Moreover, reinforcement learning requires a set of training instructions. A large number of prompts require more training time and computing resources, while a small set leads to poor performance. Hence, how to select the prompts for efficient training is an unsolved problem. In this study, we propose Pareto-Optimal Curriculum Alignment (POCA), a framework that addresses this issue as a multi-objective problem by: 1) identifying the Pareto-optimal set to avoid simple scalarization and 2) designing an adaptive curriculum alignment strategy to manage a learning sequence of a multi-reward dataset using automatic difficulty assessment, which is crucial for optimal convergence as RL methods explore in a limited data environment. In synergy, POCA finds the Pareto-optimal set in a unified reward space, which eliminates inconsistent signals to find the best trade-off solution from different rewards under an easy-to-hard optimization landscape. The experimental results show that POCA significantly improves all metrics such as CLIP, HPS scores and sentence accuracy.
title POCA: Pareto-Optimal Curriculum Alignment for Visual Text Generation
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2604.24171