English
Related papers

Related papers: Distributional Properties of Subword Regularizatio…

200 papers

We investigate techniques for supervised domain adaptation for neural machine translation where an existing model trained on a large out-of-domain dataset is adapted to a small in-domain dataset. In this scenario, overfitting is a major…

Computation and Language · Computer Science 2017-08-01 Antonio Valerio Miceli Barone , Barry Haddow , Ulrich Germann , Rico Sennrich

Dropout is a very effective way of regularizing neural networks. Stochastically "dropping out" units with a certain probability discourages over-specific co-adaptations of feature detectors, preventing overfitting and improving network…

Neural and Evolutionary Computing · Computer Science 2017-08-04 Pietro Morerio , Jacopo Cavazza , Riccardo Volpi , Rene Vidal , Vittorio Murino

The challenges facing speech recognition systems, such as variations in pronunciations, adverse audio conditions, and the scarcity of labeled data, emphasize the necessity for a post-processing step that corrects recurring errors. Previous…

Computation and Language · Computer Science 2023-10-18 Tomer Wullach , Shlomo E. Chazan

Tokenisation is an integral part of the current NLP pipeline. Current tokenisation algorithms such as BPE and Unigram are greedy algorithms -- they make locally optimal decisions without considering the resulting vocabulary as a whole. We…

Computation and Language · Computer Science 2026-05-22 Jan Tempus , Philip Whittington , Craig W. Schmidt , Dennis Komm , Tiago Pimentel

Large language models are trained with tokenizers, and the resulting token distribution is highly imbalanced: a few words dominate the stream while most occur rarely. Recent practice favors ever-larger vocabularies, but it is unclear where…

Computation and Language · Computer Science 2025-12-01 Woojin Chung , Jeonghoon Kim

Subword tokenization critically affects Natural Language Processing (NLP) performance, yet its behavior in morphologically rich and low-resource language families remains under-explored. This study systematically compares three subword…

Computation and Language · Computer Science 2026-03-31 Nuo Xu , Ahrii Kim

We consider the problem of making machine translation more robust to character-level variation at the source side, such as typos. Existing methods achieve greater coverage by applying subword models such as byte-pair encoding (BPE) and…

Computation and Language · Computer Science 2019-02-06 Vladimir Karpukhin , Omer Levy , Jacob Eisenstein , Marjan Ghazvininejad

Current language models (LMs) use a fixed, static subword tokenizer. This default choice typically results in degraded efficiency and language capabilities, especially in languages other than English. To address this issue, we challenge the…

Computation and Language · Computer Science 2025-06-12 Darius Feher , Ivan Vulić , Benjamin Minixhofer

Dropout is a widely-used regularization technique, often required to obtain state-of-the-art for a number of architectures. This work demonstrates that dropout introduces two distinct but entangled regularization effects: an explicit effect…

Machine Learning · Computer Science 2020-10-16 Colin Wei , Sham Kakade , Tengyu Ma

Language models typically tokenize text into subwords, using a deterministic, hand-engineered heuristic of combining characters into longer surface-level strings such as 'ing' or whole words. Recent literature has repeatedly shown the…

Computation and Language · Computer Science 2023-10-19 Avijit Thawani , Saurabh Ghanekar , Xiaoyuan Zhu , Jay Pujara

Deep learning models frequently exploit spurious features in training data to achieve low training error, often resulting in poor generalization when faced with shifted testing distributions. To address this issue, various methods from…

Machine Learning · Computer Science 2025-02-11 Geraldin Nanfack , Eugene Belilovsky

In the Bayesian reinforcement learning (RL) setting, a prior distribution over the unknown problem parameters -- the rewards and transitions -- is assumed, and a policy that optimizes the (posterior) expected return is sought. A common…

Machine Learning · Computer Science 2021-09-27 Aviv Tamar , Daniel Soudry , Ev Zisselman

In natural language processing, it has been observed recently that generalization could be greatly improved by finetuning a large-scale language model pretrained on a large unlabeled corpus. Despite its recent success and wide adoption,…

Machine Learning · Computer Science 2020-01-24 Cheolhyoung Lee , Kyunghyun Cho , Wanmo Kang

Large Language Models (LLMs) have demonstrated remarkable performance across diverse domains. However, effectively leveraging their vast knowledge for training smaller downstream models remains an open challenge, especially in domains like…

Machine Learning · Computer Science 2025-07-28 Davor Vukadin , Marin Šilić , Goran Delač

Subword tokenization has become the de-facto standard for tokenization, although comparative evaluations of subword vocabulary quality across languages are scarce. Existing evaluation studies focus on the effect of a tokenization algorithm…

Computation and Language · Computer Science 2023-10-23 Lisa Beinborn , Yuval Pinter

Neural language modeling (LM) has led to significant improvements in several applications, including Automatic Speech Recognition. However, they typically require large amounts of training data, which is not available for many domains and…

Computation and Language · Computer Science 2019-06-05 Navid Rekabsaz , Nikolaos Pappas , James Henderson , Banriskhem K. Khonglah , Srikanth Madikeri

We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair…

Machine Learning · Statistics 2017-07-06 Bart van Merriënboer , Amartya Sanyal , Hugo Larochelle , Yoshua Bengio

Neural networks are often over-parameterized and hence benefit from aggressive regularization. Conventional regularization methods, such as Dropout or weight decay, do not leverage the structures of the network's inputs and hidden states.…

Machine Learning · Computer Science 2021-01-07 Hieu Pham , Quoc V. Le

We systematically explore regularizing neural networks by penalizing low entropy output distributions. We show that penalizing low entropy output distributions, which has been shown to improve exploration in reinforcement learning, acts as…

Neural and Evolutionary Computing · Computer Science 2017-01-24 Gabriel Pereyra , George Tucker , Jan Chorowski , Łukasz Kaiser , Geoffrey Hinton

Pre-trained language models can be fine-tuned to solve diverse NLP tasks, including in few-shot settings. Thus fine-tuning allows the model to quickly pick up task-specific ``skills,'' but there has been limited study of where these…

Computation and Language · Computer Science 2023-07-04 Abhishek Panigrahi , Nikunj Saunshi , Haoyu Zhao , Sanjeev Arora