Papers for

cognitive scientists

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Cognitive algorithms improved with human and AI guided program fixes

Hypothesis-guided discovery of cognitive algorithms via program refinement

Abstract: Developing cognitive models of algorithmic reasoning from behavioral data is a central problem in cognitive science that challenges current methods. Traditional approaches to cognitive modeling are interpretable and benefit from human expertise, but lack flexibility and scalability. Emerging techniques using large language models (LLMs) for de novo generation of cognitive models are scalable and flexible, but lack a role for human expertise and have mostly been applied to simpler tasks than algorithm recovery. We propose a hybrid system that treats discovery of cognitive algorithms as a program refinement problem. Human-created cognitive models are expressed as probabilistic programs and provided to a system of LLM agents with a mandate to: identify mismatches between model and behavior; propose code-level modifications within researcher-specified constraints; and verify structural fidelity. Revisions propagate to a probabilistic inference module that performs inference for latent variables and data likelihood computations. We evaluate the pipeline on human behavior in a problem-solving paradigm that exposes a variety of cognitive algorithms. Revised models consistently improve model fit relative to ancestral models and reveal a small set of recurring innovations that capture meaningful behavioral variability in this task.

Thu 1 OctArtificial Intelligence
The gist
Understanding how people think and solve problems is hard because human thinking can be complicated. This paper shows a way to improve models that explain human thinking by combining expert-made programs with large AI language models that suggest and check small program changes. These improvements better match how people actually behave in problem-solving tasks. The method helps find key changes that make models more accurate and flexible.
Open → 2610.02523v1

MaxEnt probability distributions on spheres inform models of cognition

Maximum Entropy Probability Distributions on Spheres with Fixed Mean Busemann Function and Holomorphic-Information-Geometric Model of Cognition

Abstract: In the first half of the paper we revisit the question regarding MaxEnt probability distributions on spheres. We derive families of MaxEnt distributions on spheres in real and complex vector spaces with fixed expected Busemann function (energy). As a particular case, we deduce sub-families on canonical energy levels where inverse temperature equals the dimension of the sphere. In the second part we focus on the information manifold of canonical MaxEnt distributions on the sphere in the complex vector space. This manifold is isomorphic to the Bergman ball. We introduce the reproducing kernel on this manifold and use the RKHS theory to elaborate the model of cognition. In particular, we state the principle of minimal cognitive effort in RKHS and demonstrate its dual relationship with the MaxEnt principle for probability distributions on the boundary sphere.

Thu 17 SeptInformation Theory
The gist
The paper studies the best ways to spread probabilities on spheres when we fix certain energy-like values. The authors find special families of these distributions in both real and complex spaces. Then they link these distributions to a geometric space called the Bergman ball, using advanced math tools called reproducing kernels. They propose a new way to think about cognition as minimizing effort in this geometric space, showing how it relates to the idea of maximum entropy for probabilities on the sphere.
Open → 2609.20410v1