{"title":"Systems factorial technology: Unconditional interaction contrasts for correct and incorrect responses","authors":"Matthias Gondan, Lukas Legner","doi":"10.1016/j.jmp.2026.102983","DOIUrl":"10.1016/j.jmp.2026.102983","url":null,"abstract":"<div><div>Response time is probably the most important metric in cognitive psychology. Many studies focus on average response time, but even more information can be obtained considering the shape of the response time distributions. In their seminal work, Townsend and Nozawa (1995) investigated the interaction contrast of response time distributions in two-factorial experiments for different cognitive architectures, including serial and parallel processing, with exhaustive and self-terminating stopping rules. They derived distinct, nonparametric predictions for the interaction contrast under fairly weak assumptions: selective influence of the factorial manipulations, and stochastic ordering of the processing times for the different factor levels. Their original theory is limited to tasks with ceiling accuracy. Extensions to more difficult tasks either conditioned the response time distributions on accuracy, which interferes with the assumption of stochastic ordering. Other approaches focused on a special case of the paradigm (i.e., redundant signals tasks). Here we show that with a slight extension of the stochastic dominance assumption, Townsend and Nozawa’s theorems can be generalized to difficult tasks that entail non-negligible error rates. We demonstrate statistical tests and illustrate methods to assess their power. We investigate additional generalizations of the theory to higher-order experimental manipulations and larger networks of serial and parallel processes. Interesting special cases such as redundant signals tasks and parametric experimental variations, as well as applications of the theory in areas outside cognitive psychology are proposed and discussed. More than 150 years after Donders, we can finally design and analyze interesting reaction time experiments with non-negligible error rates.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"129 ","pages":"Article 102983"},"PeriodicalIF":1.5,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147798360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sampling in constrained space: Efficient estimation of model evidence under equality and inequality constraints","authors":"Lukas L. Lengersdorff , Maarten Marsman","doi":"10.1016/j.jmp.2026.102989","DOIUrl":"10.1016/j.jmp.2026.102989","url":null,"abstract":"<div><div>Many scientific theories imply equality and inequality constraints on the statistical model underlying the observed data. Incorporating such constraints into hypothesis testing increases the efficiency and precision of inference. However, existing tools of testing such hypotheses are computationally expensive and do not scale well to complex sets of constraints. Here, we introduce Sampling in Constrained Space (SICS), a general approach for performing Bayesian hypothesis testing on constrained models. Combining Hamiltonian Monte Carlo algorithms with reparameterization, SICS allows the efficient sampling of the posterior distribution from those sections of the parameter space that fulfill all constraints. This, in turn, enables estimating the marginal likelihood under the constrained model, through established algorithms such as bridge sampling. We demonstrate the versatility of SICS by analyzing a learning task dataset using constrained reinforcement learning models, from both a single-level and hierarchical perspective. Our results show that SICS outperforms previous approaches in terms of precision and efficiency. By providing guidelines on its application, we hope to make SICS an integral part of scientists’ inferential toolkit.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"129 ","pages":"Article 102989"},"PeriodicalIF":1.5,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147798361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Representing choice probabilities by ranking probabilities via entropy maximization","authors":"Karim Kilani , Hans Colonius","doi":"10.1016/j.jmp.2026.102970","DOIUrl":"10.1016/j.jmp.2026.102970","url":null,"abstract":"<div><div>Falmagne’s representation problem is revisited by maximizing Shannon entropy applied to ranking probabilities, under the linear constraints imposed by choice probabilities. Unlike Falmagne’s recursive construction, our method leads directly to an explicit solution, obtained after transforming the initial system into an equivalent one via alternating sums, in the spirit of Block–Marschak polynomials. We compute this solution for the Luce model and the generalized extreme value model, and show that, as soon as there are at least four alternatives, the construction based on Shannon entropy is only one among infinitely many possible representations. Other solutions could be obtained by maximizing alternative entropy functions, further highlighting the potential role of information theory in enriching the analysis of stochastic choice.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102970"},"PeriodicalIF":1.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146077915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analytical bifurcation analysis of mean-field Ising models reveals connectivity as a risk factor for psychopathology","authors":"Han L.J. van der Maas, Lourens Waldorp","doi":"10.1016/j.jmp.2025.102968","DOIUrl":"10.1016/j.jmp.2025.102968","url":null,"abstract":"<div><div>The connectivity hypothesis, central to the increasingly influential symptom network approach to psychopathology, proposes that stronger connectivity among symptoms heightens vulnerability to mental disorders. We provide an analytic derivation of this hypothesis using mean-field Ising models of depression, both in the standard <span><math><mrow><mo>−</mo><mn>1</mn><mo>/</mo><mn>1</mn></mrow></math></span> formulation and in a <span><math><mrow><mn>0</mn><mo>/</mo><mn>1</mn></mrow></math></span> variant where nodes represent symptoms as absent or present. Applying bifurcation theory, we derive the bifurcation sets and phase transition structure directly from the mean-field equations. This formal characterization elucidates how connectivity shapes system dynamics and, consistent with the network theory of mental disorders, demonstrates that increasing connectivity amplifies the risk of transitions into unhealthy states.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102968"},"PeriodicalIF":1.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145798134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Identifiability of the polytomous local independence model with graded knowledge structures","authors":"Luca Stefanutti , Andrea Spoto","doi":"10.1016/j.jmp.2025.102956","DOIUrl":"10.1016/j.jmp.2025.102956","url":null,"abstract":"<div><div>This article provides initial theoretical results concerning the identifiability of the polytomous local independence model (PoLIM), which is an extension of the basic local independence model (BLIM) to polytomous knowledge structures. It is well-known that the BLIM is not identifiable for graded knowledge structures. This is because there exist parameter transformations, named outcome preserving transformations, that leave unchanged the outcome of the prediction function of the model. In this article a twofold generalization is carried out. On the one side, we extend the notion of gradedness to polytomous structures, and, on the other side, we generalize the outcome preserving transformations to the case of polytomous items. These generalizations lead to the conclusion that the PoLIM is not identifiable for graded polytomous structures. This result generalizes a well-known one with the dichotomous structures. The role of equally informative items in the identifiability of the PoLIM is also investigated. The formal results are accompanied by a numerical example that applies those results to the PoLIM with a concrete polytomous structure that turns out to be graded.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102956"},"PeriodicalIF":1.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Associative updates for temporal contingencies","authors":"Niels J. Verosky","doi":"10.1016/j.jmp.2026.102971","DOIUrl":"10.1016/j.jmp.2026.102971","url":null,"abstract":"<div><div>Associative learning of events’ co-occurrence rates across time can generate useful predictive representations (e.g., the successor representation), but temporal contiguities alone are not enough to infer causal relations. Recent work suggests that neural substrates long thought to implement temporal difference learning may perform causal inference by tracking temporal contingences — coincidences between events corrected by background co-occurrence rate. We show that changing the activation function enables simple associative updates to directly compute temporal contingencies. Temporal contiguities can be learned as the cross-correlation between a stimulus and a memory trace, and temporal contingencies can be learned as the cross-covariance. An implication is that neurally plausible causal learning algorithms can be implemented through simple associative updates. These results highlight a family of learning rules for incremental computation of forward, backward, and joint temporal contiguities and contingencies.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102971"},"PeriodicalIF":1.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147396038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Information of absence: Capacity measures for parallel AND processing","authors":"Nicholas A. Altieri","doi":"10.1016/j.jmp.2025.102967","DOIUrl":"10.1016/j.jmp.2025.102967","url":null,"abstract":"<div><div>Howard and colleagues (2021) reported evidence that significant resources are used to process target-absent information in detection designs. This has major implications for measuring a system’s “capacity”, particularly when using AND decision rules. Chief among these concerns are the inflated capacity measurements commonly reported in the literature. To address this, the authors suggested using a full-factorial identification decision rule instead of simple detection. Here, a new capacity measure is calculated by comparing response times in single-target trials to those obtained from double and target-absent trials. Besides fundamentally altering the design, I argue this newly proposed coefficient may deflate capacity when target-absent responses are systematically slow relative to true parallel independent predictions, or under certain violations of context-invariance. I instead propose comparing responses in the double-target AND condition to parallel independent minimum time predictions derived from single-target “no” trials. This should avoid spurious findings of super or overly limited capacity and thus provide capacity estimates more closely resembling OR detection.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102967"},"PeriodicalIF":1.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hitchhiker’s guide to information theoretical measures in psychology","authors":"Niels van Santen, Yves Rosseel, Daniele Marinazzo","doi":"10.1016/j.jmp.2025.102969","DOIUrl":"10.1016/j.jmp.2025.102969","url":null,"abstract":"<div><div>In psychology, as in other sciences, information theory can be used as a tool to complement more standard regression-based methods of data analysis. It is important to see the potential of information theoretical measures as statistical tools without implying a connection to their origins in communication theory and engineering. The use of these measures may provide us with additional insights due to their sensitivity to non-linear relationships, their flexibility to the mixing of data types, and their more straightforward generalization towards investigating higher-order interactions. We briefly reintroduce information theory and compare several measures such as mutual information and co-information with correlation and regression-based methods for the investigation of variable dependence.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102969"},"PeriodicalIF":1.5,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145939428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Causal analysis of absolute and relative risk reductions","authors":"Björn Meder , Charley M. Wu , Felix G. Rebitschek","doi":"10.1016/j.jmp.2025.102942","DOIUrl":"10.1016/j.jmp.2025.102942","url":null,"abstract":"<div><div>Any medical innovation must first prove its benefits with reliable evidence from clinical trials. Evidence is commonly expressed using two metrics, summarizing treatment benefits based on either absolute risk reductions (ARRs) or relative risk reductions (RRRs). Both metrics are derived from the same data, but they implement conceptually distinct ideas. Here, we analyze these risk reductions measures from a causal modeling perspective. First, we show that ARR is equivalent to <span><math><mrow><mi>Δ</mi><mi>P</mi></mrow></math></span>, while RRR is equivalent to causal power, thus clarifying the implicit causal assumptions. Second, we show how this formal equivalence establishes a relationship with causal Bayes nets theory, offering a basis for incorporating risk reduction metrics into a computational modeling framework. Leveraging these analyses, we demonstrate that under dynamically varying baseline risks, ARRs and RRRs lead to strongly diverging predictions. Specifically, the inherent assumption of a linear parameterization of the underlying causal graph can lead to incorrect conclusions when generalizing treatment benefits (e.g, predicting the effect of a vaccine in new populations with different baseline risks). Our analyses highlight the shared principles underlying risk reduction metrics and measures of causal strength, emphasizing the potential for explicating causal structure and inference in medical research.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102942"},"PeriodicalIF":1.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling meta-reasoning processes using diffusion and quantum random walk models","authors":"Ritesh K. Malaiya, Richard M. Golden","doi":"10.1016/j.jmp.2025.102952","DOIUrl":"10.1016/j.jmp.2025.102952","url":null,"abstract":"<div><div>Meta-reasoning studies investigate the role of metacognitive processes in <em>monitoring</em> the success likelihood of an ongoing Reasoning task expected to require Longer Deliberation Time (RLDT), and accordingly, <em>control</em> further cognitive resource allocation to maximize success likelihood. A Meta-reasoning study may require participants to report their intermediate confidence judgment repeatedly within RLDT, e.g., a response that <em>I am 70% confident that the problem is solvable</em>, requested every 15 s. Based on existing Meta-reasoning studies, the current study first identified a set of observable Meta-reasoning phenomena on how intermediate confidence judgment evolves within RLDT and its impact on response choice and response time. Then, based on identified Meta-reasoning phenomena, certain computational features, serving as guidelines, were proposed to facilitate the construction and evaluation of random walk models describing these phenomena. The Markov Random-Walk formulation of the Drift-Diffusion Model (MR-DDM) and the Quantum Random-Walk Model (QRM) have been widely utilized to model response choice, response time, and intermediate and final confidence judgments in decision-making studies. Hence, the proposed computational features were utilized to evaluate the effectiveness of existing MR-DDM and QRM in describing meta-reasoning processes. Also, potential extensions of MR-DDM and QRM were identified for further empirical investigations. The current study also briefly reviewed an existing Item Response Theory (IRT) based extension of a continuous state continuous time Drift-Diffusion Model, named Q-Diffusion, that has been utilized to model RLDT without explicitly constraining the model to describe Meta-reasoning phenomena. Utilizing insights from Q-Diffusion and proposed computational features, the current study identified potential extensions of the MR-DDM for further empirical investigations.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102952"},"PeriodicalIF":1.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145465505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}