AgentGC: Evolutionary Learning-based Lossless Compression for Genomics Data with LLM-driven Multiple Agent (2026.findings-acl)
Copied to clipboard
Sun Hui, Ding Yanfeng, Huidong Ma, Chang Xu, Keyan Jin, Lizheng Zu, Cheng Zhong, Xiaoguang Liu, Gang Wang, Wentong Cai
| Challenge: | Lossless compression has made significant advancements in Genomics Data storage, sharing and management. |
| Approach: | They propose a novel agent-based GD Compressor with 3 layers with a multi-agent named Leader and Worker. |
| Outcome: | The proposed method improves on existing methods with low-level modeling and limited adaptability and user-unfriendly interface. |
Similar Papers
CoEvolve: Training LLM Agents via Agent-Data Mutual Evolution (2026.acl-long)
Copied to clipboard
| Challenge: | Extensive experiments on AppWorld and BFCL demonstrate consistent and significant improvements over strong base models, yielding absolute gains of 19.43%, 15.58%, and 18.14%, respectively. |
| Approach: | They propose a framework that extracts feedback signals such as forgetting and uncertainty from rollout trajectories and utilizes them to guide LLM-based task synthesis. |
| Outcome: | Extensive experiments on AppWorld and BFCL show that the proposed framework improves over strong base models. |
RouterHGC: Optimized Router for LLM-based Multi-Agent Systems via Heterogeneous Graph Contrastive Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs)-driven Multi-Agent Systems (MAS) have demonstrated remarkable scalability and generalizability across complex tasks. |
| Approach: | They propose a new framework for routing using large language models . they formalize routing as node selection through edge-weight prediction . |
| Outcome: | The proposed framework outperforms the best single LLM and baselines on five datasets . it achieves 0.80%–6.17% accuracy gains on MATH and HotpotQA while reducing inference cost by 27.40%. |
AgentOCR: Reimagining Agent History via Optical Self-Compression (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have enabled agentic systems trained with reinforcement learning over multi-turn interaction, but practical deployment is bottlenecked by rapidly growing textual histories that inflate token and memory costs. |
| Approach: | They propose a framework that represents the accumulated observation-action history as a compact rendered image. |
| Outcome: | The proposed framework preserves over 95% of text-based agent performance while significantly reducing token consumption (>50%), yielding consistent token and memory efficiency. |
LSDC: An Efficient and Effective Large-Scale Data Compression Method for Supervised Fine-tuning of Large Language Models (2025.findings-naacl)
Copied to clipboard
Zhaoguang Long, Yuhao Zhou, Shangqing Zhao, Yupei Ren, Li Cai, Chenghao Jia, Zhe Chen, Zhe Fang, Yuxiang Song, Man Lan
| Challenge: | Large Language Models (LLMs) are expanding in scale and size, increasing computational costs . large-scale data compression techniques can reduce the size of training datasets while maintaining data integrity. |
| Approach: | They propose a large-scale data compression method to reduce the size of training data . they use a bifurcated quantization strategy to maximize the diversity of samples . |
| Outcome: | The proposed method significantly reduces the size of training data while maximizing the submodular gain. |
Divide, Optimize, Merge: Scalable Fine-Grained Generative Optimization for LLM Agents (2025.findings-emnlp)
Copied to clipboard
Jiale Liu, Yifan Zeng, Shaokun Zhang, Chi Zhang, Malte Højmark-Bertelsen, Marie Normann Gadeberg, Huazheng Wang, Qingyun Wu
| Challenge: | LLM-based generative optimization has shown remarkable potential in improving agentic systems, but the current approach of prompting with the trajectories on the whole training dataset becomes untenable as datasets grow. |
| Approach: | They propose a scalable framework that divides large optimization tasks into manageable subsets and performs targeted optimizations. |
| Outcome: | The proposed framework outperforms conventional approach by 1.6-8.6% while reducing average prompt token consumption by 56.3%. |
BMCook: A Task-agnostic Compression Toolkit for Big Models (2022.emnlp-demos)
Copied to clipboard
Zhengyan Zhang, Baitao Gong, Yingfa Chen, Xu Han, Guoyang Zeng, Weilin Zhao, Yanxu Chen, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing efforts to compress medium-sized models for specific tasks have limited results. |
| Approach: | They propose a task-agnostic compression toolkit for big models that implements quantization, pruning, distillation and MoEfication methods. |
| Outcome: | The proposed tool improves performance on a model with 3 billion parameters by 12x . it also outperforms the original model on three typical NLP benchmarks. |
Test-Time Steering for Lossless Text Compression via Weighted Product of Experts (2025.findings-emnlp)
Copied to clipboard
| Challenge: | gzip and neural compression models often lead to poor performance in unseen data. |
| Approach: | They propose a framework that performs Test-Time Steering via a Weighted Product of Experts (wPoE) |
| Outcome: | The proposed framework performs Test-Time Steering via a Weighted Product of Experts (wPoE) it integrates with any autoregressive language model, providing a practical solution for enhancing text compression across diverse data distributions. |
Data Interpreter: An LLM Agent for Data Science (2025.findings-acl)
Copied to clipboard
Sirui Hong, Yizhang Lin, Bang Liu, Bangbang Liu, Binhao Wu, Ceyao Zhang, Danyang Li, Jiaqi Chen, Jiayi Zhang, Jinlin Wang, Li Zhang, Lingyao Zhang, Min Yang, Mingchen Zhuge, Taicheng Guo, Tuo Zhou, Wei Tao, Robert Tang, Xiangtao Lu, Xiawu Zheng, Xinbing Liang, Yaying Fei, Yuheng Cheng, Yongxin Ni, Zhibin Gou, Zongze Xu, Yuyu Luo, Chenglin Wu
| Challenge: | Large Language Models (LLMs) excel in various domains but face challenges when applied to data science workflows due to their complex, multi-stage nature. |
| Approach: | They propose a hierarchical graph-based agent that represents complexity and a progressive strategy for step-by-step verification, refinement, and consistent context management. |
| Outcome: | The proposed agent surpasses state-of-the-art baselines on the MATH dataset and performs better on InfiAgent-DABench. |
AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems (2026.acl-long)
Copied to clipboard
| Challenge: | Automated expansion methods often result in bloated structures with redundant agents, leading to excessive token consumption. |
| Approach: | They propose a plug-and-play compression framework for graph-structured multi-agent workflows . they estimate the importance score of each agent and remove redundant agents . |
| Outcome: | Experiments show that AgentSlimming reduces average token cost by 78.9% with negligible performance degradation. |
DatawiseAgent: A Notebook-Centric LLM Agent Framework for Adaptive and Robust Data Science Automation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing large language model (LLM) agents for data science automation are limited by narrow task scopes, limited generalization across tasks and models, and over-reliance on state-of-the-art (SOTA) LLMs. |
| Approach: | They propose a notebook-centric LLM agent framework for adaptive and robust data science automation. |
| Outcome: | The proposed framework surpasses baselines such as AutoGen and TaskWeaver in performance tests across diverse data science scenarios and models. |