English
Related papers

Related papers: Improving Autoregressive NLP Tasks via Modular Lin…

200 papers

Large language model (LLM) has achieved promising performance in multilingual machine translation tasks through zero/few-shot prompts or prompt-tuning. However, due to the mixture of multilingual data during the pre-training of LLM, the…

Computation and Language · Computer Science 2024-03-12 Shaojie Dai , Xin Liu , Ping Luo , Yue Yu

Large Language Models (LLMs) have become the central paradigm in artificial intelligence, yet the core computational primitive of attention has remained structurally unchanged. Local Linear Attention (LLA) is an attention mechanism derived…

Machine Learning · Computer Science 2026-05-29 Yifei Zuo , Dhruv Pai , Zhichen Zeng , Alec Dewulf , Shuming Hu , Zhaoran Wang

The evolution of large language models (LLMs) towards applications with ultra-long contexts faces challenges posed by the high computational and memory costs of the Transformer architecture. While existing sparse and linear attention…

Large language models (LLMs) have demonstrated proficiency across various natural language processing (NLP) tasks but often require additional training, such as continual pre-training and supervised fine-tuning. However, the costs…

Computation and Language · Computer Science 2024-06-07 Da Ma , Lu Chen , Pengyu Wang , Hongshen Xu , Hanqi Li , Liangtai Sun , Su Zhu , Shuai Fan , Kai Yu

Large Language Model (LLM) based text-to-speech (TTS) systems have demonstrated remarkable capabilities in handling large speech datasets and generating natural speech for new speakers. However, LLM-based TTS models are not robust as the…

Recent progress in NLP witnessed the development of large-scale pre-trained language models (GPT, BERT, XLNet, etc.) based on Transformer (Vaswani et al. 2017), and in a range of end tasks, such models have achieved state-of-the-art…

Computation and Language · Computer Science 2019-11-12 Pengxiang Cheng , Katrin Erk

Computational workloads composing traditional transformer models are starkly bifurcated. Multi-Head Attention (MHA) and Grouped-Query Attention are memory-bound due to low arithmetic intensity, while FeedForward Networks are compute-bound.…

There has been relatively little attention to incorporating linguistic prior to neural machine translation. Much of the previous work was further constrained to considering linguistic prior on the source side. In this paper, we propose a…

Computation and Language · Computer Science 2017-04-25 Akiko Eriguchi , Yoshimasa Tsuruoka , Kyunghyun Cho

High-dimensional, heterogeneous data with complex feature interactions pose significant challenges for traditional predictive modeling approaches. While Projection to Latent Structures (PLS) remains a popular technique, it struggles to…

Machine Learning · Computer Science 2025-10-21 Farwa Abbas , Hussain Ahmad , Claudia Szabo

Although Neural Machine Translation (NMT) models have advanced state-of-the-art performance in machine translation, they face problems like the inadequate translation. We attribute this to that the standard Maximum Likelihood Estimation…

Computation and Language · Computer Science 2018-11-22 Xiang Kong , Zhaopeng Tu , Shuming Shi , Eduard Hovy , Tong Zhang

As artificial neural networks grow in complexity, understanding their inner workings becomes increasingly challenging, which is particularly important in healthcare applications. The intrinsic evaluation metrics of autoregressive neural…

Computation and Language · Computer Science 2024-06-06 Changye Li , Zhecheng Sheng , Trevor Cohen , Serguei Pakhomov

The emergence of Transformer-based Large Language Models (LLMs) has substantially augmented the capabilities of Natural Language Processing (NLP), thereby intensifying the demand for computational resources. Therefore, enhancing efficiency…

Computation and Language · Computer Science 2026-01-05 Wazib Ansar , Saptarsi Goswami , Amlan Chakrabarti

Multi-head Latent Attention (MLA) is an innovative architecture proposed by DeepSeek, designed to ensure efficient and economical inference by significantly compressing the Key-Value (KV) cache into a latent vector. Compared to MLA,…

Computation and Language · Computer Science 2025-10-06 Tao Ji , Bin Guo , Yuanbin Wu , Qipeng Guo , Lixing Shen , Zhan Chen , Xipeng Qiu , Qi Zhang , Tao Gui

Diffusion language models (dLMs) have emerged as a promising paradigm that enables parallel, non-autoregressive generation, but their learning efficiency lags behind that of autoregressive (AR) language models when trained from scratch. To…

Non-autoregressive Transformers (NATs) reduce the inference latency of Autoregressive Transformers (ATs) by predicting words all at once rather than in sequential order. They have achieved remarkable progress in machine translation as well…

Computation and Language · Computer Science 2023-06-05 Chenxin An , Jiangtao Feng , Fei Huang , Xipeng Qiu , Lingpeng Kong

Large language models (LLMs) have become ubiquitous in practice and are widely used for generation tasks such as translation, summarization and instruction following. However, their enormous size and reliance on autoregressive decoding…

Machine Learning · Computer Science 2024-07-18 Benjamin Bergner , Andrii Skliar , Amelie Royer , Tijmen Blankevoort , Yuki Asano , Babak Ehteshami Bejnordi

Modern foundation models such as large language models (LLMs) and large multi-modal models (LMMs) require a massive amount of computational and memory resources. We propose a new framework to convert such LLMs/LMMs into a reduced-dimension…

Machine Learning · Computer Science 2025-05-27 Toshiaki Koike-Akino , Xiangyu Chen , Jing Liu , Ye Wang , Pu , Wang , Matthew Brand

Small language models (SLMs) have emerged as efficient alternatives to large language models for task-specific applications. However, they are often employed in high-volume, low-latency settings, where efficiency is crucial. We propose…

Computation and Language · Computer Science 2026-03-02 Dor Tsur , Sharon Adar , Ran Levy

Recently, it has been argued that encoder-decoder models can be made more interpretable by replacing the softmax function in the attention with its sparse variants. In this work, we introduce a novel, simple method for achieving sparsity in…

Computation and Language · Computer Science 2021-10-07 Biao Zhang , Ivan Titov , Rico Sennrich

Transformers with linear attention allow for efficient parallel training but can simultaneously be formulated as an RNN with 2D (matrix-valued) hidden states, thus enjoying linear-time inference complexity. However, linear attention…

Machine Learning · Computer Science 2024-08-28 Songlin Yang , Bailin Wang , Yikang Shen , Rameswar Panda , Yoon Kim
‹ Prev 1 4 5 6 7 8 10 Next ›