Deep Neural Networks (DNNs) are popular for classifying large noisy analogue data. However, DNNs suffer from several known issues, including explainability, efficiency, catastrophic interference, and a need for high‐end computational resources. Our simulations reveal that psychologically‐inspired symbolic deep networks (SDNs) achieve similar accuracy and robustness to noise as DNNs on common ML problem sets, while addressing these issues.

Prior research in judgment and decision making (JDM) has investigated the effect of problem framing on human preferences. Furthermore, research in JDM documented the absence of such reversal of preferences when making decisions from experience. However, little is known about the effect of context on preferences under the combined influence of problem framing and problem format. Also, little is known about how cognitive models would account for human choices in different problem frames and types (general/specific) in the experience format. One (...) of the primary objectives of this research is to investigate the presence of preference reversals under the influence of problem framing (gain/loss), problem format (experience/description), and problem type (general/specific). Another objective of this research is to develop cognitive models to account for human choices across different problem frames and types in the experience format. A total of 320 participants from India were randomly assigned to one of eight between-subjects conditions that differed in problem frame, format, and type. Results revealed preference reversals in the description condition; however, they were absent in the experience condition. Moreover, preference reversals were less pronounced in the general problem framing compared to the specific problem framing. Furthermore, specific problems influenced risk-seeking behavior among participants. We developed cognitive and heuristics models using instance-based learning theory and natural mean heuristic. Results reveal models’ dependency on recent and frequent observations during information sampling. These experience-based cognitive models could help build artificial intelligence models with fewer preference reversals. (shrink)

We have developed a process model that learns in multiple ways while finding faults in a simple control panel device. The model predicts human participants' learning through its own learning. The model's performance was systematically compared to human learning data, including the time course and specific sequence of learned behaviors. These comparisons show that the model accounts very well for measures such as problem‐solving strategy, the relative difficulty of faults, and average fault‐finding time. More important, because the model learns and (...) transfers its learning across problems, it also accounts for the faster problem‐solving times due to learning when examined across participants, across faults, and across the series of 20 trials on an individual participant basis. The model shows how learning while problem solving can lead to more recognition‐based performance, and helps explain how the shape of the learning curve can arise through learning and be modified by differential transfer. Overall, the quality of the correspondence appears to have arisen from procedural, declarative, and episodic learning all taking place within individual problem‐solving episodes. (shrink)

A major challenge for research in artificial intelligence is to develop systems that can infer the goals, beliefs, and intentions of others (i.e., systems that have theory of mind, ToM). In this research, we propose a cognitive ToM framework that uses a well-known theory of decisions from experience to construct a computational representation of ToM. Instance-based learning theory (IBLT) is used to construct a cognitive model that generates ToM from the observation of other agents' behavior. The IBL model of the (...) observer distinguishes itself from previous models of ToM that make unreasonable assumptions about human cognition, are hand-crafted for particular settings, complex, or unable to explain a cognitive development of ToM compared to human's ToM. The IBL model learns from the observation of goal-directed agents' behavior in a gridworld navigation task, and it infers and predicts the behaviors of the agents in new gridworlds across different degrees of decision complexity in similar ways to the way human observers do. We provide evidence for the alignment of the IBL observer's predictions under various levels of decision complexity. We also advance the demonstration of the IBL predictions using a classic test of false beliefs (the Sally–Anne test), which is commonly used to test ToM in humans. We discuss our results and the potential of the IBL observer model to improve human–machine interactions. (shrink)

We argue that cognitive models can provide a common ground between human users and deep reinforcement learning (Deep RL) algorithms for purposes of explainable artificial intelligence (AI). Casting both the human and learner as cognitive models provides common mechanisms to compare and understand their underlying decision-making processes. This common grounding allows us to identify divergences and explain the learner's behavior in human understandable terms. We present novel salience techniques that highlight the most relevant features in each model's decision-making, as well (...) as examples of this technique in common training environments such as Starcraft II and an OpenAI gridworld. (shrink)

We demonstrate that the key components of cognitive architectures (declarative and procedural memory) and their key capabilities (learning, memory retrieval, probability judgment, and utility estimation) can be implemented as algebraic operations on vectors and tensors in a high‐dimensional space using a distributional semantics model. High‐dimensional vector spaces underlie the success of modern machine learning techniques based on deep learning. However, while neural networks have an impressive ability to process data to find patterns, they do not typically model high‐level cognition, and (...) it is often unclear how they work. Symbolic cognitive architectures can capture the complexities of high‐level cognition and provide human‐readable, explainable models, but scale poorly to naturalistic, non‐symbolic, or big data. Vector‐symbolic architectures, where symbols are represented as vectors, bridge the gap between the two approaches. We posit that cognitive architectures, if implemented in a vector‐space model, represent a useful, explanatory model of the internal representations of otherwise opaque neural architectures. Our proposed model, Holographic Declarative Memory (HDM), is a vector‐space model based on distributional semantics. HDM accounts for primacy and recency effects in free recall, the fan effect in recognition, probability judgments, and human performance on an iterated decision task. HDM provides a flexible, scalable alternative to symbolic cognitive architectures at a level of description that bridges symbolic, quantum, and neural models of cognition. (shrink)

