Skip to content

Collaborative Large Model Caching and Inference Offloading With Parameter Sharing in MEC

Nov 2026 · IEEE Transactions on Parallel and Distributed Systems · Vol 37, pp. 2476-2493 · 0 citations · 55 references

Abstract

Pretrained Foundation Models (PFMs) enable highaccuracy inference services but are typically deployed in remote datacenters, resulting in prohibitively high inference delay. Mobile Edge Computing (MEC) can mitigate such high delays by caching PFMs or their fine-tuned variants on cloudlets located close to end users. However, the substantial resource requirements of PFMs and the significant parameter redundancy among their fine-tuned variants make it impractical and uneconomical for resource-constrained cloudlets to cache every large model independently. Motivated by this critical issue, we investigate the collaborative large model caching and inference offloading problem in an MEC network driven by a service market consisting of multiple selfish service providers. The novelty of our study lies in exploring parameter sharing among large models to jointly optimize inference accuracy, delay, and cost while maximizing the total payoff of the service market. To this end, we propose a coalition formation mechanism that enables economic cooperation and fair payoff allocation among different cloudlets. Specifically, we first formulate the optimization problem as a Non-Linear Integer Program (NLIP), and then reformulates it into an equivalent and computationally tractable Integer Linear Program (ILP). We then develop a resource-aware randomized algorithm with a provable approximation ratio. We further incorporate an ε-perturbed best-response process to ensure that the proposed mechanism eventually converges to a stable coalition structure. Experimental results on a real-world dataset demonstrate that the proposed algorithm reduces the average delay and cost by at least 19% and 9%, respectively, while achieving a 10% increase in the total payoff.

View source

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.