mlsanityData to 7 Oct 2026

HMM for Discovering Decision-Making Dynamics Using Reinforcement Learning Experiments

arXiv 2401.13929 ↗First posted 25 Jan 2024cs.LG stat.AP stat.MEcited by 2

Not on the map. Why?

Abstract (arXiv)

Major depressive disorder (MDD) presents challenges in diagnosis and treatment due to its complex and heterogeneous nature. Emerging evidence indicates that reward processing abnormalities may serve as a behavioral marker for MDD. To measure reward processing, patients perform computer-based behavioral tasks that involve making choices or responding to stimulants that are associated with different outcomes. Reinforcement learning (RL) models are fitted to extract parameters that measure various aspects of reward processing to characterize how patients make decisions in behavioral tasks. Recent findings suggest the inadequacy of characterizing reward learning solely based on a single RL model; instead, there may be a switching of decision-making processes between multiple strategies. An important scientific question is how the dynamics of learning strategies in decision-making affect the reward learning ability of individuals with MDD. Motivated by the probabilistic reward task (PRT) within the EMBARC study, we propose a novel RL-HMM framework for analyzing reward-based decision-making. Our model accommodates learning strategy switching between two distinct approaches under a hidden Markov model (HMM): subjects making decisions based on the RL model or opting for random choices. We account for continuous RL state space and allow time-varying transition probabilities in the HMM. We introduce a computationally efficient EM algorithm for parameter estimation and employ a nonparametric bootstrap for inference. We apply our approach to the EMBARC study to show that MDD patients are less engaged in RL compared to the healthy controls, and engagement is associated with brain activities in the negative affect circuitry during an emotional conflict task.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 30 references that are in the map. First posted on arXiv 25 Jan 2024.

Builds on

3 of 30 references.

References · 3

  1. 2018Behavioral Cloning from Observationcited by 482
  2. 2013Adaptive piecewise polynomial estimation via trend filteringcited by 47
  3. 2014Efficient Implementations of the Generalized Lasso Dual Path Algorithmcited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.