Continual Instruction Tuning for LLM-based Management of Continuum Resources
Organizations: Institute of Information Science and Technologies “Alessandro Faedo”, National Research Council (ISTI-CNR), Pisa, Italy · Department of Computer Science, University of Pisa, Pisa, Italy · Department of AI, Data and Decision Sciences, LUISS University, Rome, Italy
Abstract
Large language models (LLMs) are increasingly explored for resource management across the Cloud-Edge continuum. However, embedding LLMs directly inside latency-sensitive control loops places inference latency, execution jitter, and hallucination risks on the critical path. This study argues for a different use of LLMs: a continually instruction-tuned intent compiler that runs once per management intent or declared context change, above a fast, deterministic tactical controller that handles all low-latency runtime actions. We formulate intent compilation as a continual instruction tuning problem, because management intents arrive sequentially and accumulate while infrastructure and workload contexts drift. Unlike recent LLM-based management frameworks, our design scores the model's outputs by execution, so that catastrophic forgetting can be measured in the executed objective of the underlying controller. On a continuum simulator with a 2B backbone and parameter-efficient adapters, preliminary results show that naive sequential tuning forgets earlier intents in the executed objective, that replay of stored examples nearly prevents this forgetting, and that the tuned compact compiler performs on par with simpler translators while being more robust than a grammar parser to rephrased intents.
Figures & tables
| Intent clause type and its forms | |||||||||
| latency | priority | budget | energy | residency | link | throughput | |||
| Family | latency (deadline classes) | class first | cost weight | capacity cap | energy weight | power cap | allowed layers | link budget | completion floor |
| Elastic variant: deciding how many workers to run over time | |||||||||
| budget-elastic | low | ||||||||
| bill-elastic | low | ||||||||
| Placement variant: deciding where stages run | |||||||||
| Stream I | Stream II | |||
| Method | AG | AG | ||
| Sequential IA 3 | 0.51–0.53 | 0.23–0.26 | 0.74–0.75 | 0.67–0.70 |
| Replay (50/stage) | 0.29–0.33 | 0.03 | 0.17–0.18 | 0.06–0.07 |
| Clause-type lookup | 0.31 | – | – | |
| Retrieval | 0.41 | – | – | |
| Joint ceiling | 0.28 | – | 0.15 | – |
| Method | Rollouts | Seen | Reworded |
|---|---|---|---|
| Group 1: the floor | |||
| Default (no knob chosen) | 0 | 0.93 | 0.93 |
| Group 2: given the correct canonical intent (solve score) | |||
| Clause-type lookup | 0 | 0.31 | – |
| Regression head (frozen embeddings) | 0 | 0.29 | 0.41 |
| Search at inference | 60 | 0.29 | – |
Language Model-Based Control
Language model-based control uses language models to interpret goals, choose actions, and steer AI systems or physical processes.
See all 193 papers