Skip to content
#edge computing Book Open access

MOSAIC: Efficient Collaborative Inference for Multi-Modal Large Language Models with Distributed Edge Computing

Nov 2026 · 0 citations

TL;DR

MOSAIC is presented, which adopts a component-level decomposition and distributed deployment paradigm for efficient MLLM inference at the edge, realizing three core ideas: parallel encoding, token pruning, and device-server collaboration.

Abstract

Multi-modal large language models (MLLMs) enable natural language reasoning over heterogeneous sensory data, appealing to many edge AI scenarios, yet their deployment faces competing demands on latency, energy, and quality. We present MOSAIC, which adopts a component-level decomposition and distributed deployment paradigm for efficient MLLM inference at the edge, realizing three core ideas: parallel encoding, token pruning, and device-server collaboration. Specifically, for the offline stage, modality-specific encoders distilled from a unified foundation model are co-deployed with Q-Former projection on edge devices for parallel encoding, while LoRA instruction fine-tuning adapts the frozen LLM backbone to downstream tasks. For the online stage, we formulate a multi-objective optimization over latency and energy that jointly tunes token budgets, device frequencies, and quantization precision under long-term semantic accuracy constraints, achieving dynamic token pruning and device-server collaboration. We leverage Lagrangian relaxation to decompose the original problem into tractable per-slot subproblems and design an online algorithm with provable near-optimal performance and guaranteed constraint satisfaction. We implement a realistic testbed for extensive performance evaluation, which demonstrates that MOSAIC reduces latency by up to 49.8% and energy by up to 65.1% over advanced baselines while maintaining high semantic accuracy.

Read PDF

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.