Skip to content

Augustinian BabyLM: What Ostensive Definition Can and Cannot Teach a Small Language Model

Sep 2026 · 0 citations · 31 references
Computer Science

Abstract

A language model normally begins training with random word embeddings: whatever'banana'means must be learned from training corpora. I implement St. Augustine's picture of word learning, meaning by ostension, for a small masked language model (DeBERTa) trained on 10M words: before training, visually grounded tokens receive embeddings derived from the image regions they label; other tokens start random. Visual initialization leaves a measurable imprint that lasts until the end of training. At the same time, the effect remains invisible under most BabyLM benchmarks, which probe abstract grammatical knowledge: visual initialization does not affect performance there. The only zero-shot exception is object-property knowledge (COMPS), where seeding helps in every configuration. To follow up on this result, I build a corpus-tailored version of the Visual-Property Swap benchmark, which tests color, material, size, and shape knowledge, with per-item training frequency and seeded status. Here, vision-seeded models have a persistent, seed-replicated advantage. Function words and abstract vocabulary also receive strong visual seeds and retain them throughout training, and the training objective draws on them: held-out mask-prediction loss falls for these words in every seed. However, no benchmark I run registers this. What evaluation would pick this up remains an open question.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Rules Amortize, Pairings Don't: Linguistic Structure Determines What Latent Task Representations Can Replace In-Context Learning

In-context learning (ICL) can be amortized into latent objects (task vectors, function vectors, context vectors) that recover few-shot behavior at zero-shot inference cost, but recent theory shows a static vector acts as a single synthetic demonstration and must fail on high-rank mappings such as word-level bijections....

Gunmay Jhingran · 0 citations
#artificial intelligence Preprint Sep 2026

Selecting The Most Informative Tokens in Natural Language Autoencoders

It is shown that useful explanations can extend beyond the model a verbalizer was trained to describe and show that pretrained verbalizers recover words that models have learned to conceal through fine-tuning, without additional verbalizer training.

Federico Torrielli, Gianluca Barmina, Andrea Blasi Núñez et al. · 0 citations
#natural language process... Preprint Sep 2026

Vectorizing Classical Tamil: Representation Learning for Verse-Commentary Pairs

TF-IDF provides a strong no-training lexical retrieval baseline, alongside representation analyses and generation controls for the learned models, and one narrow result remains: the decoder-only model prefers authentic word order in 107 of 112 minimal-pair comparisons, but does not reproduce held-out commentary content...

Amrit Gopinath, Sangeetha Sivanesan · 0 citations
Open access 2026

Beyond Literal Meaning: How LLMs Interpret Yemeni Proverbs

Results show that instruction-tuned models like GPT-4o and Gemini 1.5 Pro outperform smaller models in both automatic and human evaluations, and LLM-as-a-Judge evaluation correlates strongly with human assessment.

Nasser Thmer, Ali Allaith, Muhammad Shoaib · 0 citations

Related blog posts

Microsoft Research Blog Oct 22, 2026

Flint-interactive: A language for creating interactive data visualizations

Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.