Turbocharging Web Automation: The Impact of Compressed History States (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing web automation approaches ignore the importance of history states to accomplish tasks. |
| Approach: | They propose a web history compressor approach to turbocharge web automation using history states by concatenating history states with other inputs. |
| Outcome: | The proposed approach achieves 1.2-5.4% accuracy improvements over baseline methods on Mind2Web and WebLINX datasets. |
Similar Papers
Revisiting Offline Compression: Going Beyond Factorization-based Methods for Transformer Language Models (2023.findings-eacl)
Copied to clipboard
| Challenge: | Recent transformer language models achieve outstanding results on many downstream tasks, but their enormous size often makes them impractical on memory-constrained devices. |
| Approach: | They propose an offline compression approach that reduces the complexity of the model by enabling collaboration between modules. |
| Outcome: | The proposed approach outperforms commonly used factorization-based offline compression methods on various NLP tasks. |
On the Way to Lossless Compression of Language Transformers: Exploring Cross-Domain Properties of Quantization (2024.lrec-main)
Copied to clipboard
Nikita Martynov, Aleksei Goncharov, Gleb Kumichev, Evgeniy Egorov, Stanislav Vladimirovich Pavlov, Mikhail Sergeevich Durinov, Aleksandr Sergeevich Zuev, Egor Anatolievich Filimonov
| Challenge: | Modern Natural Language Processing models have a huge capacity, but this makes it difficult to employ. |
| Approach: | They propose a method to quantize at least 95% of Transformer weights without access to task-specific data so the drop in performance does not exceed 0.02%. |
| Outcome: | The proposed method quantizes 95% of Transformer weights and corresponding activations to INT8 without access to task-specific data so the drop in performance does not exceed 0.02%. |
Concise and Precise Context Compression for Tool-Using Language Models (2024.findings-acl)
Copied to clipboard
Yang Xu, Yunlong Feng, Honglin Mu, Yutai Hou, Yitong Li, Xinghao Wang, Wanjun Zhong, Zhongyang Li, Dandan Tu, Qingfu Zhu, Min Zhang, Wanxiang Che
| Challenge: | Existing methods suffer from key information loss and difficulty in adjusting the length of compressed sequences based on documentation lengths. |
| Approach: | They propose two strategies for compressing tool documentation into concise and precise summary sequences for tool-using language models. |
| Outcome: | The proposed approach achieves comparable performance to the upper-bound baseline under 16x compression ratio. |
Compressing Large-Scale Transformer-Based Models: A Case Study on BERT (2021.tacl-1)
Copied to clipboard
Prakhar Ganesh, Yao Chen, Xin Lou, Mohammad Ali Khan, Yin Yang, Hassan Sajjad, Preslav Nakov, Deming Chen, Marianne Winslett
| Challenge: | Popular pre-trained Transformers have improved performance for various NLP tasks by sizable margins, but are too resource-hungry and computation-intensive to suit low-capacity devices or applications with strict latency requirements. |
| Approach: | They present a literature review of the compression of Transformers, focusing on the popular BERT model, which has attracted considerable research attention. |
| Outcome: | The proposed models improve Sentiment analysis, paraphrase detection, machine reading comprehension, question answering, text summarization, and other tasks by sizable margins. |
Efficient Unsupervised Sentence Compression by Fine-tuning Transformers with Reinforcement Learning (2022.acl-long)
Copied to clipboard
| Challenge: | Recent unsupervised sentence compression approaches use custom objectives to guide discrete search, but guided search is expensive at inference time. |
| Approach: | They propose to use reinforcement learning to train effective sentence compression models that are also fast when generating predictions. |
| Outcome: | The proposed model outperforms other unsupervised models while being faster at inference time. |
Chunk, Align, Select: A Simple Long-sequence Processing Method for Transformers (2024.acl-long)
Copied to clipboard
| Challenge: | Existing transformer-based models struggle with long-sequence processing due to computational costs . a framework to enhance long-content processing of transformers is proposed . |
| Approach: | They propose a framework to enhance long-sequence processing of transformers by three steps . they demonstrate that the framework significantly outperforms prior long-quence processors . |
| Outcome: | The proposed framework outperforms baseline models on long-sequence summarization and reading comprehension tasks. |
Combining Compressions for Multiplicative Size Scaling on Natural Language Tasks (2022.coling-1)
Copied to clipboard
| Challenge: | Quantization, knowledge distillation, and magnitude pruning are among the most popular methods for neural network compression in NLP. |
| Approach: | They compare accuracy vs. model size tradeoffs using quantization and distillation methods . they find that pruning provides greater benefit than quantization . |
| Outcome: | The proposed methods reduce model size and can accelerate inference, but their relative benefit and combinatorial interactions have not been rigorously studied. |
When Compression Meets Model Compression: Memory-Efficient Double Compression for Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) exhibit excellent performance in various tasks, but memory requirements present a challenge when deploying on memory-limited devices. |
| Approach: | They propose a framework to compress LLM after quantization further, achieving about 2.2x compression ratio. |
| Outcome: | The proposed model can achieve 40% reduction in memory size with negligible loss in accuracy and inference speed. |
Compress to Impress: Unleashing the Potential of Compressive Memory in Real-World Long-Term Conversations (2025.coling-main)
Copied to clipboard
| Challenge: | Existing retrieval-based methods for long-term conversations face challenges in memory database management and accurate memory retrieval, hindering their efficacy in dynamic, real-world interactions. |
| Approach: | They propose a framework that eschews traditional retrieval modules and memory databases and adopts a “One-for-All” approach to manage memory generation, compression, and response generation. |
| Outcome: | The proposed framework produces more nuanced and human-like experiences than retrieval-based methods. |
ReadOnce Transformers: Reusable Representations of Text for Transformers (2021.acl-long)
Copied to clipboard
| Challenge: | ReadOnce Transformers is a task-independent, task-dependent, and compressed representation of text. |
| Approach: | They propose a transformer-based model that can build an information-capturing, task-independent, and compressed representation of text. |
| Outcome: | The proposed model can build an information-capturing, task-independent, and compressed representation of text. |