| Challenge: | ternary and binary neural networks have proven difficult to optimize since both parameter and output space are discretized . authors demonstrate ternaries and binary models on downstream tasks of summarization and machine translation . |
| Approach: | They propose to use ternary and binary neural networks to optimize for multiplication-free computation . they propose to apply statistics-based quantization for the weights and elastic quantization of the activations to the transformer text generation model. |
| Outcome: | The proposed model outperforms the best existing models on machine translation tasks. |
Similar Papers
An Investigation of Suitability of Pre-Trained Language Models for Dialogue Generation – Avoiding Discrepancies (2021.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models have been widely used in open-domain dialogue generation. |
| Approach: | They propose to use decoder-only architecture to achieve excellent performance for dialogue generation. |
| Outcome: | The proposed frameworks are based on transformer-ED, transformer-Dec, transformer MLM and transformer-AR. |
Scaling Laws and Efficient Inference for Ternary Language Models (2025.acl-long)
Copied to clipboard
Tejas Vaidhya, Ayush Kaushal, Vineet Jain, Francis Couture-Harpin, Prashant Shishodia, Majid Behbahani, Yuriy Nevmyvaka, Irina Rish
| Challenge: | Large language models (LLMs) are increasingly used across research and industry applications, yet their inference efficiency remains a challenge. |
| Approach: | They propose ternary language models that employ quantization-aware training to significantly reduce memory requirements. |
| Outcome: | The proposed ternary language models demonstrate sustained performance gains at scale. |
Fully Quantized Transformer for Machine Translation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | State-of-the-art neural machine translation methods use huge amounts of parameters. |
| Approach: | They propose an all-inclusive quantization strategy for the Transformer to reduce computational costs and improve translation quality. |
| Outcome: | The proposed method achieves state-of-the-art results on most tasks compared to previous methods . |
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%. |
Transformers for Tabular Data Representation: A Survey of Models and Applications (2023.tacl-1)
Copied to clipboard
| Challenge: | Recent research efforts extend LMs by developing neural representations for structured data. |
| Approach: | They propose to extend transformer-based language models to tabular data by analyzing inputs, model training, and supported downstream tasks. |
| Outcome: | The proposed models are compared against existing models and are based on a traditional pipeline. |
Model-Generated Pretraining Signals Improves Zero-Shot Generalization of Text-to-Text Transformers (2023.acl-long)
Copied to clipboard
Linyuan Gong, Chenyan Xiong, Xiaodong Liu, Payal Bajaj, Yiqing Xie, Alvin Cheung, Jianfeng Gao, Xia Song
| Challenge: | Recent work in NLP has shown that pretrained language models have made notable progress toward generalization to unseen tasks. |
| Approach: | They propose to pretrain T5 using an auxiliary model to construct more challenging token replacements for the main model to denoise. |
| Outcome: | The proposed model outperforms similar-sized baseline models on prompted NLP benchmarks and rivals the state-of-the-art model with only **8%** of its parameters. |
Shall We Pretrain Autoregressive Language Models with Retrieval? A Comprehensive Study (2023.emnlp-main)
Copied to clipboard
Boxin Wang, Wei Ping, Peng Xu, Lawrence McAfee, Zihan Liu, Mohammad Shoeybi, Yi Dong, Oleksii Kuchaiev, Bo Li, Chaowei Xiao, Anima Anandkumar, Bryan Catanzaro
| Challenge: | a recent study shows that retrieval-augmented LMs can improve text generation quality and accuracy. |
| Approach: | They propose a model that reproduces RETRO parameters while retrieving a text corpus . they find RETRO outperforms GPT on text generation with less repetition . |
| Outcome: | The proposed model outperforms standard retrieval-augmented GPT and retrieval augmented GTP on text generation and accuracy tasks. |
Learning Deep Transformer Models for Machine Translation (P19-1)
Copied to clipboard
| Challenge: | Neural machine translation models have advanced the previous state-of-the-art by learning mappings between sequences via neural networks and attention mechanisms. |
| Approach: | They propose to use layer normalization to pass the combination of previous layers to the next layer to improve the model. |
| Outcome: | The proposed model outperforms the shallow Transformer-Big/Base baseline model on English-German and Chinese-English tasks by 0.4-2.4 BLEU points. |
Enhanced Transformer Model for Data-to-Text Generation (D19-56)
Copied to clipboard
| Challenge: | Neural models have shown significant progress on data-to-text generation tasks . data- to-text models generate descriptive texts from non-linguistic structured data . |
| Approach: | They propose a new data-to-text generation model which learns content selection and summary generation in an end-to end fashion. |
| Outcome: | The proposed model outperforms current state-of-the-art models on content selection precision and content ordering metrics. |
Recursive Top-Down Production for Sentence Generation with Latent Trees (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Various studies have shown that incorporating syntactic structures into recursive encoders can be beneficial for various natural language tasks. |
| Approach: | They propose a dynamic programming algorithm that marginalises over latent binary tree structures with N leaves to train a recursive neural function. |
| Outcome: | The proposed model outperforms previous models on the LENGTH split and English question formation tasks on the Multi30k dataset. |