Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kevin J. Miller

dblp:270/0463 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 46% Deep learning architectures and training · 23% Representation and self-supervised learning · 23%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation › neural program synthesis
LLM-based program synthesis
0.912025
Discovering Symbolic Cognitive Models from Human and Animal Behavior · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
cognitive modeling
0.712023
Cognitive Model Discovery via Disentangled RNNs · NeurIPS 2023
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.712023
Cognitive Model Discovery via Disentangled RNNs · NeurIPS 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › automated reasoning
model discovery
0.712023
Cognitive Model Discovery via Disentangled RNNs · NeurIPS 2023
Machine learning › Deep learning architectures and training
recurrent neural network
0.712023
Cognitive Model Discovery via Disentangled RNNs · NeurIPS 2023
Computational science and engineering › computational cognitive science
cognitive modeling
0.312025
Discovering Symbolic Cognitive Models from Human and Animal Behavior · ICML 2025
Machine learning › Reinforcement learning
bandit
0.212023
Cognitive Model Discovery via Disentangled RNNs · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

large language model · 1.7evolutionary algorithm · 1.7sparsity penalty · 0.7information bottleneck · 0.7
YearPublicationVenuePosition
2025 Discovering Symbolic Cognitive Models from Human and Animal Behavior
abstract
Symbolic models play a key role in cognitive science, expressing computationally precise hypotheses about how the brain implements a cognitive process. Identifying an appropriate model typically requires a great deal of effort and ingenuity on the part of a human scientist. Here, we adapt FunSearch (Romera-Paredes et al. 2024), a recently developed tool that uses Large Language Models (LLMs) in an evolutionary algorithm, to automatically discover symbolic cognitive models that accurately capture human and animal behavior. We consider datasets from three species performing a classic reward-learning task that has been the focus of substantial modeling effort, and find that the discovered programs outperform state-of-the-art cognitive models for each. The discovered programs can readily be interpreted as hypotheses about human and animal cognition, instantiating interpretable symbolic learning and decision-making algorithms. Broadly, these results demonstrate the viability of using LLM-powered program synthesis to propose novel scientific hypotheses regarding mechanisms of human and animal cognition.
Pablo Samuel Castro, Nenad Tomasev, Ankit Anand, Navodita Sharma, Rishika Mohanta, Aparna Dev, Kuba Perlin, Siddhant Jain, Kyle Levin, Noémi Élteto, Will Dabney, Alexander Novikov 0001, Glenn C. Turner, Maria K. Eckstein, Nathaniel D. Daw, Kevin J. Miller, Kimberly L. Stachenfeld
ICML16
2024 Understanding dual process cognition via the minimum description length principle
abstract
Dual-process theories play a central role in both psychology and neuroscience, figuring prominently in domains ranging from executive control to reward-based learning to judgment and decision making. In each of these domains, two mechanisms appear to operate concurrently, one relatively high in computational complexity, the other relatively simple. Why is neural information processing organized in this way? We propose an answer to this question based on the notion of compression. The key insight is that dual-process structure can enhance adaptive behavior by allowing an agent to minimize the description length of its own behavior. We apply a single model based on this observation to findings from research on executive control, reward-based learning, and judgment and decision making, showing that seemingly diverse dual-process phenomena can be understood as domain-specific consequences of a single underlying set of computational principles.
Ted Moskovitz, Kevin J. Miller, Maneesh Sahani, Matt M. Botvinick
PLoS Comput. Biol.2
2023 Predictive and Interpretable: Combining Artificial Neural Networks and Classic Cognitive Models to Understand Human Learning and Decision Making
Maria K. Eckstein, Christopher Summerfield, Nathaniel D. Daw, Kevin J. Miller
CogSci4
2023 Cognitive Model Discovery via Disentangled RNNs
abstract
Computational cognitive models are a fundamental tool in behavioral neuroscience. They embody in software precise hypotheses about the cognitive mechanisms underlying a particular behavior. Constructing these models is typically a difficult iterative process that requires both inspiration from the literature and the creativity of an individual researcher. Here, we adopt an alternative approach to learn parsimonious cognitive models directly from data. We fit behavior data using a recurrent neural network that is penalized for carrying excess information between timesteps, leading to sparse, interpretable representations and dynamics. When fitting synthetic behavioral data from known cognitive models, our method recovers the underlying form of those models. When fit to choice data from rats performing a bandit task, our method recovers simple and interpretable models that make testable predictions about neural mechanisms.
Kevin J. Miller, Maria K. Eckstein, Matt M. Botvinick, Zeb Kurth-Nelson
NeurIPS1