Haihui Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haihui Fan has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoyan Gu
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
8 shared publications - Bo Li
Institute of Information Engineering Chinese Academy of Sciences Beijing China
7 shared publications - Feifei Dai
Institute of Information Engineering, Chinese Academy of Sciences
6 shared publications - Dong Liu
Institute of Information Engineering, Chinese Academy of Sciences
4 shared publications - Dong Liu
Chinese Academy of Sciences
2 shared publications - Honglan Yu
Institute of Information Engineering, Chinese Academy of Sciences
2 shared publications
Latest Publications
- 3 January 2026
- Published by Springer Nature
- p. 609-618
Towards Confidential and Efficient LLM Inference with Dual Privacy Protection
- 3 January 2026
- Published by Springer Nature
- p. 609-618
Towards Confidential and Efficient LLM Inference with Dual Privacy Protection
- Open Access
Towards Confidential and Efficient LLM Inference with Dual Privacy Protection
CPU-based trusted execution environments (TEEs) and differential privacy (DP) have gained wide applications for private inference. Due to high inference latency in TEEs, researchers use partition-based approaches that offload linear model components to GPUs. However, dense nonlinear layers of large language models (LLMs) result in significant communication overhead between TEEs and GPUs. DP-based approaches apply random noise to protect data privacy, but this compromises LLM performance and semantic understanding. To overcome the above drawbacks, this paper proposes CMIF, a Confidential and efficient Model Inference Framework. CMIF confidentially deploys the embedding layer in the client-side TEE and subsequent layers on GPU servers. Meanwhile, it optimizes the Report-Noisy-Max mechanism to protect sensitive inputs with a slight decrease in model performance. Extensive experiments on Llama-series models demonstrate that CMIF reduces additional inference overhead in TEEs while preserving user data privacy.
Open AccessTowards Confidential and Efficient LLM Inference with Dual Privacy Protection
CPU-based trusted execution environments (TEEs) and differential privacy (DP) have gained wide applications for private inference. Due to high inference latency in TEEs, researchers use partition-based approaches that offload linear model components to GPUs. However, dense nonlinear layers of large language models (LLMs) result in significant communication overhead between TEEs and GPUs. DP-based approaches apply random noise to protect data privacy, but this compromises LLM performance and semantic understanding. To overcome the above drawbacks, this paper proposes CMIF, a Confidential and efficient Model Inference Framework. CMIF confidentially deploys the embedding layer in the client-side TEE and subsequent layers on GPU servers. Meanwhile, it optimizes the Report-Noisy-Max mechanism to protect sensitive inputs with a slight decrease in model performance. Extensive experiments on Llama-series models demonstrate that CMIF reduces additional inference overhead in TEEs while preserving user data privacy.
- 24 June 2025
- Published by Springer Nature
- p. 402-414
Identifying Misaligned Features for Cross-Domain Cold-Start Recommendation
- 24 June 2025
- Published by Springer Nature
- p. 402-414
Identifying Misaligned Features for Cross-Domain Cold-Start Recommendation
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 1033-1044
DisComp: A Two-Stage Prompt Optimization Framework Combining Task-Agnostic and Task-Aware Compression
Liu Quancai, Haihui Fan, Jinchao Zhang, Lixiangfang Lixiangfang, Lichuanrong Lichuanrong, Bo Li. Findings of the Association for Computational Linguistics: NAACL 2025. 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 1033-1044
Open AccessDisComp: A Two-Stage Prompt Optimization Framework Combining Task-Agnostic and Task-Aware Compression
Liu Quancai, Haihui Fan, Jinchao Zhang, Lixiangfang Lixiangfang, Lichuanrong Lichuanrong, Bo Li. Findings of the Association for Computational Linguistics: NAACL 2025. 2025.
- 26 November 2023
- Published by Springer Nature
- p. 283-296
Learning Discriminative Semantic and Multi-view Context for Domain Adaptive Few-Shot Relation Extraction
- 26 November 2023
- Published by Springer Nature
- p. 283-296
Learning Discriminative Semantic and Multi-view Context for Domain Adaptive Few-Shot Relation Extraction
- 15 November 2023
- Published by Springer Nature
- p. 561-572
Preserving Potential Neighbors for Low-Degree Nodes via Reweighting in Link Prediction
- 15 November 2023
- Published by Springer Nature
- p. 561-572
Preserving Potential Neighbors for Low-Degree Nodes via Reweighting in Link Prediction
- 26 June 2023
- Published by Springer Nature
- p. 104-118
User Popularity Preference Aware Sequential Recommendation
- 26 June 2023
- Published by Springer Nature
- p. 104-118
User Popularity Preference Aware Sequential Recommendation
- 14 April 2023
- Published by Springer Nature
- p. 121-131
Powering Fine-Tuning: Learning Compatible and Class-Sensitive Representations for Domain Adaption Few-shot Relation Extraction
- 14 April 2023
- Published by Springer Nature
- p. 121-131
Powering Fine-Tuning: Learning Compatible and Class-Sensitive Representations for Domain Adaption Few-shot Relation Extraction
- 3 April 2023
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 89 (3-4) , 449-499
Unitarily invariant norms on finite von Neumann algebras
- 3 April 2023
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 89 (3-4) , 449-499
Unitarily invariant norms on finite von Neumann algebras
- 10 May 2022
- Published by Springer Nature
- p. 393-405
Multi-granularity Evolution Network for Dynamic Link Prediction
- 10 May 2022
- Published by Springer Nature
- p. 393-405
Multi-granularity Evolution Network for Dynamic Link Prediction