Efficient Multi-Task Inferencing: Model Merging with Gromov-Wasserstein Feature Alignment
Not on the map. Why?
Abstract (arXiv)
Automatic scoring of student responses enhances efficiency in education, but deploying a separate neural network for each task increases storage demands, maintenance efforts, and redundant computations. To address these challenges, this paper introduces the Gromov-Wasserstein Scoring Model Merging (GW-SMM) method, which merges models based on feature distribution similarities measured via the Gromov-Wasserstein distance. Our approach begins by extracting features from student responses using individual models, capturing both item-specific context and unique learned representations. The Gromov-Wasserstein distance then quantifies the similarity between these feature distributions, identifying the most compatible models for merging. Models exhibiting the smallest pairwise distances, typically in pairs or trios, are merged by combining only the shared layers preceding the classification head. This strategy results in a unified feature extractor while preserving separate classification heads for item-specific scoring. We validated our approach against human expert knowledge and a GPT-o1-based merging method. GW-SMM consistently outperformed both, achieving a higher micro F1 score, macro F1 score, exact match accuracy, and per-label accuracy. The improvements in micro F1 and per-label accuracy were statistically significant compared to GPT-o1-based merging (p=0.04, p=0.01). Additionally, GW-SMM reduced storage requirements by half without compromising much accuracy, demonstrating its computational efficiency alongside reliable scoring performance.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 39 references that are in the map. First posted on arXiv 12 Mar 2025.
Builds on
16 of 39 references.
References · 16
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2020Knowledge Distillation: A Surveycited by 1,578
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,471
- 2017A Survey on Multi-Task Learningcited by 838
- 2018Annotation Artifacts in Natural Language Inference Datacited by 656
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
- 2020What Happens To BERT Embeddings During Fine-tuning?cited by 113
- 2023Applying Large Language Models and Chain-of-Thought for Automatic Scoringcited by 68
4 more
- 2023Fine-tuning ChatGPT for Automatic Scoringcited by 50
- 2024Investigating Automatic Scoring and Feedback using Large Language Modelscited by 5
- 2023Toward Data Efficient Model Merging between Different Datasets without Performance Degradationcited by 2
- 2024Efficient Multi-Task Inferencing with a Shared Backbone and Lightweight Task-Specific Adapters for Automatic Scoringcited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.