---
格式版本: 2
标题: "SkillZip: Evaluation-Free Skill Compression for Self-Evolving Agents by Discovering Reusable Structure"
原文链接: "https://arxiv.org/abs/2608.11079"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 15:41:19 UTC (9,520 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T11:18:51+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T11:16:29+08:00"
入库时间: "2026-08-12T03:18:51.489Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=performance&searchtype=all"
匹配关键词:
  - "performance"
  - "AI"
相关厂家:
  []
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 12
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "该论文讨论AI智能体技能压缩(SkillZip)，与超节点/AI Rack/机柜级AI基础设施及核心部件、供电、散热、互连、量产落地等完全无关，主题相关性为0。来源为arXiv学术预印本，权威性尚可；新颖性较低；无技术细节和商业信号；正文…"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T11:19:15+08:00"
AI主题相关性: 0
AI来源权威性: 8
AI新颖性: 4
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 0
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.11079"
---

## Computer Science > Artificial Intelligence

## Title:SkillZip: Evaluation-Free Skill Compression for Self-Evolving Agents by Discovering Reusable Structure

Authors:[Xiaofan Bai](https://arxiv.org/search/cs?searchtype=author&query=Bai,+X), [Hongqiang Lin](https://arxiv.org/search/cs?searchtype=author&query=Lin,+H), [Chao Liu](https://arxiv.org/search/cs?searchtype=author&query=Liu,+C), [Yantao Zhang](https://arxiv.org/search/cs?searchtype=author&query=Zhang,+Y), [Xuan Jin](https://arxiv.org/search/cs?searchtype=author&query=Jin,+X), [Xipeng Cao](https://arxiv.org/search/cs?searchtype=author&query=Cao,+X), [Yuhong Li](https://arxiv.org/search/cs?searchtype=author&query=Li,+Y)

[View PDF](https://arxiv.org/pdf/2608.11079) [HTML (experimental)](https://arxiv.org/html/2608.11079v1)

> Abstract:Self-evolving agents accumulate reusable skills by appending successful procedures and failure fixes. Over time, the same requirement is often restated in several branches, examples, and warnings, while common action sequences are copied rather than reused. The resulting skill becomes expensive to inject and difficult to maintain. Generic prompt compression is ill-suited to this setting because a skill is not a flat passage: its name and description define when it applies, its workflow controls execution, its tool and output contracts constrain validity, and rare exceptions may remain essential even when no sampled task activates them. Evaluation-guided compression can test these behaviors, but it introduces rollouts, cost, and dependence on the compression-time evaluation set. We present SkillZip, an evaluation-free method that compresses a skill by finding its shortest faithful structural explanation. The intuition is explain once, reference many: state a repeated rule once at the scope where it applies, factor a repeated action sequence into a shared procedure, and keep only the differences as explicit exceptions. We formalize this intuition as a typed minimum description-length objective over a skill contract and a residual, subject to a hard coverage constraint for every extracted trigger, workflow edge, tool requirement, obligation, and output field. The formulation provides simple sharing thresholds, preserves unique rare rules by construction, and supports efficient local updates. SkillZip has a one-shot mode with one structured extraction call and deterministic optimization, and a continual Zip-on-Write mode that integrates each self-evolution patch without replaying tasks or reparsing the full history. Through comprehensive experimental evaluations, we demonstrate the effectiveness and superiority of SkillZip in compression performance, generalizability, and cost overhead.

| Subjects: | Artificial Intelligence (cs.AI) |
| --- | --- |
| Cite as: | [arXiv:2608.11079](https://arxiv.org/abs/2608.11079) \[cs.AI\] |
|  | (or [arXiv:2608.11079v1](https://arxiv.org/abs/2608.11079v1) \[cs.AI\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.11079](https://doi.org/10.48550/arXiv.2608.11079) |

## Submission history

From: Xiaofan Bai \[[view email](https://arxiv.org/show-email/cf9a027a/2608.11079)\]  
**\[v1\]** Tue, 11 Aug 2026 15:41:19 UTC (9,520 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.11079) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
