cpm.applications#
Ready-made models from the literature. Most are subclasses of
Wrapper, so they can be simulated and fitted like any
model you build yourself. They compute all trials of a participant at once, and
are compiled with numba if it is installed; see Speed up fitting with numba.
Reinforcement learning#
The class implements a simple reinforcement learning model for a multi-armed bandit tasks using a standard update rule calculating prediction error and a Softmax decision rule. |
|
The class implements the hybrid model-based / model-free reinforcement learning model for the deterministic two-step task (Kool et al., 2016), in the 6-parameter variant used by Smid et al. (2022). |
Decision making#
A simplified version of the Prospect Theory-based Softmax Model (PTSM) for decision-making tasks based on Tversky & Kahneman (1992), similar to the initial publication of the theory in Kahneman & Tversky (1979). |
|
A Prospect Theory-based Softmax Model (PTSM) for decision-making tasks based on Tversky & Kahneman (1992), similar to the initial publication of the theory in Kahneman & Tversky (1979). |
|
An Prospect Theory Softmax Model loosely based on Chew et al. (2019), incorporating a bias term (phi_gain / phi_loss) in the softmax function for risks and gains, a utility curvature parameter (alpha) for non-linear utility transformations, and an ambiguity aversion parameter (eta). |
Metacognition#
Class to estimate metacognitive parameters using the meta-d model proposed by Maniscalco and Lau (2012). |
|
Estimate metacognitive parameters using the meta-d model proposed by Maniscalco and Lau (2012). |
|
Evaluate the negative log-likelihood of the parameters given the data. |