---
title: "Hui Li — author profile and papers — Elamur Research"
description: "Hui Li, Xidian University: 4 papers on Elamur Research (2025–2026), h-index 1 — affiliations, topics, co-authors and who cites them in our library."
canonical: "https://research.elamur.ai/free/en/authors/hui-li/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/hui-li/)

[home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Hui Li

# Hui Li

Hui Li has 4 papers in our library, in 2025–2026, most of them on [Language models & pretraining](https://md.research.elamur.ai/free/en/topics/language-models/), [Information extraction](https://md.research.elamur.ai/free/en/topics/information-extraction/), [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Biqing Qi](https://md.research.elamur.ai/free/en/authors/biqing-qi/), [Bowen Zhou](https://md.research.elamur.ai/free/en/authors/bowen-zhou/), [Han Liu](https://md.research.elamur.ai/free/en/authors/han-liu/).

4 papers in our library · 2025–2026

[OpenAlex](https://openalex.org/A5139736049) · [**h-index 1**](https://openalex.org/authors/A5139736049) · [12 works](https://openalex.org/works?filter=author.id:A5139736049) · [2 citations](https://openalex.org/works?filter=author.id:A5139736049&sort=cited_by_count:desc) OpenAlex, 2026-10-14

[📄 4 works in our library](https://md.research.elamur.ai/free/en/authors/hui-li/#papers) · [🔗 Cited 28 times in our library](https://md.research.elamur.ai/free/en/authors/hui-li/cited-by/) · [⭐ Paper Stars ranking: #8069](https://md.research.elamur.ai/free/en/paper-stars/page/81/#star-8069)

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Hui+Li) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Hui+Li) · [dblp](https://dblp.org/search?q=Hui+Li) · [ACL Anthology](https://aclanthology.org/search/?q=Hui+Li)

## Affiliations

[🎓**Xiamen University** Xiamen · China 2026 · 5 papers*current*](https://md.research.elamur.ai/free/en/universities/xiamen-university/) · [🎓**Fudan University** Shanghai · China 2026 · 2 papers*current*](https://md.research.elamur.ai/free/en/universities/fudan-university/) · [🎓**Peking University** Beijing · China 2026 · 2 papers*current*](https://md.research.elamur.ai/free/en/universities/peking-university/) · [🎓**Dalian University of Technology** Dalian · China 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/universities/dalian-university-of-technology/) · [🎓**Tsinghua University** Beijing · China 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/universities/tsinghua-university/) · [🎓**Xidian University** Xi'an · China 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/universities/xidian-university/)

From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine.

## Fields, topics and concepts

Of its works in our library, with the number of works on each.

📚 Shelves 7 The field of science this work belongs to (OpenAlex fields).[Computer Science · 4 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Arts and Humanities · 3 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Artificial Intelligence · 4 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computer Vision and Pattern Recognition · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-vision-and-pattern-recognition/) · [Language and Linguistics · 3 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · [Social Sciences · 1 work](https://md.research.elamur.ai/free/en/shelves/social-sciences/) · [Sociology and Political Science · 1 work](https://md.research.elamur.ai/free/en/shelves/social-sciences/sociology-and-political-science/)

🧭 Topics 3 Research subjects and languages the work is about.[Information extraction · 1 work](https://md.research.elamur.ai/free/en/topics/information-extraction/) · [Language models & pretraining · 1 work](https://md.research.elamur.ai/free/en/topics/language-models/) · [Reasoning · 1 work](https://md.research.elamur.ai/free/en/topics/reasoning/)

## Works by year

### 2020s

[**2026** 3 papers](https://md.research.elamur.ai/free/en/authors/hui-li/year/2026/) · [**2025** 1 paper](https://md.research.elamur.ai/free/en/authors/hui-li/year/2025/)

## Papers

The most cited first (OpenAlex and our library).

1. **[Many Heads Are Better Than One: Improved Scientific Idea Generation by A LLM-Based Multi-Agent System](https://md.research.elamur.ai/free/en/papers/su-2025-many-heads-are-better-than/)** *(2025 · 40 citations)* Most LLM tools for automated research ideation use a single agent or rely on artificial collaboration setups, such as invented researcher profiles or synthetic co-author networks.
2. **[HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy](https://md.research.elamur.ai/free/en/papers/ma-2026-hcre-llm-based-hierarchical-classification/)** *(2026 · 1 citation)* The paper addresses cross-document relation extraction (RE), where the head and tail entities of a relation appear in different documents.
3. **[Privacy Risks of Intermediate Representations: Attribute Inference in Distributed LLM Inference](https://md.research.elamur.ai/free/en/papers/lyu-2026-privacy-risks-intermediate-representations-attribute/)** *(2026)* Distributed LLM inference splits a model across several participants. They exchange hidden states rather than raw prompts, and this is widely treated as privacy-preserving. The authors test that belief. They ask whether a single honest-but-curious node can identify which sensitive attribute, such as a drug name or a…
4. **[Pru-CoT: Towards Efficient Reasoning Distillation via Pruning Chain-of-Thought](https://md.research.elamur.ai/free/en/papers/liu-2026-pru-cot-efficient-reasoning-distillation/)** *(2026)* Large reasoning models such as DeepSeek-R1 produce long Chain-of-Thought (CoT) traces that often include repeated checks and trivial restatements ("overthinking").

## Co-authors here

12 of 13 co-authors with a page, the most papers together first.

- [Biqing Qi](https://md.research.elamur.ai/free/en/authors/biqing-qi/)
- [Bowen Zhou](https://md.research.elamur.ai/free/en/authors/bowen-zhou/)
- [Han Liu](https://md.research.elamur.ai/free/en/authors/han-liu/)
- [Hong Yu](https://md.research.elamur.ai/free/en/authors/hong-yu/)
- [Jinsong Su](https://md.research.elamur.ai/free/en/authors/jinsong-su/)
- [Liang Zhang](https://md.research.elamur.ai/free/en/authors/liang-zhang/)
- [Longyue Wang](https://md.research.elamur.ai/free/en/authors/longyue-wang/)
- [Philip H. S. Torr](https://md.research.elamur.ai/free/en/authors/philip-h-s-torr/)
- [Qi Wu](https://md.research.elamur.ai/free/en/authors/qi-wu/)
- [Wanli Ouyang](https://md.research.elamur.ai/free/en/authors/wanli-ouyang/)
- [Weihua Luo](https://md.research.elamur.ai/free/en/authors/weihua-luo/)
- [Yang Xiao](https://md.research.elamur.ai/free/en/authors/yang-xiao/)

## Venues

Where their works here were published, the most works first, with the editions of those that have a page.

- [Findings of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/findings/) ×3: [Findings of the Association for Computational Linguistics 2026](https://md.research.elamur.ai/free/en/venues/findings/2026/) ×3
- [Annual Meeting of the Association for Computational Linguistics (ACL)](https://md.research.elamur.ai/free/en/venues/acl/): [ACL 2025](https://md.research.elamur.ai/free/en/venues/acl/2025/)

## Cited by

Papers of our library cite their works 28 times (of the 149,439 papers whose bibliographies we read); [6 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/hui-li/cited-by/).

Updated 1 November 2026
