Papers by Zirui Hu
Dual-Channel Evidence Fusion for Fact Verification over Texts and Tables (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing fact extraction and verification tasks only consider evidence of a single format . Existing models convert evidence into either sentences or tables, thus losing context information . |
| Approach: | They propose a Dual Channel Unified Format fact verification model which unifies various evidence into parallel streams, i.e., natural language sentences and a global evidence table, simultaneously. |
| Outcome: | The proposed model outperforms existing models in two formats by a large margin . it makes the most of existing tables and tables to absorb evidence of two formats . |
UnifEE: Unified Evidence Extraction for Fact Verification (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing models extract evidence in both sentences and table cells from Wikipedia dumps, ignoring potential connections between them. |
| Approach: | They propose a model which uses a mixed evidence graph to extract the evidence in both formats without manually designed conversion rules. |
| Outcome: | The proposed model outperforms existing models and improves the verification step. |
Taylor Unswift: Secured Weight Release for Large Language Models via Taylor Expansion (2024.emnlp-main)
Copied to clipboard
Guanchu Wang, Yu-Neng Chuang, Ruixiang Tang, Shaochen Zhong, Jiayi Yuan, Hongye Jin, Zirui Liu, Vipin Chaudhary, Shuai Xu, James Caverlee, Xia Hu
| Challenge: | Existing mechanisms compromise ownership rights or raise data privacy concerns . existing mechanisms compromise security of released large language models . |
| Approach: | They propose a TaylorMLP to preserve the ownership of large language models by transforming the weights of LLMs into Taylor-series parameters instead of releasing original weights . |
| Outcome: | The proposed model preserves ownership of large language models and prevents their abuse by adjusting the generation speed and causing low-speed token generation. |
SAFER: A Controllable Safeguard for LLMs against Backdoor Attacks (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing inference-time defenses lack explicit control over false acceptance rate (FAR) existing inference time defenses aim to mitigate poisoned inputs but lack explicit FAR control . |
| Approach: | They propose a framework that provides explicit control over false acceptance rate without prior knowledge of backdoor samples. |
| Outcome: | The proposed framework outperforms existing inference-time defenses on three benchmark datasets . it provides explicit and provable control over false acceptance rate without prior knowledge of backdoor samples . |
Enhancing Structured Evidence Extraction for Fact Verification (2023.emnlp-main)
Copied to clipboard
| Challenge: | Open-domain fact verification requires extracting and integrating both structured and unstructured evidence to verify a claim. |
| Approach: | They propose a method to enhance the extraction of structured evidence by leveraging the row and column semantics of tables. |
| Outcome: | The proposed method achieves evidence recall of 60.01% on the test set, higher than the previous state-of-the-art method. |
KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches (2024.findings-emnlp)
Copied to clipboard
Jiayi Yuan, Hongyi Liu, Shaochen Zhong, Yu-Neng Chuang, Songchen Li, Guanchu Wang, Duy Le, Hongye Jin, Vipin Chaudhary, Zhaozhuo Xu, Zirui Liu, Xia Hu
| Challenge: | Long context capability is a crucial competency for large language models as it mitigates the human struggle to digest long-form texts. |
| Approach: | They propose to evaluate 10+ state-of-the-art approaches for long context-capable LLMs. |
| Outcome: | The proposed methods are compared against 10+ state-of-the-art approaches across seven categories of long context tasks. |
Learning to Compress Prompt in Natural Language Formats (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing work rely on compressing long contexts into soft prompts, but soft prompt compression encounters limitations in transferability . natural language (NL) prompts are incompatible with back-propagation, and NL prompts lack flexibility in imposing length constraints. |
| Approach: | They propose a framework that compresses long prompts into NL formatted Capsule Prompts. |
| Outcome: | The proposed framework reduces 81.4% of the original length, decreases inference latency up to 4.5x, and saves 80.1% of budget overheads while providing transferability across diverse LLMs and different datasets. |
Controllable Contamination Detection for Reliable LLM Evaluation with Statistical Guarantees (2026.acl-long)
Copied to clipboard
Zheng Zhang, Qi Liu, Siyuan Liang, Ning Li, Zirui Hu, Weibo Gao, Rui Li, Zhenya Huang, Leszek Rutkowski, Baosheng Yu, Dacheng Tao
| Challenge: | Existing training data detectors fail to detect clean samples from contaminated test sets . existing methods fail to identify clean samples due to black-box nature of LLMs . |
| Approach: | They propose a framework that detects and filters contaminated evaluation data . they propose 'failure detection' to reduce the proportion of contaminated samples mistakenly retained . |
| Outcome: | The proposed framework reduces false discovery rate (FDR) under valid FDR control while maintaining evaluation consistency. |
LoRATK: LoRA Once, Backdoor Everywhere in the Share-and-Play Ecosystem (2025.findings-emnlp)
Copied to clipboard
Hongyi Liu, Shaochen Zhong, Xintong Sun, Minghao Tian, Mohsen Hariri, Zirui Liu, Ruixiang Tang, Zhimeng Jiang, Jiayi Yuan, Yu-Neng Chuang, Li Li, Soo-Hyun Choi, Rui Chen, Vipin Chaudhary, Xia Hu
| Challenge: | distributing LLMs without a proven track record like ‘meta-llama‘ or ‘qwen‘ rarely gains community traction. |
| Approach: | They propose a simple, efficient, yet specific recipe for a backdoor LoRA to be injected into task-enhancing LoRAs and examine the mechanisms of such infections. |
| Outcome: | The proposed model allows attackers to scale the distribution of compromised LoRAs with minimal effort by leveraging the rich pool of shared LoRA assets. |