Source author record

Matthew L. Smith

Matthew L. Smith appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

2works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

2 published item(s)

preprint2026arXiv

Predictable Confabulations: Factual Recall by LLMs Scales with Model Size and Topic Frequency

While scaling laws govern aggregate large language model performance, no scaling law has linked factual recall to both model size and training-data composition. We evaluated 38 models on over 8,900 scholarly references evaluated by an automated reference verification system. Recall quality follows a sigmoid in the log-linear combination of model parameter count and topic representation in training data. These two variables alone explain 60% of the variance across 16 dense models from four families, rising to 74-94% within individual families. The form matches a superposition-inspired account in which recall is gated by a signal-to-noise ratio: signal strength scales with concept frequency and the noise floor with model capacity.

preprint2010arXiv

On solution-free sets for simultaneous diagonal polynomials

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle method that if a subset A of the natural numbers restricted to the interval [1,N] satisfies Gowers' definition of uniformity of degree k, then it furnishes roughly the expected number of simultaneous solutions to the given equations. If A furnishes no non-trivial solutions to the given system, then we show that the number of elements of A in [1,N] grows no faster than a constant multiple of N/(log log N)^{-c} as N grows to infinity, where c>0 is a constant dependent only on k. In particular, we show that the density of A in [1,N] tends to 0 as N tends to infinity.