Papers by Zi Ye
From Domains to Instances: Dual-Granularity Data Synthesis for LLM Unlearning (2026.findings-acl)
Copied to clipboard
Xiaoyu Xu, Minxin Du, Zitong LI, Zi Liang, Zhibiao Guo, Zhang Shiyu, Peizhao Hu, Qingqing Ye, Haibo Hu
| Challenge: | Currently, the evaluation of unlearning is limited due to the lack of granularity in the model. |
| Approach: | They propose a framework for synthesizing high-quality forget sets that exploits the target model per se to elicit data that matches its internal knowledge distribution through seed-guided and adversarial prompting. |
| Outcome: | The proposed framework achieves a superior balance of relevance, diversity, and efficiency across benchmarks. |
Adaptive Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimization (2024.findings-emnlp)
Copied to clipboard
Yixin Ji, Yang Xiang, Juntao Li, Qingrong Xia, Zi Ye, Xinyu Duan, Zhefeng Wang, Kehai Chen, Min Zhang
| Challenge: | Large language models require a balance between efficiency and performance. |
| Approach: | They propose a low-rank compression technique that reduces non-essential parameters by decomposing weight matrices into products of two low-ranked matrici. |
| Outcome: | The proposed method outperforms existing pruning and low-rank compression techniques in maintaining model performance at the same compression ratio. |
“Yes, My LoRD.” Guiding Language Model Extraction with Locality Reinforced Distillation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for model extraction attacks on large language models are inadequate . existing methods neglect the inconsistency between training tasks and LLM alignment . |
| Approach: | They propose a model extraction algorithm that uses a policy-gradient-style training task to guide the crafting of preference for the local model. |
| Outcome: | The proposed algorithm reduces query complexity while mitigating watermark protection . it can extract various state-of-the-art commercial LLMs while minimizing query complexity . |
OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure (2025.tacl-1)
Copied to clipboard
| Challenge: | Autoregressive language models generate one token in one step, limiting inference efficiency . Existing methods do not adapt to different situations to maximize acceptance length . speculative decoding has shown great potential for lossless acceleration . |
| Approach: | They propose an algorithm to construct adaptive and scalable draft trees for autoregressive language models. |
| Outcome: | Experimental results show that OPT-Tree outperforms existing draft trees and achieves speed-up ratio of up to 3.2 compared with autoregressive decoding. |