Rui Qu
Author directory2026
Reflection in the Dark: Exposing and Escaping the Black Box in Reflective Prompt Optimization
Shiyan Liu | Qifeng Xia | Qiyun Xia | Yisheng Liu | Xinyu Yu | Rui Qu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop)
Shiyan Liu | Qifeng Xia | Qiyun Xia | Yisheng Liu | Xinyu Yu | Rui Qu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop)
Automatic prompt optimization (APO) has emerged as a powerful paradigm for improving LLM performance without manual prompt engineering. Reflective APO methods such as GEPA iteratively refine prompts by diagnosing failure cases, but the optimization process remains black-box and label-free, leading to uninterpretable trajectories and systematic failure. We identify and empirically demonstrate four limitations: on GSM8K with a defective seed, GEPA degrades accuracy from 23.81% to 13.50%. We propose VISTA, a multi-agent APO framework that decouples hypothesis generation from prompt rewriting, enabling semantically labeled hypotheses, parallel minibatch verification, and interpretable optimization trace. A two-layer explore-exploit mechanism combining random restart and epsilon-greedy sampling further escapes local optima. VISTA recovers accuracy to 87.57% on the same defective seed and consistently outperforms baselines across all conditions on GSM8K and AIME2025.
Positive-Unlabeled Contrastive Retrieval for Graduate Program Recommendation
Shiyan Liu | Rui Qu
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Shiyan Liu | Rui Qu
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Graduate program selection is a high-stakes decision where applicants struggle to identify programs matching their latent academic profiles. We address this as a retrieval problem: given a student profile, rank 531 graduate programs by estimated admission compatibility, i.e., how closely the student’s profile resembles each program’s historical admit pool. Because applicants rarely report rejections, training data consists only of positive labels, making negative supervision unavailable. We propose PURE (Positive-Unlabeled Retrieval Encoder), a positive-unlabeled biencoder with InfoNCE contrastive loss and a gated structural residual that fuses GPA and experience counts with free-text descriptions. With a novel multi-positive MRR protocol that corrects for false negatives, PURE achieves MRR=0.2696, outperforming BM25 (+4.9 points) and GPT-4o-mini (+8.3 points), while remaining statistically indistinguishable from Biencoder + GPT-4o-mini reranking at negligible cost.
Search