ConFER: A Neurally Constrained Computational Model of Context-Dependent Fear Extinction Recall and Relapse
Exposure therapy, a standard treatment for anxiety disorders, relies on fear extinction. However, extinction recall is often limited to the spatial and temporal context in which extinction is learned, leading to fear relapse in new settings or after delays. Animal studies offer insights into fear extinction in humans. Computational models that integrate these findings into a neurally grounded framework, while generating testable hypotheses for humans, can bridge this gap. Current models either focus on neuron-level activity, limiting their scope, or abstract away entirely from neural mechanisms. They also often overlook the distinct contributions of cue and context in fear extinction and recall. To address these gaps, we present ConFER, a neurally constrained model of fear extinction, recall, and relapse. ConFER integrates findings from the neural fear circuit, modeling distinct pathways for cue and context processing. These pathways independently activate positive and/or negative memory engrams in the basolateral amygdala, competing to determine the fear response. ConFER simulates fear renewal and spontaneous recovery across context combinations, while generating novel, testable predictions. Notably, it predicts counterconditioning may better prevent relapse than extinction in new contexts or after delays. By mechanistically modeling fear relapse, ConFER offers insights to improve exposure therapy outcomes.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Dissociating spatial frequency reliance from adversarial robustness advantages in neurally guided deep convolutional neural networks
Deep convolutional neural networks (DCNNs) have rivaled humans on many visual tasks, yet they remain vulnerable to near-imperceptible perturbations generated by adversarial attacks. Recent work shows that aligning DCNN r…
Adversarial RobustnessObject RecognitionTraining LLMs over Neurally Compressed Text
In this paper, we explore the idea of training large language models (LLMs) over highly compressed text. While standard subword tokenizers compress text by a small factor, neural text compressors can achieve much higher …
Keeping it simple: Implementation and performance of the proto-principle of adaptation and learning in the language sciences
In this paper we present the Widrow-Hoff rule and its applications to language data. After contextualizing the rule historically and placing it in the chain of neurally inspired artificial learning models, we explain its…
Explainable AI: A Neurally-Inspired Decision Stack Framework
European Law now requires AI to be explainable in the context of adverse decisions affecting European Union (EU) citizens. At the same time, it is expected that there will be increasing instances of AI failure as it oper…
DiNADO: Norm-Disentangled Neurally-Decomposed Oracles for Controlling Language Models
NeurAlly-Decomposed Oracle (NADO) is a powerful approach for controllable generation with large language models. It is designed to avoid catastrophic forgetting while achieving guaranteed convergence to an entropy-maximi…
Machine Translation