SkillZip: Contract-Preserving Graph Compression for Scalable Agent Skill Libraries

• URL: http://arxiv.org/abs/2608.05604v1
• Date: Thu, 06 Aug 2026 05:03:31 GMT
• Title: SkillZip: Contract-Preserving Graph Compression for Scalable Agent Skill Libraries
• Abstract summary: Large Language Models (LLMs) increasingly act as agents whose procedural knowledge is stored in reusable skill packages and loaded at inference time.<n>Existing systems struggle to reuse routines below the whole-skill level, preserve procedural contracts during compression, keep compressed routines executable and expandable, and update the compressed library as skills evolve.<n>We propose SkillZip, an execution-aware procedural abstraction framework that performs contract-preserving compression over section-level graphs.
• Score: 23.125090024964674
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large Language Models (LLMs) increasingly act as agents whose procedural knowledge is stored in reusable skill packages and loaded at inference time. As skill libraries grow, a central challenge is to expose the smallest sufficient executable context under a limited context budget. Existing systems struggle to reuse routines below the whole-skill level, preserve procedural contracts during compression, keep compressed routines executable and expandable, and update the compressed library as skills evolve. These challenges reveal a unit mismatch: skills are retrieved as packages, compressed as text, and converted into execution graphs only after retrieval, whereas reliable reuse requires a contract-bearing procedural unit. We propose SkillZip, an execution-aware procedural abstraction framework that performs contract-preserving compression over section-level graphs. SkillZip rewrites recurring contract-valid motifs into reversible ported macros while preserving boundary signatures, dependency closure, verifier reachability, and source-level expansion. At inference time, it hydrates a compact, dependency-closed context and expands macros only when required. ReZip further integrates new skills and revises risky macros using execution evidence. Comprehensive experiments1 on technical and embodied agent benchmarks show SkillZip consistently outperforms the strongest baseline by up to 12.2 points, while achieving a 3.46x compression ratio with 99.2% dependency preservation and 98.7% verifier reachability. Scaling analyses further confirm robust retrieval across skill libraries ranging from 200 to 100K skills.

Related papers

• From Interaction Traces to Persistent Skills: Online Evolution for Computer-Use Agents [48.50635499112162]
  We present an online skill-evolution framework that converts interaction trajectories and evaluator feedback into a persistent, versioned library of reusable procedures.<n>We compare the full evolving-library system with a configuration-matched empty-library control across four OSWorld application domains.<n>In GIMP, provenance-aware analysis reveals retrieval across task-of-origin boundaries and revision, where repeated accepted edits fail to recover the originating task.
  arXiv  Detail & Related papers  (2026-09-04T08:29:45Z)
• Benchmarking Composable Compression Techniques in Mixture-of-Experts LLMs [50.677556944160216]
  MoEXBench is a systematic benchmark for evaluating composable MoE compression as an end-to-end deployment workflow.<n>It measures composable-compression quality, workload and architecture, pruning/quantization/KV cache sensitivity, and deployment efficiency on commodity hardware.
  arXiv  Detail & Related papers  (2026-08-22T00:01:18Z)
• SkillZip: Evaluation-Free Skill Compression for Self-Evolving Agents by Discovering Reusable Structure [13.304443478478134]
  Self-evolving agents accumulate reusable skills by appending successful procedures and failure fixes.<n> Generic prompt compression is ill-suited to this setting because a skill is not a flat passage.<n>We present SkillZip, an evaluation-free method that compresses a skill by finding its shortest faithful structural explanation.
  arXiv  Detail & Related papers  (2026-08-11T15:41:19Z)
• What Should a Skill Remember? Quality--Cost Trade-offs in Cost-Aware Skill Rewriting for Language Model Agents [58.87681796862133]
  We study skill rewriting through an economic lens.<n>Our framework profiles skill structure and rewrites skills using information-preservation strategies.<n> Experiments on SkillsBench reveal distinct quality--cost trade-offs across strategies.
  arXiv  Detail & Related papers  (2026-06-08T12:36:51Z)
• Anything2Skill: Compiling External Knowledge into Reusable Skills for Agents [27.965275812765015]
  Anything2Skill is a taxonomy-guided framework that compiles heterogeneous external knowledge into reusable, retrievable, and executable skills for agents.<n>We show that Anything2Skill combined with RAG achieves 98.85% and 94.10% success rates, respectively.
  arXiv  Detail & Related papers  (2026-06-08T10:24:32Z)
• SkillRAE: Agent Skill-Based Context Compilation for Retrieval-Augmented Execution [10.83969404435554]
  Large Language Model (LLM)-based agents increasingly rely on reusable skill libraries to solve artifact-rich tasks.<n>We propose SkillRAE, a two-stage RAE approach focusing on skill-based context compilation.<n> Experiments on two public benchmarks show that SkillRAE achieves a significant improvement over baselines for RAE.
  arXiv  Detail & Related papers  (2026-05-11T07:31:48Z)
• Experience Compression Spectrum: Unifying Memory, Skills, and Rules in LLM Agents [9.989306175511238]
  LLM agents scale to long-horizon, multi-session deployments, efficiently managing accumulated experience becomes a critical bottleneck.<n>We propose the emphExperience Compression Spectrum, a unifying framework that positions memory, skills, and rules as points along a single axis of increasing compression.
  arXiv  Detail & Related papers  (2026-04-17T09:26:25Z)
• Detecting Overflow in Compressed Token Representations for Retrieval-Augmented Generation [49.48204107529758]
  We define token overflow as a regime in which compressed representations no longer contain sufficient information to answer a given query.<n>In this paper, we find that query-agnostic saturation statistics reliably separate compressed from uncompressed token representations.<n>Lightweight probing classifiers over both query and context xRAG representations detect overflow with 0.72 AUC-ROC on average.<n>These results advance from query-independent diagnostics to query-aware detectors, enabling low-cost pre-LLM gating to mitigate compression-induced errors.
  arXiv  Detail & Related papers  (2026-02-12T18:15:08Z)
• Trace: Securing Smart Contract Repository Against Access Control Vulnerability [58.02691083789239]
  GitHub hosts numerous smart contract repositories containing source code, documentation, and configuration files.<n>Third-party developers often reference, reuse, or fork code from these repositories during custom development.<n>Existing tools for detecting smart contract vulnerabilities are limited in their ability to handle complex repositories.
  arXiv  Detail & Related papers  (2025-10-22T05:18:28Z)
• UniGist: Towards General and Hardware-aligned Sequence-level Long Context Compression [86.33995240043936]
  UniGist is a sequence-level long-context compression framework for large language models.<n>It efficiently preserves context information by replacing raw tokens with special compression tokens (gists) in a fine-grained manner.<n>Our scheme also supports flexible inference by allowing the actual removal of compressed tokens, resulting in real-time memory savings.
  arXiv  Detail & Related papers  (2025-09-19T08:47:37Z)
• EXIT: Context-Aware Extractive Compression for Enhancing Retrieval-Augmented Generation [8.757777529568383]
  Current RAG systems often struggle when retrieval models fail to rank the most relevant documents.<n>We introduce EXIT, an extractive context compression framework.<n>Our evaluations show that EXIT consistently surpasses existing compression methods.
  arXiv  Detail & Related papers  (2024-12-17T05:38:27Z)
• Concise and Precise Context Compression for Tool-Using Language Models [60.606281074373136]
  We propose two strategies for compressing tool documentation into concise and precise summary sequences for tool-using language models. Results on API-Bank and APIBench show that our approach reaches a performance comparable to the upper-bound baseline under up to 16x compression ratio.
  arXiv  Detail & Related papers  (2024-07-02T08:17:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.