Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Changhao Guan

dblp:362/8578 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
cross-language information retrieval
0.912025
Boosting Data Utilization for Multilingual Dense Retrieval · EMNLP 2025
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.912025
Boosting Data Utilization for Multilingual Dense Retrieval · EMNLP 2025
Information retrieval
hard negative mining
0.912025
Boosting Data Utilization for Multilingual Dense Retrieval · EMNLP 2025
Information retrieval › retrieval models
retrieval model training
0.912025
Boosting Data Utilization for Multilingual Dense Retrieval · EMNLP 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.812024
DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution · ACL (1) 2024

Methods — techniques the papers use, named apart from their topics

contrastive learning · 0.9low-rank adaptation · 0.8dynamic pruning · 0.8
YearPublicationVenuePosition
2025 Boosting Data Utilization for Multilingual Dense Retrieval
abstract
Multilingual dense retrieval aims to retrieve relevant documents across different languages based on a unified retriever model.The challenge lies in aligning representations of different languages in a shared vector space.The common practice is to fine-tune the dense retriever via contrastive learning, whose effectiveness highly relies on the quality of the negative samples and the efficacy of mini-batch data.Different from the existing studies that focus on developing sophisticated model architecture, we propose a method to boost data utilization for multilingual dense retrieval by obtaining high-quality hard negative samples and effective mini-batch data.The extensive experimental results on a multilingual retrieval benchmark, MIRACL, with 16 languages demonstrate the effectiveness of our method by outperforming several existing strong baselines.
Fengran Mo, Yufeng Chen 0005, Changhao Guan, Zhenrui Yue, Xinyu Wang 0061, Jin An Xu
EMNLP4
2024 DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution
abstract
Fine-tuning large-scale pre-trained models is inherently a resource-intensive task.While it can enhance the capabilities of the model, it also incurs substantial computational costs, posing challenges to the practical application of downstream tasks.Existing parameter-efficient fine-tuning (PEFT) methods such as Low-Rank Adaptation (LoRA) rely on a bypass framework that ignores the differential parameter budget requirements across weight matrices, which may lead to suboptimal fine-tuning outcomes.To address this issue, we introduce the Dynamic Low-Rank Adaptation (DoRA) method.DoRA decomposes high-rank LoRA layers into structured single-rank components, allowing for dynamic pruning of parameter budget based on their importance to specific tasks during training, which makes the most of the limited parameter budget.Experimental results demonstrate that DoRA can achieve competitive performance compared with LoRA and full model fine-tuning, and outperform various strong baselines with the same storage parameter budget.Our code is available at https: //github.com/MIkumikumi0116/DoRA
Yulong Mao, Changhao Guan, Ganglin Bao, Fengran Mo, Jin An Xu
ACL (1)3