Wenlong Deng
2026
For-Value: Efficient Forward-Only Data Valuation for finetuning LLMs and VLMs
Wenlong Deng | Qi Zeng | Jiaming Zhang | Minghui Chen | Zixin Ding | Christos Thrampoulidis | Boying Gong | Xiaoxiao Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Wenlong Deng | Qi Zeng | Jiaming Zhang | Minghui Chen | Zixin Ding | Christos Thrampoulidis | Boying Gong | Xiaoxiao Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Data valuation is essential for enhancing the transparency and accountability of large language models (LLMs) and vision-language models (VLMs). However, existing methods typically rely on gradient computations, making them computationally prohibitive for billion-parameter models and precluding batch parallelization. In this work, we introduce For-Value, a forward-only data valuation framework that enables efficient batch-scalable value estimation while maintaining effectiveness. Leveraging the expressive power of pretrained LLMs/VLMs, we theoretically demonstrate that data valuation can be captured by the alignment between the final hidden representations and prediction errors at the last layer. In light of this insight, For-Value computes data value using a simple closed-form expression with a single forward pass, eliminating the need for costly backpropagation and enabling efficient batch calculating at scale. Extensive experiments show that For-Value matches or outperforms gradient-based baselines in detecting influential data and mislabeled data, while achieving significant efficiency improvements.
Automatic Prompt Engineering for Scalable Prompt Inversion in Text-to-Image Ad Generation
Zixin Ding | Qi Zeng | Boying Gong | Wenlong Deng | Bo Pan | Yuxin Chen
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026)
Zixin Ding | Qi Zeng | Boying Gong | Wenlong Deng | Bo Pan | Yuxin Chen
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026)
While prompt engineering offers effective control over Text-to-Image (T2I) generation, it remains labor-intensive for large-scale production. We present PRISM-DUEL, a black-box framework that formalizes prompt optimization as Automatic Prompt Engineering (APE), motivated by advertising workflows requiring low-latency, diverse variants faithful to a human-designed ads. Since zero-shot LLMs are unreliable judges of image quality, PRISM-DUEL obtains label-free pairwise preferences and rationales from an LLM judge over pairs of generated images, then uses a dueling-bandit optimizer to optimize a prompt for generating controlled variations while matching the reference ad’s visual content. By iteratively steering the prompt distribution towards higher-quality generations and improving posterior calibration, PRISM-DUEL preserves visual similarity and semantic faithfulness while increasing diversity. Experiments on PartiPrompts and DreamBooth across Gemini 2.5 Flash Image, FLUX.1, and Qwen-Image show consistent gains over strong baselines in visual faithfulness and prompt interpretability.