Forking Paths in Neural Text Generation

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bigelow, Eric, Holtzman, Ari, Tanaka, Hidenori, Ullman, Tomer
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913607471595520
author Bigelow, Eric
Holtzman, Ari
Tanaka, Hidenori
Ullman, Tomer
author_facet Bigelow, Eric
Holtzman, Ari
Tanaka, Hidenori
Ullman, Tomer
contents Estimating uncertainty in Large Language Models (LLMs) is important for properly evaluating LLMs, and ensuring safety for users. However, prior approaches to uncertainty estimation focus on the final answer in generated text, ignoring intermediate steps that might dramatically impact the outcome. We hypothesize that there exist key forking tokens, such that re-sampling the system at those specific tokens, but not others, leads to very different outcomes. To test this empirically, we develop a novel approach to representing uncertainty dynamics across individual tokens of text generation, and applying statistical models to test our hypothesis. Our approach is highly flexible: it can be applied to any dataset and any LLM, without fine tuning or accessing model weights. We use our method to analyze LLM responses on 7 different tasks across 4 domains, spanning a wide range of typical use cases. We find many examples of forking tokens, including surprising ones such as punctuation marks, suggesting that LLMs are often just a single token away from saying something very different.
format Preprint
id arxiv_https___arxiv_org_abs_2412_07961
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Forking Paths in Neural Text Generation
Bigelow, Eric
Holtzman, Ari
Tanaka, Hidenori
Ullman, Tomer
Computation and Language
Artificial Intelligence
Machine Learning
Estimating uncertainty in Large Language Models (LLMs) is important for properly evaluating LLMs, and ensuring safety for users. However, prior approaches to uncertainty estimation focus on the final answer in generated text, ignoring intermediate steps that might dramatically impact the outcome. We hypothesize that there exist key forking tokens, such that re-sampling the system at those specific tokens, but not others, leads to very different outcomes. To test this empirically, we develop a novel approach to representing uncertainty dynamics across individual tokens of text generation, and applying statistical models to test our hypothesis. Our approach is highly flexible: it can be applied to any dataset and any LLM, without fine tuning or accessing model weights. We use our method to analyze LLM responses on 7 different tasks across 4 domains, spanning a wide range of typical use cases. We find many examples of forking tokens, including surprising ones such as punctuation marks, suggesting that LLMs are often just a single token away from saying something very different.
title Forking Paths in Neural Text Generation
topic Computation and Language
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2412.07961