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

Maria K. Eckstein

dblp:239/0176 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
7since 2021 · last 2025
0000-0002-0330-9367ORCID · verified

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

Artificial intelligence and machine learning · 8 · 3 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 7 · 3 first-author · 5 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
2 papers
Knowledge representation and reasoning · 36% Reinforcement learning · 29% Deep learning architectures and training · 18%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 10 heaviest of 11, 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
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.412020
OPtions as REsponses: Grounding behavioural hierarchies in multi-agent reinforcement learning · ICML 2020
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.412020
OPtions as REsponses: Grounding behavioural hierarchies in multi-agent reinforcement learning · ICML 2020
Algorithmic game theory and mechanism design › non-cooperative game › strategic game
non-transitive games
0.412020
OPtions as REsponses: Grounding behavioural hierarchies in multi-agent reinforcement learning · ICML 2020
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.7strategic response grounding · 0.9hierarchical agent architecture · 0.9sparsity penalty · 0.7information bottleneck · 0.7
YearPublicationVenuePosition
2025 Physical reasoning during motor learning aids people in transferring mass, but not motor control mappings
Fabian Tatai, Dominik Ürüm, Maria K. Eckstein, Constantin A. Rothkopf
CogSci3
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
ICML14
2025 Nucleus accumbens dopamine release reflects Bayesian inference during instrumental learning
abstract
Dopamine release in the nucleus accumbens has been hypothesized to signal the difference between observed and predicted reward, known as reward prediction error, suggesting a biological implementation for reinforcement learning. Rigorous tests of this hypothesis require assumptions about how the brain maps sensory signals to reward predictions, yet this mapping is still poorly understood. In particular, the mapping is non-trivial when sensory signals provide ambiguous information about the hidden state of the environment. Previous work using classical conditioning tasks has suggested that reward predictions are generated conditional on probabilistic beliefs about the hidden state, such that dopamine implicitly reflects these beliefs. Here we test this hypothesis in the context of an instrumental task (a two-armed bandit), where the hidden state switches stochastically. We measured choice behavior and recorded dLight signals that reflect dopamine release in the nucleus accumbens core. Model comparison among a wide set of cognitive models based on the behavioral data favored models that used Bayesian updating of probabilistic beliefs. These same models also quantitatively matched mesolimbic dLight measurements better than non-Bayesian alternatives. We conclude that probabilistic belief computation contributes to instrumental task performance in mice and is reflected in mesolimbic dopamine signaling.
Albert J. Qü, Lung-Hao Tai, Christopher D. Hall, Emilie M. Tu, Maria K. Eckstein, Karyna Mishchanchuk, Wan Chen Lin, Juliana Chase, Andrew F. Macaskill, Anne Gabrielle Eva Collins, Samuel Gershman, Linda Wilbrecht
PLoS Comput. Biol.5
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
CogSci1
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
NeurIPS2
2021 How the Mind Creates Structure: Hierarchical Learning of Action Sequences
Maria K. Eckstein, Anne Gabrielle Eva Collins
CogSci1
2021 Modeling changes in probabilistic reinforcement learning during adolescence
abstract
In the real world, many relationships between events are uncertain and probabilistic. Uncertainty is also likely to be a more common feature of daily experience for youth because they have less experience to draw from than adults. Some studies suggest probabilistic learning may be inefficient in youths compared to adults, while others suggest it may be more efficient in youths in mid adolescence. Here we used a probabilistic reinforcement learning task to test how youth age 8-17 (N = 187) and adults age 18-30 (N = 110) learn about stable probabilistic contingencies. Performance increased with age through early-twenties, then stabilized. Using hierarchical Bayesian methods to fit computational reinforcement learning models, we show that all participants' performance was better explained by models in which negative outcomes had minimal to no impact on learning. The performance increase over age was driven by 1) an increase in learning rate (i.e. decrease in integration time scale); 2) a decrease in noisy/exploratory choices. In mid-adolescence age 13-15, salivary testosterone and learning rate were positively related. We discuss our findings in the context of other studies and hypotheses about adolescent brain development.
Liyu Xia, Sarah L. Master, Maria K. Eckstein, Beth Baribault, Ronald E. Dahl, Linda Wilbrecht, Anne Gabrielle Eva Collins
PLoS Comput. Biol.3
2020 Learning under uncertainty changes during adolescence
Liyu Xia, Sarah L. Master, Maria K. Eckstein, Linda Wilbrecht, Anne Gabrielle Eva Collins
CogSci3
2020 OPtions as REsponses: Grounding behavioural hierarchies in multi-agent reinforcement learning
abstract
This paper investigates generalisation in multi-agent games, where the generality of the agent can be evaluated by playing against opponents it hasn’t seen during training. We propose two new games with concealed information and complex, non-transitive reward structure (think rock-paper-scissors). It turns out that most current deep reinforcement learning methods fail to efficiently explore the strategy space, thus learning policies that generalise poorly to unseen opponents. We then propose a novel hierarchical agent architecture, where the hierarchy is grounded in the game-theoretic structure of the game – the top level chooses strategic responses to opponents, while the low level implements them into policy over primitive actions. This grounding facilitates credit assignment across the levels of hierarchy. Our experiments show that the proposed hierarchical agent is capable of generalisation to unseen opponents, while conventional baselines fail to generalise whatsoever.
Alexander Vezhnevets, Yuhuai Wu, Maria K. Eckstein, Rémi Leblond, Joel Z. Leibo
ICML3
2018 Evidence for hierarchically-structured reinforcement learning in humans
Maria K. Eckstein, Anne Gabrielle Eva Collins
CogSci1