Papers by Yifan Qiao
TCPO: Thought-Centric Preference Optimization for Effective Embodied Decision-making (2025.emnlp-main)
Copied to clipboard
Kechen Jiao, Zhirui Fang, Jiahao Liu, Bei Li, Qifan Wang, Xinyu Liu, Junhao Ruan, Zhongjian Qiao, Yifan Zhu, Yaxin Xu, Jingang Wang, Xiu Li
| Challenge: | Existing post-SFT methods for embodied AI are constrained by sparse rewards and action-only optimization, resulting in low sample efficiency, poor consistency, and model degradation. |
| Approach: | They propose to integrate Thought-Centric Preference Optimization (TCPO) into embodied decision-making by transforming sparse reward signals into richer step sample pairs. |
| Outcome: | The proposed approach achieves an average success rate of 26.67% in the ALFWorld environment, and a 6% improvement over RL4VLM. |
Threshold-driven Pruning with Segmented Maximum Term Weights for Approximate Cluster-based Sparse Retrieval (2024.emnlp-main)
Copied to clipboard
| Challenge: | Using rank score thresholding, sparse retrieval skips the index at cluster and document levels. |
| Approach: | They propose a pruning control scheme with a probabilistic guarantee on rank-safeness competitiveness. |
| Outcome: | The proposed pruning control scheme improves accuracy and safeness while delivering low latency on single-threaded CPU. |
PersLEARN: Research Training through the Lens of Perspective Cultivation (2023.acl-demo)
Copied to clipboard
Yu-Zhe Shi, Shiqian Li, Xinyi Niu, Qiao Xu, Jiawen Liu, Yifan Xu, Shiyu Gu, Bingru He, Xinyang Li, Xinyu Zhao, Zijian Zhao, Yidong Lyu, Zhen Li, Sijia Liu, Lin Qiu, Jinhao Ji, Lecheng Ruan, Yuxi Ma, Wenjuan Han, Yixin Zhu
| Challenge: | PersLEARN is a tool designed to facilitate the cultivation of scientific perspectives . junior researchers struggle to identify the perspectives reflected in the literature and struggle to develop their own viewpoints. |
| Approach: | They propose a tool to facilitate the cultivation of scientific perspectives by interacting with a prompt-based model and allowing students to develop their own perspectives explicitly. |
| Outcome: | The proposed tool outperforms baseline approaches across multiple domains of literature from different perspectives. |
From Mimesis to Metamorphosis: Evolving VLM Judges via In-Context Comparing and Knowledge Internalization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to subjective assessment are inconsistent and inconsistent due to inconsistent scales and inherent preference biases. |
| Approach: | They propose a framework that operationalizes subjective assessment as comparative analysis and internalizes it via Language Buttons. |
| Outcome: | The proposed framework achieves state-of-the-art performance across multiple benchmarks and is scale-steerable. |
Calibrating Inference Time Alignment with Sequence-level Risk Accumulation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to decode large language models (LLMs) often over-reject benign information, limiting their generalizability in real-world scenarios where harmful and benign information coexist. |
| Approach: | They propose a framework to regulate decoding alignments for Large Language Models (LLMs) they employ a reward-guided branch decoding paradigm to incorporate safety awareness during generation. |
| Outcome: | The proposed framework achieves superior performance on four attack benchmarks and two neutral datasets. |
Compact Token Representations with Contextual Quantization for Efficient Document Re-ranking (2022.acl-long)
Copied to clipboard
| Challenge: | Recent work has adopted a late interaction architecture with pre-computed contextual token representations at the cost of a large online storage. |
| Approach: | They propose to decouple document-specific and document-independent ranking contributions during codebook-based compression for effective online decompression and embedding composition for better search relevance. |
| Outcome: | The proposed model achieves high relevance and space efficiency with minimal computational cost and low computational complexity. |