Paritok-4B: Intent-Conditioned Context Compression for Coding Agents

• URL: http://arxiv.org/abs/2608.24188v1
• Date: Tue, 25 Aug 2026 07:53:30 GMT
• Title: Paritok-4B: Intent-Conditioned Context Compression for Coding Agents
• Abstract summary: Paritok-4B is a 4B LoRA compressor for coding-agent trajectories built on two commitments.<n>It selects spans rather than rewriting them, and 96.4% of the identifiers, paths, and numbers it emits already appear in its input.<n>It is intent-conditioned: told the agent's current task, it acts chiefly inside a retained segment, selecting which lines survive.
• Score: 0.9689471757238836
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Coding agents re-send large file reads and tool outputs to a frontier LLM every turn, and this context dominates their token bill. General-purpose prompt compressors are trained on prose and suit code poorly: they paraphrase identifiers and drop the exact spans an agent needs to edit. We present Paritok-4B, a 4B LoRA compressor for coding-agent trajectories built on two commitments. It is extractive: it selects spans rather than rewriting them, and 96.0% of the identifiers, paths, and numbers it emits already appear in its input, holding at 96.2% on held-out SWE-bench Lite output. It is intent-conditioned: told the agent's current task, it acts chiefly inside a retained segment, selecting which lines survive (retained lines are +0.067 more intent-relevant than removed ones, paired 95% CI [+0.056, +0.078]) rather than changing how much is retained. We distil a gpt-4.1-mini teacher over 67,074 real OpenHands trajectories into 40,606 validated examples and fine-tune Qwen3-4B. On all 300 SWE-bench Lite instances, Paritok-4B compresses agent context to 25.7% of its size, 2.0x harder than a gpt-4.1-mini compressor (50.2%) and 2.4x harder than gpt-5 (61.9%), while retaining 86.5% of uncompressed single-shot solve quality. Fed the cat -n line-numbered input real agents produce, it compresses slightly less (27.8%) and retains more (89.3%); there the paired test is informative, with 30 instances solved only uncompressed and 17 only compressed, an exact McNemar p=0.079, so at this sample size compressing context to roughly a quarter of its size does not significantly reduce the solve rate. The model is a 264 MB adapter that self-hosts on one 24 GB GPU with no per-token compressor fee, which at list prices decides the economics: gpt-5 as a compressor is net-negative, costing more than the downstream tokens it saves. Weights, data, and evaluation scripts are open (Apache 2.0).

Related papers

• The Recall Trap: A Recall-Maximizing Retriever Configuration Reduces Issue Resolution in Fixed-Budget Code Context [45.88028371034407]
  We report a controlled case study in code repair, not a new phenomenon.<n>We toggle one flag (one-chunk-perfile deduplication) on an otherwise identical stack.<n>We map where it holds: it reverses on a lexical BM25 (3.2pp, significant cross-paradigm interaction)<n>We show that at a tight fixed budget, do not hard-deduplicate by file, and A/B packing policies against the task, not the metric flag was tuned.
  arXiv  Detail & Related papers  (2026-08-14T19:22:50Z)
• Smarter and Cheaper at Once: Byte-Exact KV-Cache Grafting Turns a Frozen Small Model into a Verified-Knowledge Flywheel [0.0]
  We make a frozen small language model both more capable and dramatically cheaper at once, without changing any weights.<n>We show that own-position graft is the numerically exact operating point on a model with floating-point rotary encoding.<n>We describe the system at the behavior level; the engine is proprietary, and every reported number is backed by committed input and output so the scoring can be re-checked without it.
  arXiv  Detail & Related papers  (2026-07-15T23:55:48Z)
• VisualClaw: A Real-Time, Personalized Agent for the Physical World [76.89211120690028]
  We present VisualClaw, a self-evolving multimodal agent built around two principles.<n>First, hybrid encoding reduces deployment cost by filtering less informative streaming frames with a cascaded gate.<n>Second, skill evolution lets the agent learn from failures, producing skill-bank updates that help future questions.
  arXiv  Detail & Related papers  (2026-06-15T06:58:22Z)
