Skip to content

PTC-Decoder: Towards Intelligent SLMs on Offline Resource-Constrained Edge Devices

Sep 2026 · 0 citations · 39 references
Computer Science

TL;DR

PTC-Decoder (Plan-Tool Constrained Decoder), a training-free, plug-and-play decoder framework that combines a Plan-to-Act paradigm and a deterministic finite automaton that imposes token-level hard constraints on tool names while preserving freedom over parameter generation, thereby retaining SLM reasoning capability, is proposed.

Abstract

Deploying small language models (SLMs) on offline, resource-constrained edge devices such as remote sensing satellites presents a fundamental challenge: their limited reasoning capacity hinders reliable execution of multi-step agent tasks requiring complex tool orchestration. Existing plan-solve paradigms rely on prompt-based enforcement, which our experiments show SLMs almost entirely disregard: weak models fail to invoke the plan. We propose PTC-Decoder (Plan-Tool Constrained Decoder), a training-free, plug-and-play decoder framework that combines (1) a Plan-to-Act paradigm, which elevates planning to an atomic tool and forces its invocation at the first inference step, and (2) TC-Decoder, a deterministic finite automaton that imposes token-level hard constraints on tool names while preserving freedom over parameter generation, thereby retaining SLM reasoning capability. Evaluated on 200 real remote-sensing satellite tasks across 7 SLMs, PTC-Decoder yields a statistically significant mean overall score gain of +1.21 (p<0.01), 95% CI [+1.13, +1.29]), with consistent improvements across models and other datasets. An ablation study that removes TC-Decoder causes substantial performance degradation across all quality metrics without reducing computational cost, confirming TC-Decoder as the primary driver. PTC-Decoder thus offers a lightweight yet effective solution for improving step-level reliability, with final-answer accuracy remaining an open challenge. In essence, we enforce plan adherence by constraining the permissible output vocabulary during inference, without requiring retraining.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

OptiCom : A Unified Framework for State-Conditioned Composition in LLM-Driven Optimization

Large language models (LLMs) are increasingly deployed to solve complex scientific and practical problems via iterative optimization. However, dynamically coordinating diverse search mechanisms as candidate quality, failure modes, and resource budgets evolve remains a critical open challenge. Targeted empirical diagnos...

Chen-Xing Wei, Si-Chen Liu, Lizzie Liu et al. · 0 citations
Open access Aug 2026

Optimizing Latency and Energy Efficiency in Edge-Native Large Language Models (LLMs) for Autonomous Mobile Agents

This study introduces an edge-native framework for optimizing latency and energy efficiency in LLM-enabled autonomous mobile agents and shows decreased communication overhead, increased operational continuity, and faster response times without significantly lowering language comprehension or decision-making precision.

A. Rajalakshmi, D. Saveetha, S. V. Manikanthan et al. · 0 citations
#artificial intelligence Preprint Sep 2026

AnyAct: Universal Action for Self-Evolving Agents

AnyAct is a universal action layer that unifies available capabilities into a self-evolving action space, enabling agents to operate efficiently and reliably in large-scale, dynamic tool ecosystems and optimizes for a balance between task success rate and execution cost.

Ling-Rui Xu, Ya Jiang, Jia-Chang Zhang et al. · 0 citations
Preprint Aug 2026

AgentSpec: Speculative Decoding for Batch Inference of LLM Agents

This work proposes AgentSpec, a speculative decoding algorithm that addresses the limitations of existing methods for LLM agents and incorporates structure-isolated drafting that constrains speculation to semantically coherent segments of the agent workflow, reducing the drafts of irrelevant semantic paths and achievin...

Xin Wang, Zi-Ming Miao, Yi Zhu et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Meta-Ctrl: Guaranteed Plan Generation by Decoupling Syntactic and Semantic Constraints

Meta-Ctrl is proposed, a constrained-decoding framework that guarantees the encoded constraints while preserving the base LM's plan quality, and is demonstrated on a real tabletop robot, where every generated plan satisfies its preconditions and goals by construction.

Gwen Yidou-Weng, Edward Sun, Tian-Yi Ma et al. · 0 citations

Related blog posts

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