Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lightweight Adaptive Mixture of Neural and N-gram Language Models (1804.07705v2)

Published 20 Apr 2018 in cs.CL

Abstract: It is often the case that the best performing LLM is an ensemble of a neural LLM with n-grams. In this work, we propose a method to improve how these two models are combined. By using a small network which predicts the mixture weight between the two models, we adapt their relative importance at each time step. Because the gating network is small, it trains quickly on small amounts of held out data, and does not add overhead at scoring time. Our experiments carried out on the One Billion Word benchmark show a significant improvement over the state of the art ensemble without retraining of the basic modules.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Anton Bakhtin (16 papers)
  2. Arthur Szlam (86 papers)
  3. Marc'Aurelio Ranzato (53 papers)
  4. Edouard Grave (56 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.