paper-with-me

홈 › Papers

Context Compression Is Not One Thing: Readable Symbolic Re-expression vs. Coherent Summary at Matched Budget

2026-06-12 · Sisong Bei, Mikhail L. Arbuzov, Ziwei Dong, Dmitri Kalaev, Alexey Shvets arxiv

We study context compression for multi-hop question answering with small language models. We propose Telegraph English, a readable symbolic format that rewrites retrieved passages into structured entity-relation statements, preserving reasoning evidence at lower token cost. In controlled experiments on MuSiQue, TwoWiki, and HotpotQA, Telegraph English outperforms three matched-budget compression baselines (character-level deletion, truncation, and random sub-sampling) on every dataset, with gains of 13 to 20 F1 percentage point. It also outperforms a coherent prose summary produced by the same encoder on the hardest dataset. A pre-registered depth-interaction hypothesis is null: the advantage does not grow with reasoning depth within datasets. We interpret these results as evidence that readable symbolic re-expression preserves entity content more densely than either natural language or coherent summarization at matched token budget.

📄 PDF Abstract BibTeX arXiv:2606.14875

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-hop Question Answering

Similar Papers 제목 키워드 기반

Interpretable Neural PDE Solvers using Symbolic Frameworks

2023-10-31 · Yolanne Yi Ran Lee

Partial differential equations (PDEs) are ubiquitous in the world around us, modelling phenomena from heat and sound to quantum systems. Recent advances in deep learning have resulted in the development of powerful neura…

Computational EfficiencySymbolic Regression

SymPlex: A Structure-Aware Transformer for Symbolic PDE Solving

2026-02-03 · Yesom Park, Annie C. Lu, Shao-Ching Huang, Qiyang Hu 외 arxiv

We propose SymPlex, a reinforcement learning framework for discovering analytical symbolic solutions to partial differential equations (PDEs) without access to ground-truth expressions. SymPlex formulates symbolic PDE so…

Reinforcement Learning

SymbolNet: Neural Symbolic Regression with Adaptive Dynamic Pruning for Compression

2024-01-18 · Ho Fung Tsoi, Vladimir Loncar, Sridhara Dasu, Philip Harris

Compact symbolic expressions have been shown to be more efficient than neural network models in terms of resource consumption and inference speed when implemented on custom hardware such as FPGAs, while maintaining compa…

Jet TaggingModel CompressionregressionSymbolic Regression

LILO: Learning Interpretable Libraries by Compressing and Documenting Code

2023-10-30 · Gabriel Grand, Lionel Wong, Maddy Bowers, Theo X. Olausson 외

While large language models (LLMs) now excel at code generation, a key aspect of software development is the art of refactoring: consolidating code into libraries of reusable and readable programs. In this paper, we intr…

Code GenerationProgram Synthesis

Private Etymology: Designing Relational Reuse of Shared Symbols in Long-Term Human-AI Interaction

2026-08-09 · Miki Ueno arxiv

Previous studies have shown that people can develop shared symbols, partner-specific expressions, personal idioms, inside jokes, and other parts of a relational microculture. Recent work has also examined how humans and …