TRV-2026-1629Certified recordPeer-reviewed

Predicting remission following repetitive transcranial magnetic stimulation in treatment-resistant depression: a comparison of parsimonious and ensemble machine learning models

Repetitive transcranial magnetic stimulation (rTMS) is resource-intensive, and prognostic models may estimate remission probability after treatment in treatment-resistant depression (TRD). Whether algorithmic complexity improves remission prediction over a parsimonious clinical model remains unclear. In a retrospective cohort of 263 adults treated with rTMS who met a baseline data-availability criterion, we compared a simple logistic regression model using age, sex, and baseline MADRS with tuned multivariable re…

Health · Problem Space — documented harm · certified 2026-10-16 · v1 · article view · machine-readable

Current reading — problem

Richer feature sets and ensemble methods gave no significant gain in remission discrimination, and discrimination was only moderate, with ROC-AUCs of roughly 0.69 to 0.71.

What this doesn’t fix

The cohort was retrospective and only internally validated, and the authors state that the results do not establish equivalence or transportability to other settings.

Evidence

Reader signal

How should this claim be treated?

Cite this record

Truvace Impact Record TRV-2026-1629, v1: “Predicting remission following repetitive transcranial magnetic stimulation in treatment-resistant depression: a comparison of parsimonious and ensemble machine learning models.” Truvace, 2026-10-16. /record/TRV-2026-1629 (accessed at citation time). sha256 9251d185ada08365…

Calibration history

Every change to this record since certification, in the open. None yet — the reading has held since it entered the record.

  1. Certifiedv19251d185ada0…

    Certified into the record

Verify this record
How to verify without trusting this page

Fetch the canonical text of any version from /api/record/TRV-2026-1629 and hash it yourself — for example shasum -a 256 on the saved canonical field. The result must equal content_hash, and each version’s text ends with prev:followed by the prior version’s hash (version 1 chains to 64 zeros). If a single character of any version had been altered since certification, the chain would not reproduce.