This paper addresses a common challenge with computational cognitive models: identifying parameter values that are both theoretically plausible and generate predictions that match well with empirical data. While computational models can offer deep explanations of cognition, they are computationally complex and often out of reach of traditional parameter fitting methods. Weak methodology may lead to premature rejection of valid models or to acceptance of models that might otherwise be falsified. Mathematically robust fitting methods are, therefore, essential to the progress of (...) computational modeling in cognitive science. In this article, we investigate the capability and role of modern fitting methods—including Bayesian optimization and approximate Bayesian computation—and contrast them to some more commonly used methods: grid search and Nelder–Mead optimization. Our investigation consists of a reanalysis of the fitting of two previous computational models: an Adaptive Control of Thought—Rational model of skill acquisition and a computational rationality model of visual search. The results contrast the efficiency and informativeness of the methods. A key advantage of the Bayesian methods is the ability to estimate the uncertainty of fitted parameter values. We conclude that approximate Bayesian computation is (a) efficient, (b) informative, and (c) offers a path to reproducible results. (shrink)

Cognitive architectures (i.e., theorized blueprints on the structure of the mind) can be used to make predictions about the effect of multiregion brain activity on the systems level. Recent work has connected one high-level cognitive architecture, known as the “Common Model of Cognition,” to task-based functional MRI data with great success. That approach, however, was limited in that it was intrinsically top-down, and could thus only be compared with alternate architectures that the experimenter could contrive. In this paper, we propose (...) a bottom-up method to infer a cognitive architecture directly from brain imaging data itself, overcoming this limitation. Specifically, Granger causality modeling was applied to the same task-based fMRI data to infer a network of causal connections between brain regions based on their functional connectivity. The resulting network shares many connections with those proposed by the Common Model of Cognition but also suggests important additions likely related to the role of episodic memory. This combined top-down and bottom-up modeling approach can be used to help formalize the computational instantiation of cognitive architectures and further refine a comprehensive theory of cognition. (shrink)

This paper presents two cognitive models that simulate the production of referring expressions in the iMAP task—a task-oriented dialog. One general model is based on Dale and Reiter’s (1995)incremental algorithm, and the other is a simple template model that has a higher correlation with the data but is specifically geared toward the properties of the iMAP task. The property of the iMAP task environment that is modeled here is that the color feature is unreliable for identifying referents while other features (...) are reliable. The low computational cost of the incremental algorithm for generating referring expressions makes it an interesting starting point for a cognitive model. However, its explanatory power is limited, because it generates uniquely distinguishing referring expressions and because it considers features for inclusion in the referring expression in a fixed order. The first model extends the original incremental algorithm by an ability to adapt to feedback of whether a referring expression was used successfully, but it seems to overpredict the frequency with which distinguishing expressions are made and underpredict the frequency of overspecified referring expressions. The second model produces features for referring expressions purely based on its current estimate of a feature’s utility. Both models predict the observed human behavior of decreasing use of color terms and increasing use of useful feature terms. (shrink)

In this paper we propose the multiple complex systems approach for assessing domain-general complex problem-solving skills and its processes knowledge acquisition and knowledge application. After defining the construct and the formal frameworks for describing complex problems, we emphasise some of the measurement issues inherent in assessing CPS skills with single tasks. With examples of the MicroDYN test and the MicroFIN test, we show how to adequately score problem-solving skills by using multiple tasks. We discuss implications for problem-solving research and the (...) assessment of CPS skills in general. (shrink)

Topics in Cognitive Science, Volume 14, Issue 1, Page 14-30, January 2022.

A framing bias shows risk aversion in problems framed as “gains” and risk seeking in problems framed as “losses,” even when these are objectively equivalent and probabilities and outcomes values are explicitly provided. We test this framing bias in situations where decision makers rely on their own experience, sampling the problem's options and seeing the outcomes before making a choice. In Experiment 1, we replicate the framing bias in description-based decisions and find risk indifference in gains and losses in experience-based (...) decisions. Predictions of an Instance-Based Learning model suggest that objective probabilities as well as the number of samples taken are factors that contribute to the lack of framing effect. We test these two factors in Experiment 2 and find no framing effect when a few samples are taken but when large samples are taken, the framing effect appears regardless of the objective probability values. Implications of behavioral results and cognitive modeling are discussed. (shrink)

