English
Related papers

Related papers: Faster Language Models with Better Multi-Token Pre…

200 papers

Modern tokenizers employ deterministic algorithms to map text into a single "canonical" token sequence, yet the same string can be encoded as many non-canonical tokenizations using the tokenizer vocabulary. In this work, we investigate the…

Computation and Language · Computer Science 2026-02-04 Brian Siyuan Zheng , Alisa Liu , Orevaoghene Ahia , Jonathan Hayase , Yejin Choi , Noah A. Smith

Recently, several types of end-to-end speech recognition methods named transformer-transducer were introduced. According to those kinds of methods, transcription networks are generally modeled by transformer-based neural networks, while…

Machine Learning · Computer Science 2020-11-03 Jae-Jin Jeon , Eesung Kim

Tensor decomposition is one of the well-known approaches to reduce the latency time and number of parameters of a pre-trained model. However, in this paper, we propose an approach to use tensor decomposition to reduce training time of…

Computer Vision and Pattern Recognition · Computer Science 2020-06-30 Mostafa Elhoushi , Ye Henry Tian , Zihao Chen , Farhan Shafiq , Joey Yiwei Li

This thesis provides methods and analysis of models which make progress on this goal. The techniques outlined are task agnostic, and should provide benefit when used with nearly any transformer LM. We introduce two new finetuning methods…

Computation and Language · Computer Science 2024-08-30 Davis Yoshida

Most state of the art deep neural networks are overparameterized and exhibit a high computational cost. A straightforward approach to this problem is to replace convolutional kernels with its low-rank tensor approximations, whereas the…

Computer Vision and Pattern Recognition · Computer Science 2020-08-13 Anh-Huy Phan , Konstantin Sobolev , Konstantin Sozykin , Dmitry Ermilov , Julia Gusak , Petr Tichavsky , Valeriy Glukhov , Ivan Oseledets , Andrzej Cichocki

Transformers achieve unrivalled performance in modelling language, but remain inefficient in terms of memory and time complexity. A possible remedy is to reduce the sequence length in the intermediate layers by pooling fixed-length segments…

Computation and Language · Computer Science 2023-10-25 Piotr Nawrot , Jan Chorowski , Adrian Łańcucki , Edoardo M. Ponti

Vision transformers have been widely explored in various vision tasks. Due to heavy computational cost, much interest has aroused for compressing vision transformer dynamically in the aspect of tokens. Current methods mainly pay attention…

Computer Vision and Pattern Recognition · Computer Science 2025-06-09 Fanhu Zeng , Deli Yu , Zhenglun Kong , Hao Tang

Recurrent Neural Networks can be trained to produce sequences of tokens given some input, as exemplified by recent results in machine translation and image captioning. The current approach to training them consists of maximizing the…

Machine Learning · Computer Science 2015-09-24 Samy Bengio , Oriol Vinyals , Navdeep Jaitly , Noam Shazeer

Decompositions of tensors into factor matrices, which interact through a core tensor, have found numerous applications in signal processing and machine learning. A more general tensor model which represents data as an ordered network of…

Numerical Analysis · Computer Science 2016-09-30 Anh-Huy Phan , Andrzej Cichocki , Andre Uschmajew , Petr Tichavsky , George Luta , Danilo Mandic

The cross-lingual language models are typically pretrained with masked language modeling on multilingual text or parallel sentences. In this paper, we introduce denoising word alignment as a new cross-lingual pre-training task.…

Computation and Language · Computer Science 2021-09-14 Zewen Chi , Li Dong , Bo Zheng , Shaohan Huang , Xian-Ling Mao , Heyan Huang , Furu Wei

Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging…

Machine Learning · Computer Science 2015-05-12 Qibin Zhao , Liqing Zhang , Andrzej Cichocki

Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra. Here, we present its first probabilistic treatment. We facilitate…

Machine Learning · Statistics 2018-05-15 Tammo Rukat , Chris C. Holmes , Christopher Yau

Top-$k$ decoding is a widely used method for sampling from LLMs: at each token, only the largest $k$ next-token-probabilities are kept, and the next token is sampled after re-normalizing them to sum to unity. Top-$k$ and other sampling…

Artificial Intelligence · Computer Science 2026-02-24 Georgy Noarov , Soham Mallick , Tao Wang , Sunay Joshi , Yan Sun , Yangxinyu Xie , Mengxin Yu , Edgar Dobriban

Given an input sequence (or prefix), modern language models often assign high probabilities to output sequences that are repetitive, incoherent, or irrelevant to the prefix; as such, model-generated text also contains such artifacts. To…

Computation and Language · Computer Science 2022-11-16 Kalpesh Krishna , Yapei Chang , John Wieting , Mohit Iyyer

Language prediction is constrained by informational entropy intrinsic to language, such that there exists a limit to how accurate any language model can become and equivalently a lower bound to language compression. The most efficient…

Computation and Language · Computer Science 2025-11-14 Benjamin L. Badger , Matthew Neligeorge

Multi-token prediction (MTP) is a recently proposed pre-training objective for language models. Rather than predicting only the next token (NTP), MTP predicts the next $k$ tokens at each prediction step, using multiple prediction heads. MTP…

Computation and Language · Computer Science 2025-05-30 Ansar Aynetdinov , Alan Akbik

Simultaneous translation, which starts translating each sentence after receiving only a few words in source sentence, has a vital role in many scenarios. Although the previous prefix-to-prefix framework is considered suitable for…

Computation and Language · Computer Science 2022-01-03 Zhengxin Yang

While there is much recent interest in studying why Transformer-based large language models make predictions the way they do, the complex computations performed within each layer have made their behavior somewhat opaque. To mitigate this…

Computation and Language · Computer Science 2023-06-06 Byung-Doh Oh , William Schuler

Speech-language models (SLMs) offer a promising path toward unifying speech and text understanding and generation. However, challenges remain in achieving effective cross-modal alignment and high-quality speech generation. In this work, we…

One of the most striking findings in modern research on large language models (LLMs) is that scaling up compute during training leads to better results. However, less attention has been given to the benefits of scaling compute during…

Computation and Language · Computer Science 2024-11-21 Sean Welleck , Amanda Bertsch , Matthew Finlayson , Hailey Schoelkopf , Alex Xie , Graham Neubig , Ilia Kulikov , Zaid Harchaoui