Pengfei Yang
Author directoryOther people with similar names: Pengfei Yang
2026
ShotFinder: Imagination-Driven Open-Domain Video Shot Retrieval via Web Search
Tao Yu | Haopeng Jin | Hao Wang | Shenghua Chai | Yujia Yang | Zhongtian Luo | Junhao Gong | Jiaming Guo | Minghui Zhang | Xinlong Chen | Zhenghao Zhang | Yuxuan Zhou | Yanpei Gong | YuanCheng Liu | Yiming Ding | Kangwei Zeng | Pengfei Yang | Yufei Xiong | Shanbin Zhang | Chengshaoxiong | Huang Ruilin | Li Shuo | Yuxi Niu | Xinyuan Zhang | Yueya Xu | Jie Mao | Ruixuan Ji | Yaru Zhao | Mingchen Zhang | Jiabing Yang | Jiaqi Liu | YiFan Zhang | Hongzhu Yi | Xinming Wang | Cheng Zhong | Xiao Ma | Zhang Zhang | Yan Huang | Liang Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Tao Yu | Haopeng Jin | Hao Wang | Shenghua Chai | Yujia Yang | Zhongtian Luo | Junhao Gong | Jiaming Guo | Minghui Zhang | Xinlong Chen | Zhenghao Zhang | Yuxuan Zhou | Yanpei Gong | YuanCheng Liu | Yiming Ding | Kangwei Zeng | Pengfei Yang | Yufei Xiong | Shanbin Zhang | Chengshaoxiong | Huang Ruilin | Li Shuo | Yuxi Niu | Xinyuan Zhang | Yueya Xu | Jie Mao | Ruixuan Ji | Yaru Zhao | Mingchen Zhang | Jiabing Yang | Jiaqi Liu | YiFan Zhang | Hongzhu Yi | Xinming Wang | Cheng Zhong | Xiao Ma | Zhang Zhang | Yan Huang | Liang Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
In recent years, large language models (LLMs) have made rapid progress in information retrieval, yet existing research has mainly focused on text or static multimodal settings. Open-domain video shot retrieval, which involves richer temporal structure and more complex semantics, still lacks systematic benchmarks and analysis. To fill this gap, we introduce ShotFinder, a benchmark that formalizes editing requirements as keyframe-oriented shot descriptions and introduces five types of controllable single-factor constraints: Temporal order, Color, Visual style, Audio, and Resolution. We curate 1,210 high-quality samples from YouTube across 20 thematic categories, using large models for generation with human verification. Based on the benchmark, we propose ShotFinder, a text-driven three-stage retrieval and localization pipeline: (1) query expansion via video imagination, (2) candidate video retrieval with a search engine, and (3) description-guided shot localization. Experiments on multiple closed-source and open-source models reveal a significant gap to human performance, with clear imbalance across constraints: temporal localization is relatively tractable, while color and visual style remain major challenges. These results reveal that open-domain video shot retrieval is still a critical capability that multimodal large models have yet to overcome.
RLShield: Dynamic Jailbreak Detection for LLMs via Reinforced Adaptive Learning
Zhao Tong | Pengfei Yang | Yimeng Gu | Haichao Shi | Qiang Liu | Xingcheng Xu | Shu Wu | Xiao-Yu Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Zhao Tong | Pengfei Yang | Yimeng Gu | Haichao Shi | Qiang Liu | Xingcheng Xu | Shu Wu | Xiao-Yu Zhang
Findings of the Association for Computational Linguistics: ACL 2026
While prompt engineering enhances the capabilities of Large Language Models (LLMs), it also exposes critical safety concerns. Due to the inherent brittleness of their static safety boundaries, LLMs are vulnerable to jailbreak prompts, i.e. adversarial inputs designed to bypass safeguards and induce the generation of harmful content. Existing detection mechanisms rely on static model components or fixed decision thresholds, limiting their ability to generalize to evolving attack patterns and continual model updates. To bridge this gap, we propose RLShield, a dynamic jailbreak detection framework that employs reinforcement learning for adaptive threshold selection. RLShield incorporates three key innovations: (i) a dynamic retrieval and LLM-based rewriting module to simulate diverse adversarial contexts; (ii) a cross-layer representation analysis to pinpoint safety-critical parameters; and (iii) a Soft Actor-Critic (SAC) based agent that learns to predict optimal, sample-specific detection thresholds. Experimental results demonstrate that RLShield consistently outperforms state-of-the-art baselines in detection performance while maintaining high computational efficiency. Notably, it improves F1 by up to 7.3%, while achieving an average of 3× gain in inference efficiency across multiple LLM backbones.
Enhancing Agentic Textual Graph Retrieval with Synthetic Stepwise Supervision
Ge Chang | Jinbo Su | Jiacheng Liu | Pengfei Yang | Yuhao Shang | Huiwen Zheng | Hongli Ma | Yan Liang | Yuanchun Li | Yunxin Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Ge Chang | Jinbo Su | Jiacheng Liu | Pengfei Yang | Yuhao Shang | Huiwen Zheng | Hongli Ma | Yan Liang | Yuanchun Li | Yunxin Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Integrating textual graphs into Large Language Models (LLMs) is promising for complex graph-based QA. However, a key bottleneck is retrieving informative yet compact subgraphs that fit the LLM context. Existing retrievers often struggle, relying either on shallow embedding similarity or costly interactive policies that require excessive supervision.To address these challenges, we introduce Graph-S3, an agentic textual graph reasoning framework featuring an LLM-based retriever trained with synthetic stepwise supervision. Rather than relying on final answer rewards—which often yield sparse and unstable signals—we optimize the retriever by evaluating each step against offline-extracted golden subgraphs.Our approach distills golden subgraphs via a specialized data synthesis pipeline to formulate dense rewards, facilitating a two-stage training scheme that effectively learns the interactive graph exploration policy.Based on extensive experiments on three common datasets in comparison with seven strong baselines, our approach achieves an average improvement of 15.6% in accuracy and 17.2% in F1 score. The advantage is even higher in more complicated multi-hop reasoning tasks.
Search
Fix author
Co-authors
- Shenghua Chai 1
- Ge Chang 1
- Xinlong Chen 1
- Chengshaoxiong 1
- Yiming Ding 1
- Junhao Gong 1
- Yanpei Gong 1
- Yimeng Gu 1
- Jiaming Guo 1
- Yan Huang 1
- Ruixuan Ji 1
- Haopeng Jin 1
- Yuanchun Li 1
- Yan Liang 1
- Jiacheng Liu 1
- Jiaqi Liu 1
- Qiang Liu 1
- YuanCheng Liu 1
- Yunxin Liu 1
- Zhongtian Luo 1
- Hongli Ma 1
- Xiao Ma 1
- Jie Mao 1
- Yuxi Niu 1
- Huang Ruilin 1
- Yuhao Shang 1
- Haichao Shi 1
- Li Shuo 1
- Jinbo Su 1
- Zhao Tong 1
- Hao Wang 1
- Liang Wang 1
- Xinming Wang 1
- Shu Wu 1
- Yufei Xiong 1
- Xingcheng Xu 1
- Yueya Xu 1
- Jiabing Yang 1
- Yujia Yang 1
- Hongzhu Yi 1
- Tao Yu 1
- Kangwei Zeng 1
- Mingchen Zhang 1
- Minghui Zhang 1
- Shanbin Zhang 1
- Xiao-Yu Zhang 1
- Xinyuan Zhang 1
- YiFan Zhang 1
- Zhang Zhang 1
- Zhenghao Zhang 1
- Yaru Zhao 1
- Huiwen Zheng 1
- Cheng Zhong 1
- Yuxuan Zhou 1