English
Related papers

Related papers: Shakespeare, Entropy and Educated Monkeys

200 papers

Despite the popularity of Shapley Values in explaining neural text classification models, computing them is prohibitive for large pretrained models due to a large number of model evaluations. In practice, Shapley Values are often estimated…

Computation and Language · Computer Science 2023-06-01 Chenghao Yang , Fan Yin , He He , Kai-Wei Chang , Xiaofei Ma , Bing Xiang

Recently long range correlations were detected in nucleotide sequences and in human writings by several authors. We undertake here a systematic investigation of two books, Moby Dick by H. Melville and Grimm's tales, with respect to the…

chao-dyn · Physics 2009-10-22 Werner Ebeling , Thorsten Pöschel

Understanding language requires grasping not only the overtly stated content, but also making inferences about things that were left unsaid. These inferences include presuppositions, a phenomenon by which a listener learns about new…

Computation and Language · Computer Science 2021-09-16 Alicia Parrish , Sebastian Schuster , Alex Warstadt , Omar Agha , Soo-Hwan Lee , Zhuoye Zhao , Samuel R. Bowman , Tal Linzen

Recent work by Zellers et al. (2018) introduced a new task of commonsense natural language inference: given an event description such as "A woman sits at a piano," a machine must select the most likely followup: "She sets her fingers on the…

Computation and Language · Computer Science 2019-05-21 Rowan Zellers , Ari Holtzman , Yonatan Bisk , Ali Farhadi , Yejin Choi

We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and…

Probability · Mathematics 2017-03-08 Eric Foxall

Pre-trained large language models can perform natural language processing downstream tasks by conditioning on human-designed prompts. However, a prompt-based approach often requires "prompt engineering" to design different prompts,…

Computation and Language · Computer Science 2024-05-28 Mingyang Song , Yi Feng , Liping Jing

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as…

Information Theory · Computer Science 2011-11-29 David Balduzzi

With recent advances in large language models (LLMs), the concept of automatically generating children's educational materials has become increasingly realistic. Working toward the goal of age-appropriate simplicity in generated educational…

Computation and Language · Computer Science 2023-10-31 Maria Valentini , Jennifer Weber , Jesus Salcido , Téa Wright , Eliana Colunga , Katharina Kann

We study whether automatically-induced prompts that effectively extract information from a language model can also be used, out-of-the-box, to probe other language models for the same information. After confirming that discrete prompts…

Computation and Language · Computer Science 2023-03-08 Nathanaël Carraz Rakotonirina , Roberto Dessì , Fabio Petroni , Sebastian Riedel , Marco Baroni

The rapid advancements in large language models (LLMs) have significantly improved their ability to generate natural language, making texts generated by LLMs increasingly indistinguishable from human-written texts. Recent research has…

Computation and Language · Computer Science 2024-12-05 Sergio E. Zanotto , Segun Aroyehun

How do language models learn to make predictions during pre-training? To study this, we extract learning curves from five autoregressive English language model pre-training runs, for 1M unseen tokens in context. We observe that the language…

Computation and Language · Computer Science 2024-08-01 Tyler A. Chang , Zhuowen Tu , Benjamin K. Bergen

We define a notion of randomness for individual and collections of formal languages based on automatic martingales acting on sequences of words from some underlying domain. An automatic martingale bets if the incoming word belongs to the…

Formal Languages and Automata Theory · Computer Science 2018-02-20 Birzhan Moldagaliyev

We investigate whether large language models can perform the creative hypothesis generation that human researchers regularly do. While the error rate is high, generative AI seems to be able to effectively structure vast amounts of…

Computation and Language · Computer Science 2023-04-25 Yang Jeong Park , Daniel Kaplan , Zhichu Ren , Chia-Wei Hsu , Changhao Li , Haowei Xu , Sipei Li , Ju Li

This paper presents a theoretical, idealized model of the thinking process with the following characteristics: 1) the model can produce complex thought sequences and can be generalized to new inputs, 2) it can receive and maintain input…

Artificial Intelligence · Computer Science 2017-04-18 Patrick Virie

Intuitively, human readers cope easily with errors in text; typos, misspelling, word substitutions, etc. do not unduly disrupt natural reading. Previous work indicates that letter transpositions result in increased reading times, but it is…

Computation and Language · Computer Science 2019-05-21 Michael Hahn , Frank Keller , Yonatan Bisk , Yonatan Belinkov

Narrative story generation is a challenging problem because it demands the generated sentences with tight semantic connections, which has not been well studied by most existing generative models. To address this problem, we propose a…

Computation and Language · Computer Science 2018-08-28 Jingjing Xu , Xuancheng Ren , Yi Zhang , Qi Zeng , Xiaoyan Cai , Xu Sun

The world has seen the emergence of machines based on pretrained models, transformers, also known as generative artificial intelligences for their ability to produce various types of content, including text, images, audio, and synthetic…

Artificial Intelligence · Computer Science 2024-10-10 Bernardo Gonçalves

Many academic journals ask their authors to provide a list of about five to fifteen keywords, to appear on the first page of each article. Since these key words are often phrases of two or more words, we prefer to call them keyphrases.…

Machine Learning · Computer Science 2007-05-23 Peter D. Turney

Recent Large Language Models (LLMs) have demonstrated remarkable capabilities in generating text that closely resembles human writing across wide range of styles and genres. However, such capabilities are prone to potential abuse, such as…

Computation and Language · Computer Science 2023-11-09 Harika Abburi , Kalyani Roy , Michael Suesserman , Nirmala Pudota , Balaji Veeramani , Edward Bowen , Sanmitra Bhattacharya

We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…

Probability · Mathematics 2020-09-23 Floris Persiau , Jasper De Bock , Gert de Cooman
‹ Prev 1 8 9 10 Next ›