NAVER LABS System Re-implementation for the IWSLT 2026 Instruction-Following Task
NAVER LABS re-implements its IWSLT 2025 instruction-following pipeline for the IWSLT 2026 Shared Task (constrained condition, short audio track), adapting to mandated components: SeamlessM4T-v2-large as speech encoder and Qwen3-4B-Instruct as LLM backbone. The three-stage approach (projector alignment, text-only LoRA pre-training, multimodal merging) is preserved. Additionally, 100k synthetic instruction-following examples across ten speech-centric task types (10k per task) are constructed. The primary model achieves COMET 0.781 on EN-ZH speech translation and BERTScore-F1 0.346 on English SQA on the MCIF benchmark.
-->
[Submitted on 6 Jul 2026]
Title:NAVER LABS System Re-implementation for the IWSLT 2026 Instruction-Following Task
View a PDF of the paper titled NAVER LABS System Re-implementation for the IWSLT 2026 Instruction-Following Task, by Anand Kamble and 1 other authors
View PDF HTML (experimental)
Abstract:We re-implement the NAVER LABS IWSLT 2025 instruction-following pipeline for the IWSLT 2026 Shared Task (constrained condition, short audio track), adapting it to the mandated components: SeamlessM4T-v2-large as the speech encoder and Qwen3-4B-Instruct as the LLM backbone. The three-stage approach projector alignment, text-only LoRA pre-training, and multimodal merging is preserved from the original design. We additionally construct 100k synthetic instruction-following examples across ten speech-centric task types (10k per task) from the provided corpora, suitable for further Stage 3 fine-tuning. Our primary model achieves COMET 0.781 on EN-ZH speech translation and BERTScore-F1 0.346 on English SQA on the MCIF benchmark.
Subjects:
Computation and Language (cs.CL)
Cite as: arXiv:2607.05623 [cs.CL]
(or arXiv:2607.05623v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2607.05623
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Anand Kamble [view email] [v1] Mon, 6 Jul 2026 20:31:41 UTC (82 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled NAVER LABS System Re-implementation for the IWSLT 2026 Instruction-Following Task, by Anand Kamble and 1 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.CL
new | recent | 2026-07
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Loading...
Data provided by:
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)