Corrigendum to "Exploration and exploitation during information search and consequential choice".

We analyze the dynamics of repeated interaction of two players in the Prisoner's Dilemma under various levels of interdependency information and propose an instance-based learning cognitive model to explain how cooperation emerges over time. Six hypotheses are tested regarding how a player accounts for an opponent's outcomes: the selfish hypothesis suggests ignoring information about the opponent and utilizing only the player's own outcomes; the extreme fairness hypothesis weighs the player's own and the opponent's outcomes equally; the moderate fairness hypothesis weighs (...) the opponent's outcomes less than the player's own outcomes to various extents; the linear increasing hypothesis increasingly weighs the opponent's outcomes at a constant rate with repeated interactions; the hyperbolic discounting hypothesis increasingly and nonlinearly weighs the opponent's outcomes over time; and the dynamic expectations hypothesis dynamically adjusts the weight a player gives to the opponent's outcomes, according to the gap between the expected and the actual outcomes in each interaction. When players lack explicit feedback about their opponent's choices and outcomes, results are consistent with the selfish hypothesis; however, when this information is made explicit, the best predictions result from the dynamic expectations hypothesis. (shrink)

In this paper, we present a competency model for complex problem solving by building on the categories of Knowledge, Skills, Abilities, and Other components. We highlight domain-general and domain-specific components in each of these categories, review established conceptualizations of CPS, and present a new model of CPS competency that is meant to provide a starting point for systematic research on training and assessment. The model highlights the idea that complex problems differ with regard to the KSAO components they demand from (...) a problem solver and that performance in one problem does not necessarily predict performance in a different problem. Implications for research on the training and assessment of CPS competency are discussed, and a selection of well-established tests for various components of the KSAO model is provided. (shrink)

The purpose of cognitive models is to make predictive simulations of human behaviour, but this is often done at the aggregate level. Cranford, Gonzalez, Aggarwal, Cooney, Tambe, and Lebiere show that they can automatically customize a model to a particular individual on‐the‐fly, and use it to make specific predictions about their next actions, in the context of a particular cybersecurity game.

This work is an initial step toward developing a cognitive theory of cyber deception. While widely studied, the psychology of deception has largely focused on physical cues of deception. Given that present‐day communication among humans is largely electronic, we focus on the cyber domain where physical cues are unavailable and for which there is less psychological research. To improve cyber defense, researchers have used signaling theory to extended algorithms developed for the optimal allocation of limited defense resources by using deceptive (...) signals to trick the human mind. However, the algorithms are designed to protect against adversaries that make perfectly rational decisions. In behavioral experiments using an abstract cybersecurity game (i.e., Insider Attack Game), we examined human decision‐making when paired against the defense algorithm. We developed an instance‐based learning (IBL) model of an attacker using the Adaptive Control of Thought‐Rational (ACT‐R) cognitive architecture to investigate how humans make decisions under deception in cyber‐attack scenarios. Our results show that the defense algorithm is more effective at reducing the probability of attack and protecting assets when using deceptive signaling, compared to no signaling, but is less effective than predicted against a perfectly rational adversary. Also, the IBL model replicates human attack decisions accurately. The IBL model shows how human decisions arise from experience, and how memory retrieval dynamics can give rise to cognitive biases, such as confirmation bias. The implications of these findings are discussed in the perspective of informing theories of deception and designing more effective signaling schemes that consider human bounded rationality. (shrink)

Topics in Cognitive Science, Volume 14, Issue 1, Page 6-13, January 2022.

Humans regularly pursue activities characterized by dramatic success or failure outcomes where, critically, the chances of success depend on the time invested working toward it. How should people allocate time between such make‐or‐break challenges and safe alternatives, where rewards are more predictable (e.g., linear) functions of performance? We present a formal framework for studying time allocation between these two types of activities, and we explore optimal behavior in both one‐shot and dynamic versions of the problem. In the one‐shot version, we (...) illustrate striking discontinuities in the optimal time allocation policy as we gradually change the parameters of the decision‐making problem. In the dynamic version, we formulate the optimal strategy—defined by a giving‐up threshold—which adaptively dictates when people should stop pursuing the make‐or‐break goal. We then show that this strategy is computationally inaccessible for humans, and we explore boundedly rational alternatives. We compare the performance of the optimal model against (a) a myopic giving‐up threshold that is easier to compute, and even simpler heuristic strategies that either (b) only decide whether or not to start pursuing the goal and never give up or (c) consider giving up at a fixed number of control points. Comparing strategies across environments, we investigate the cost and behavioral implications of sidestepping the computational burden of full rationality. (shrink)