SearcharxivSearch

arXiv · 2607.02523

Edge-Deployable LLM Fine-Tuning on a Single GPU for Telecom Network Troubleshooting

Abstract

Telecom troubleshooting at edge sites requires low-latency model responses and localized model adaptation to satisfy operational and data sovereignty requirements. However, deploying large language models (LLMs) at telecom edge sites is constrained by limited power, cooling, space, and weight budgets for GPU infrastructure. These challenges are further amplified by human-patterned Radio Access Network (RAN) traffic that often results in low GPU utilization and poor return on investment, as well as by architectural mismatches between deterministic ASIC-based telecom processing and GPU-oriented AI workloads. Consequently, single-GPU fine-tuning becomes a practical requirement for scalable edge AI deployment rather than merely a resource limitation. This paper presents a GPU profiling study of LLM fine-tuning using the Unsloth framework on a single edge-class accelerator. We systematically analyze the effects of maximum sequence length, GPU memory utilization, Low-Rank Adaptation (LoRA) rank, and generation count on training stability and resource efficiency. We further investigate trade-offs in KV cache usage, activation memory overhead, and runtime stability under inductor compilation. In addition, we show that reasoning and non-reasoning model architectures exhibit substantially different behaviors during supervised fine-tuning (SFT) and reinforcement fine-tuning (RFT) because of differences in chat template structures, reasoning tags, and control flags. Experiments are conducted on a telecom troubleshooting dataset consisting of question-answer pairs augmented with top-3 retrieved contextual documents. The results provide practical configuration guidelines for stable, efficient, and resource-aware LLM fine-tuning in telecom edge environments.

Explore related subjects

Keep this discovery

BibTeXRIS

Chenhua Shi, Bhavika Jalli, John Zou, Gregor Macdonald, Wanlu Lei, Mridul Jain, Joji Philip. 2026-05-06. Edge-Deployable LLM Fine-Tuning on a Single GPU for Telecom Network Troubleshooting. https://arxiv.org/abs/2607.02523

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC