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

Zikun Qu

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

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

Artificial intelligence and machine learning · 1 · 1 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.

Artificial intelligence
1 paper
Efficient and distributed learning · 50% Learning paradigms · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model merging
0.912025
CALM: Consensus-Aware Localized Merging for Multi-Task Learning · ICML 2025
Machine learning › Learning paradigms
multi-task learning
0.912025
CALM: Consensus-Aware Localized Merging for Multi-Task Learning · ICML 2025
Machine learning › Efficient and distributed learning › model merging
multi-task model merging
0.912025
CALM: Consensus-Aware Localized Merging for Multi-Task Learning · ICML 2025
Machine learning › Learning paradigms › multi-task learning
parameter interference
0.912025
CALM: Consensus-Aware Localized Merging for Multi-Task Learning · ICML 2025

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

task arithmetic · 0.9consensus-aware mask optimization · 0.9
YearPublicationVenuePosition
2025 CALM: Consensus-Aware Localized Merging for Multi-Task Learning
abstract
Model merging aims to integrate the strengths of multiple fine-tuned models into a unified model while preserving task-specific capabilities. Existing methods, represented by task arithmetic, are typically classified into global- and local-aware methods. However, global-aware methods inevitably cause parameter interference, while local-aware methods struggle to maintain the effectiveness of task-specific details in the merged model. To address these limitations, we propose a Consensus Aware Localized Merging (CALM) method which incorporates localized information aligned with global task consensus, ensuring its effectiveness post-merging. CALM consists of three key components: (1) class-balanced entropy minimization sampling, providing a more flexible and reliable way to leverage unsupervised data; (2) an efficient-aware framework, selecting a small set of tasks for sequential merging with high scalability; (3) a consensus-aware mask optimization, aligning localized binary masks with global task consensus and merging them conflict-free. Experiments demonstrate the superiority and robustness of our CALM, significantly outperforming existing methods and achieving performance close to traditional MTL.
Kunda Yan, Min Zhang 0068, Sen Cui, Zikun Qu, Bo Jiang 0016, Changshui Zhang
ICML4