Four State Sleep Staging From a Multilayered Algorithm Using Electrocardiographic and Actigraphic Data
Bibliographic record
Abstract
PURPOSE: Sleep studies are important to evaluate sleep and sleep-related disorders. The standard test for evaluating sleep is polysomnography, during which several physiological signals are recorded separately and simultaneously with specialized equipment that requires a technologist. Simpler recordings that can model the results of a polysomnography would provide the benefit of expanding the possibilities of sleep recordings. METHODS: Using the publicly available sleep data set from the multiethnic study of atherosclerosis and 1769 nights of sleep, we extracted a distinct data subset with engineered features of the biomarkers collected by actigraphic, oxygenation, and electrocardiographic sensors. We then applied scalable models with recurrent neural network and Extreme Gradient Boosting (XGBoost) with a layered approach to produce an algorithm that we then validated with a separate data set of 177 nights. RESULTS: The algorithm achieved an overall performance of 0.833 accuracy and 0.736 kappa in classifying into four states: wake, light sleep, deep sleep, and rapid eye movement (REM). Using feature analysis, we demonstrated that heart rate variability is the most salient feature, which is similar to prior reports. CONCLUSIONS: Our results demonstrate the potential benefit of a multilayered algorithm and achieved higher accuracy and kappa than previously described approaches for staging sleep. The results further the possibility of simple, wearable devices for sleep staging. Code is available at https://github.com/NovelaNeuro/nEureka-SleepStaging .
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".