• Claw-SWE-Bench: A Benchmark for Evaluating OpenClaw-style Agent Harnesses on Coding Tasks [75.92297551160692]
  General-purpose agents such as OpenClaw are increasingly used as autonomous tool users.<n>We introduce Claw-SWE-Bench, a multilingual SWE-bench-style benchmark and adapter protocol.<n>Claw-SWE-Bench treats harness and cost accounting as first-class axes of SWE-style coding-agent evaluation.
  arXiv  Detail & Related papers  (2026-06-10T17:16:23Z)
• Skill-as-Pseudocode: Refactoring Skill Libraries to Pseudocode for LLM Agents [50.78646963535282]
  We propose Skill-as-Pseudocode (SaP), an automatic conversion of markdown skill libraries into typed pseudocode.<n>For each cluster of similar procedural passages drawn from one or more skills, SaP extracts a typed contract and filters it through a four-check deterministic verifier.<n>Promoted contracts are inlined into a rewritten skill skeleton together with restored concrete action templates, giving the agent two complementary signals.
  arXiv  Detail & Related papers  (2026-05-27T04:48:40Z)
• Structured Distillation for Personalized Agent Memory: 11x Token Reduction with Retrieval Preservation [0.0]
  Long conversations with an AI agent create a simple problem for one user: the history is useful, but carrying it verbatim is expensive.<n>We study personalized agent memory: one user's conversation history with an agent, distilled into a compact retrieval layer for later search.<n> Applied to 4,182 conversations (14,340 exchanges) from 6 software engineering projects, the method reduces average exchange length from 371 to 38 tokens, yielding 11x compression.
  arXiv  Detail & Related papers  (2026-03-13T14:21:58Z)
• Nacrith: Neural Lossless Compression via Ensemble Context Modeling and High-Precision CDF Coding [0.0]
  We present Nacrith, a compression system that achieves the best compression results among the systems evaluated in this study on natural language text.<n>The system requires only 500 MB of GGUF weights and 1.2 GB VRAM per worker, running on consumer GPU.<n>On alice29 (Canterbury Corpus, 152 KB), Nacrith achieves 0.918 bits per byte (bpb), while compressing below the 0th-, 1st-, and 2nd-order Shannon entropy bounds.
  arXiv  Detail & Related papers  (2026-02-23T09:14:05Z)
• Haiku to Opus in Just 10 bits: LLMs Unlock Massive Compression Gains [29.943032644387362]
  We introduce Question-Asking compression (QA), an interactive lossy protocol inspired by the game 'Twenty Questions'<n>On 8 benchmarks spanning math, science, and code, 10 binary questions recover 23% to 72% of the capability gap between a small and large model on standard benchmarks.<n>This is over 100x smaller than prior LLM-based compression.
  arXiv  Detail & Related papers  (2026-02-09T18:52:02Z)
• The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Prompts [0.0]
  We find that code generation tolerates aggressive prompt compression (r >= 0.6) while chain-of-thought reasoning degrades gradually.<n>We propose TAAC (Task-Aware Adaptive Compression), achieving 22% cost reduction with 96% quality preservation, outperforming fixed-ratio compression by 7%.
  arXiv  Detail & Related papers  (2026-01-21T18:03:27Z)
• Compressing Many-Shots in In-Context Learning [61.231471139896506]
  We study an approach to improve the memory and computational efficiency of ICL inference by compressing the many-shot prompts.<n>We first show that existing prompt compression methods are ineffective for many-shot compression.<n>We propose MemCom, a layer-wise compression method.
  arXiv  Detail & Related papers  (2025-10-17T16:57:42Z)
• R1-Compress: Long Chain-of-Thought Compression via Chunk Compression and Search [61.4807238517108]
  Chain-of-Thought (CoT) reasoning enhances large language models (LLMs) by enabling step-by-step problem-solving.<n>CoT's extension to Long-CoT introduces substantial computational overhead due to increased token length.<n>We propose R1-Compress, a two-stage chunk-level compression framework that preserves both local information and coherence.
  arXiv  Detail & Related papers  (2025-05-22T16:06:59Z)

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.