Papers by Bo Pan
Automatic Prompt Engineering for Scalable Prompt Inversion in Text-to-Image Ad Generation (2026.acl-industry)
Copied to clipboard
| Challenge: | PRISM-DUEL is a black-box framework that formalizes prompt optimization as Automatic Prompt Engineering (APE) PRIMS-DUEl is motivated by advertising workflows requiring low-latency, diverse variants faithful to a human-designed ad. |
| Approach: | They propose a black-box framework that formalizes prompt optimization as Automatic Prompt Engineering (APE) they obtain label-free pairwise preferences and rationales from an LLM judge over pairs of generated images and use a dueling-bandit optimizer to optimize a prompt for generating controlled variations while matching the reference ad's visual content. |
| Outcome: | The proposed framework preserves visual similarity and semantic faithfulness while increasing diversity. |
Multi-Task Reinforcement Learning for Enhanced Multimodal LLM-as-a-Judge (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing MLLMs are optimized for single-task scenarios and struggle to generalize to diverse contexts. |
| Approach: | They propose a framework that integrates multitask reinforcement learning and generalization capabilities of MLLMs to optimize the judge model across multiple tasks. |
| Outcome: | The proposed framework outperforms baseline models in judgment consistency and correlation with human preferences. |
Making LLMs Better Many-to-Many Speech-to-Text Translators with Curriculum Learning (2025.acl-long)
Copied to clipboard
Yexing Du, Youcheng Pan, Ziyang Ma, Bo Yang, Yifan Yang, Keqi Deng, Xie Chen, Yang Xiang, Ming Liu, Bing Qin
| Challenge: | Existing studies on English-centric translation tasks have focused on multimodal large language models, but the exploration of many-to-many translation is limited by the scarcity of parallel data. |
| Approach: | They propose a three-stage curriculum learning strategy that leverages the machine translation capabilities of large language models and adapts them to S2TT tasks. |
| Outcome: | The proposed strategy achieves state-of-the-art average performance in 1514 language pairs, requiring fewer than 10 hours of speech data per language to achieve competitive results. |
A Lifelong Multilingual Multi-granularity Semantic Alignment Approach via Maximum Co-occurrence Probability (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods to mask and predict tokens in multilingual text limit multilingual interaction . |
| Approach: | They propose a lifelong multilingual multi-granularity semantic alignment approach which continuously extracts massive aligned linguistic units from noisy data via a maximum co-occurrence probability algorithm. |
| Outcome: | The proposed approach improves translation performance on WMT14 18 benchmarks in twelve directions. |
Towards Provably Secure Generative AI: Reliable Consensus Sampling (2026.findings-acl)
Copied to clipboard
Yu Cui, Hang Fu, Sicheng Pan, Zhuoyu Sun, Yifei Liu, Yuhong Nie, Bo Ran, Baohan Huang, Xufeng Zhang, Haibin Zhang, Cong Zuo, Licheng Wang
| Challenge: | Existing research on generative AI security is driven by mutually reinforcing attack and defense methodologies grounded in empirical experience. |
| Approach: | They propose a new algorithm that uses a random sampling algorithm to control risk. |
| Outcome: | The proposed algorithm improves robustness and utility while maintaining latency comparable to existing algorithms. |
Prototype Tuning: A Meta-Learning Approach for Few-Shot Document-Level Relation Extraction with Large Language Models (2025.findings-naacl)
Copied to clipboard
| Challenge: | Few-Shot Document-Level Relation Extraction (FSDLRE) aims to develop models capable of generalizing to new categories with minimal support examples. |
| Approach: | They propose a meta-training approach to train Large Language Models to improve their ICL capabilities . they construct simulated episodes using relation types that do not overlap with test corpus . |
| Outcome: | Experimental results show that the proposed approach outperforms baseline models on few-shot tasks. |
Conformalized Answer Set Prediction for Knowledge Graph Embedding (2025.naacl-long)
Copied to clipboard
| Challenge: | Knowledge graph embeddings (KGE) map entities and predicates into numerical vectors, providing non-classical reasoning capabilities based on similarities and analogies between entities and relations. |
| Approach: | They propose to use knowledge graph embeddings to provide non-classical reasoning capabilities by exploiting similarities and analogies between entities and relations. |
| Outcome: | The proposed model can generate answer sets with probabilistic guarantees on four benchmark datasets and is scaled well with respect to the difficulty of the query. |
ELAD: Explanation-Guided Large Language Models Active Distillation (2024.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are hindered by their memory inefficiency, computational demands, and the high costs of API inferences. |
| Approach: | They propose an Explanation-Guided LLMs Active Distillation framework that employs an active learning strategy to optimize the balance between annotation costs and model performance. |
| Outcome: | The proposed framework significantly improves the efficiency of LLMs knowledge distillation. |
LANDeRMT: Dectecting and Routing Language-Aware Neurons for Selectively Finetuning LLMs to Machine Translation (2024.acl-long)
Copied to clipboard
| Challenge: | Existing studies have shown promising results in multilingual translation with limited bilingual supervision. |
| Approach: | They propose a Language-Aware Neuron Detecting and Routing framework that fine tunes LLMs to Machine Translation with diverse translation training data. |
| Outcome: | The proposed framework selectively finetunes LLMs to MT tasks with diverse translation training data. |
MCGA: A Multi-task Classical Chinese Literary Genre Audio Corpus (2026.findings-acl)
Copied to clipboard
Yexing Du, Kaiyuan Liu, Bihe Zhang, Youcheng Pan, Bo Yang, Liangyu Huo, Xiyuan Zhang, Jian Xie, Daojing He, Yang Xiang, Ming Liu, Bing Qin
| Challenge: | Multimodal Large Language Models (MLLMs) have advanced Chinese Classical Studies (CCS) but the audio dimension of CCS remains underexplored due to a lack of high-quality, domain-specific audio corpora. |
| Approach: | They propose a 119-hour audio corpus comprising 22,000 audio samples to bridge this gap . it encompasses a diverse range of literary genres across six tasks . |
| Outcome: | The proposed corpus encompasses a diverse range of literary genres across six tasks: Automatic Speech Recognition (ASR), Speech-to-Text Translation (S2TT), Speech Emotion Captioning (SEC), Spoken Question Answering ( SQA), Speech Understanding (SU), and Speech Reasoning (SR). |
Exploring Label Hierarchy in a Generative Way for Hierarchical Text Classification (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for hierarchical text classification are lacking in the field of natural language processing. |
| Approach: | They propose a hierarchy-aware T5 model with path-adaptive attention mechanism to exploit hierarchical dependency across different levels. |
| Outcome: | The proposed model outperforms state-of-the-art models especially in Macro-F1 and low Macro. |
Making MLLMs Blind: Adversarial Smuggling Attacks in MLLM Content Moderation (2026.findings-acl)
Copied to clipboard
Zhiheng Li, Zongyang Ma, Yuntong Pan, Ziqi Zhang, Xiaolei Lv, Bo Li, Jun Gao, Jianing Zhang, Chunfeng Yuan, Bing Li, Weiming Hu
| Challenge: | Multimodal Large Language Models (MLLMs) are increasingly being deployed as content moderators . however, they exploit the Human-AI capability gap and create adversarial environments . smuggling attacks exploit the human-AI gap and exploit the vulnerability . |
| Approach: | They construct a benchmark to evaluate the vulnerability of MLLMs as content moderators . they identify three root causes: limited capabilities of vision encoders, robustness gap in OCR . |
| Outcome: | The proposed model exploits the Human-AI capability gap and is vulnerable to smuggling attacks. |
IGenBench: Benchmarking the Reliability of Text-to-Infographic Generation (2026.acl-long)
Copied to clipboard
Yinghao Tang, Xueding Liu, Boyuan Zhang, Tingfeng Lan, Yupeng Xie, Jiale Lao, Yiyao Wang, Haoxuan Li, Tingting Gao, Bo Pan, Luoxuan Weng, Xiuqi Huang, Minfeng Zhu, Yingchaojie Feng, Yuyu Luo, Wei Chen
| Challenge: | Generated infographics may appear correct at first glance but contain easily overlooked issues, such as distorted data encoding or incorrect textual content. |
| Approach: | They propose to evaluate reliability of text-to-infographic generation using IGenBench . they employ multimodal large language models to verify each question . |
| Outcome: | The proposed framework decomposes reliability verification into atomic yes/no questions based on a taxonomy of 10 question types. |
Probing the Plasticity and Correlation of LLM Value Systems: LLM Value Rankings are Not Stable (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have similar value rankings but little is known about how susceptible they are to external influence and how different values are correlated with each other. |
| Approach: | They propose to use 6 different value transformation prompting methods to examine the plasticity of LLM value systems by comparing them with 8 LLMs. |
| Outcome: | The proposed methods are effective on 8 LLMs and 3 families. |
GRAG: Graph Retrieval-Augmented Generation (2025.findings-naacl)
Copied to clipboard
| Challenge: | Naive Retrieval-Augmented Generation (RAG) focuses on individual documents during retrieval and is not suitable for networked documents. |
| Approach: | They propose a novel divide-and-conquer strategy that retrieves optimal subgraph structure in linear time. |
| Outcome: | The proposed approach outperforms current state-of-the-art methods on graph reasoning benchmarks. |
GAIA: A Fine-grained Multimedia Knowledge Extraction System (2020.acl-demos)
Copied to clipboard
Manling Li, Alireza Zareian, Ying Lin, Xiaoman Pan, Spencer Whitehead, Brian Chen, Bo Wu, Heng Ji, Shih-Fu Chang, Clare Voss, Daniel Napierski, Marjorie Freedman
| Challenge: | Open source knowledge extraction tools are used for many real-world applications, but there is no comprehensive system for KE. |
| Approach: | They propose a multimedia knowledge extraction system that takes multimedia data from various sources and languages as input and creates a coherent, structured knowledge base. |
| Outcome: | The system achieves top performance at the recent NIST TAC SM-KBP2019 evaluation. |
Topology-Enhanced Alignment for Large Language Models: Trajectory Topology Loss and Topological Preference Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing algorithms for supervised fine-tuning and reinforcement learning from human feedback (RLHF) do not constrain how hidden states move from a user prompt to an answer. |
| Approach: | They propose a topology-enhanced alignment framework that regularizes these trajectories using 0-dimensional persistent homology. |
| Outcome: | The proposed framework regularizes semantic trajectory in hidden space using 0-dimensional persistent homology. |
SpiderFlow: Efficient Topology-Aware Scheduling for LLM Training Across Decentralized GPU Clusters (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to training large language models lack topologyaware task scheduling mechanisms and model parallelization strategies. |
| Approach: | They propose a topology-aware scheduling system specifically designed for decentralized GPU clusters . they propose heuristic methods at the inter-cluster level with ILP-based optimization within clusters. |
| Outcome: | The proposed system reduces job completion time by 1.2-1.3 and improves throughput by 1.12-1.25 . it also reduces scheduling overhead by 20-90 on average compared to state-of-the-art scheduling systems. |
GraphNarrator: Generating Textual Explanations for Graph Neural Networks (2025.acl-long)
Copied to clipboard
| Challenge: | Graph representation learning has garnered significant attention due to its broad applications in various domains, such as recommendation systems and social network analysis. |
| Approach: | They propose to use a generative language model to map input-output pairs to explanations reflecting the model’s decision-making process to generate a model that generates pseudo-labels that capture the model's decisions from saliency-based explanations. |
| Outcome: | Extensive experiments show that GraphNarrator produces human-preferred explanations that are faithful, concise, and human-like. |
Shrinking Embeddings for Hyper-Relational Knowledge Graphs (2023.acl-long)
Copied to clipboard
| Challenge: | Existing studies have focused on binary relational KGs where each fact is represented by a triple. |
| Approach: | They propose a geometric hyper-relational KG embedding method that explicitly models qualifier monotonicity, qualifier implication, and qualifier mutual exclusion. |
| Outcome: | The proposed method outperforms existing methods on three benchmarks of hyper-relational KGs. |
Rank-Aware Negative Training for Semi-Supervised Text Classification (2023.tacl-1)
Copied to clipboard
| Challenge: | Semi-supervised text classification-based paradigms employ the spirit of self-training, but the accuracy of pseudo-labels can be a problem in real-world scenarios. |
| Approach: | They propose a Rank-aware Negative Training framework to address SSTC in noisy label learning . they rank unlabeled texts based on evidential support from the labeled texts. |
| Outcome: | The proposed framework overcomes state-of-the-art alternatives and achieves competitive performance in other scenarios. |
T3: Tree-Autoencoder Constrained Adversarial Text Generation for Targeted Attack (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing adversarial examples can induce arbitrary errors to the target models, but they can be exploited to estimate robustness of NLP models. |
| Approach: | They propose a target-controllable adversarial attack framework T3 to handle adversarials . they use tree-based decoders to regularize the syntactic correctness of generated text . |
| Outcome: | The proposed framework can be used to estimate the robustness of NLP models. |