Inverse Reinforcement Learning for Interpretable Keystroke Biomarkers in Parkinson's Disease
- URL: http://arxiv.org/abs/2606.25270v2
- Date: Tue, 30 Jun 2026 21:18:33 GMT
- Title: Inverse Reinforcement Learning for Interpretable Keystroke Biomarkers in Parkinson's Disease
- Abstract summary: Keystroke dynamics have been explored extensively as a passive digital biomarker for Parkinson's disease (PD)<n>We apply inverse reinforcement learning (IRL) to keystroke data, modeling each keystroke as a discrete choice over typing speed and recovering.<n>To our knowledge this is the first application of IRL to keystroke dynamics.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Keystroke dynamics have been explored extensively as a passive digital biomarker for Parkinson's disease (PD), typically by extracting summary statistics from typing timing and training a classifier to discriminate PD from healthy controls. We instead apply inverse reinforcement learning (IRL) to keystroke data, modeling each keystroke as a discrete choice over typing speed and recovering, per subject, an interpretable reward function that explains their observed timing behavior. To our knowledge this is the first application of IRL to keystroke dynamics. On the public neuroQWERTY MIT-CSXPD dataset (85 subjects, 42 with PD), an initial four-parameter reward decomposition (speed, effort, smoothness, hand-alternation cost) was found to suffer severe feature collinearity between two terms ($r=1.000$ in typical contexts); we diagnose and correct this, yielding an identifiable three-parameter model. The recovered speed-preference weight correlates with UPDRS-III severity at $r=-0.607$ ($p<0.001$, $n=42$), replicates independently across two sub-cohorts, is stable across nine sensitivity configurations, and retains a statistically significant contribution beyond raw typing speed alone (incremental $R^2$ from 0.194 to 0.338, $p=0.006$). Two other recovered weights (consistency, hand-alternation) did not survive confound checks and are reported as negative results. We document two implementation bugs found during adversarial code review (session-boundary contamination, a rolling-window data leakage) and show the headline result is materially unchanged after fixing both. We discuss this result in the context of a literature where reported accuracies vary widely between studies (pooled AUC 0.85, I^2=94% in a 2022 meta-analysis), and argue that the validation process itself, not only the correlation coefficient, is part of the contribution.
Related papers
- Not All Relations Are Equal: Relation-Balanced and Calibrated Graph Learning for Provenance-Based Intrusion Detection [66.44527094471619]
We present RECAL, an unsupervised framework using relation-balanced masked graph learning to better capture rare interaction patterns.<n>On three DARPA E3 datasets, RECAL achieves F1 scores of 99.99%, 99.93%, and 99.99%, outperforming the best baseline on each dataset by 0.88, 0.82, and 0.42 percentage points, respectively.
arXiv Detail & Related papers (2026-09-15T00:31:01Z) - From Training to Deployment: Post-Hoc Causal Feature Identification via Sensitivity Ratios [10.912482254600478]
Given a model that is already trained, which features does it rely on causally versus spuriously?<n>We introduce the textbfNormalised Sensitivity Ratio(NSR), a post-hoc, model-agnostic diagnostic for this question.
arXiv Detail & Related papers (2026-07-28T10:26:09Z) - Leakage-Robust Evaluation and Data-Scale Sensitivity of Attention-Enhanced Multi-Task Learning for Joint Fault Diagnosis and Remaining Useful Life Estimation [0.0]
Multi-task deep learning models can be affected by how sliding-window sequences are split into training and test sets.<n>We show that naive splitting can inflate classification accuracy from a genuine 20-60 percent to 99.9 percent.<n>We introduce a chunk-based, leakage-audited splitting protocol and evaluate all models using five seeds, one-way ANOVA, and Tukey HSD tests.
arXiv Detail & Related papers (2026-07-17T20:33:36Z) - FedDP-PALD: A Privacy-Preserving Federated Latent Diffusion Framework with Prototype Aggregation for Medical Data Synthesis [0.6372261626436676]
We propose FedDP-PALD, a privacy-preserving framework for medical data synthesis under formal privacy guarantees.<n>It processes chest X-ray images and electrocardiogram signals through gated multi-head attention with modality-availability masks.<n>It generates private synthetic representations that preserve useful decision performance while strongly resisting membership inference.
arXiv Detail & Related papers (2026-07-13T21:04:37Z) - Selective Impairment of Motor Recovery from Typing Errors in Parkinson's Disease: A Survival Analysis [0.0]
We ask whether passively-collected keystroke dynamics can distinguish two of these stages.<n>We find no evidence that pre-error keystroke instability differs by disease severity.<n>Strong evidence that post-error recovery time does, modeled as a continuous accelerated failure time.
arXiv Detail & Related papers (2026-06-30T17:29:21Z) - MOSAIC: Modality-Specific Adaptation for Incremental Continual Learning in Parkinson's Disease Gait Assessment [15.590322283303385]
Gait-based Parkinson's disease assessment increasingly relies on heterogeneous sensors.<n>New sensors may arrive through device upgrades, protocol changes, or multi-center deployment.<n>This modality-incremental setting faces three challenges: unreliable cross-modal distillation, modality-specific statistical shifts, and reduced plasticity after preservation.
arXiv Detail & Related papers (2026-06-11T12:15:29Z) - Bayesian Inference of Psychometric Variables From Brain and Behavior in Implicit Association Tests [0.786460153386845]
We establish a principled method for inferring mental health related psychometric variables from neural and behavioral data using the Implicit Association Test (IAT) as the data generation engine.<n>We propose a sparse hierarchical Bayesian model that leverages multi-modal data to predict experiences related to mental illness symptoms in new participants.
arXiv Detail & Related papers (2026-03-17T16:20:55Z) - Reward Under Attack: Analyzing the Robustness and Hackability of Process Reward Models [68.45272703833209]
We show that state-of-the-art PRMs are systematically exploitable under adversarial optimization pressure.<n>We introduce a three-tiered diagnostic framework that applies increasing adversarial pressure to quantify these vulnerabilities.<n>We release PRM-BiasBench and a diagnostic toolkit to enable robustness evaluation before deployment.
arXiv Detail & Related papers (2026-02-20T23:38:03Z) - On the Insecurity of Keystroke-Based AI Authorship Detection: Timing-Forgery Attacks Against Motor-Signal Verification [0.0]
Recent proposals advocate using keystroke timing signals to distinguish human-composed text from AI-generated content.<n>We show that this class of defenses is insecure against two practical attack classes.<n>We formalize a non-identifiability result: when the detector observes only timing, the mutual information between features and content provenance is zero for copy-type attacks.
arXiv Detail & Related papers (2026-01-24T03:39:38Z) - LLMs Can Get "Brain Rot"! [68.08198331505695]
Continual exposure to junk web text induces lasting cognitive decline in large language models (LLMs)<n>We run controlled experiments on real Twitter/X corpora, constructing junk and reversely controlled datasets.<n>Results provide significant, multi-perspective evidence that data quality is a causal driver of LLM capability decay.
arXiv Detail & Related papers (2025-10-15T13:28:49Z) - Real-time nonlinear inversion of magnetic resonance elastography with operator learning [0.06797079068199119]
The oNLI framework enables real-time MRE inversion (30,000x speedup) of elastograms with comparable spatial accuracy to NLI.<n>A structural prior mechanism, analogous to Soft Prior Regularization in the MRE literature, was incorporated to improve spatial accuracy.
arXiv Detail & Related papers (2025-10-03T08:55:40Z) - Statistically Valid Variable Importance Assessment through Conditional
Permutations [19.095605415846187]
Conditional Permutation Importance is a new approach to variable importance assessment.
We show that $textitCPI$ overcomes the limitations of standard permutation importance by providing accurate type-I error control.
Our results suggest that $textitCPI$ can be readily used as drop-in replacement for permutation-based methods.
arXiv Detail & Related papers (2023-09-14T10:53:36Z) - Explicit Tradeoffs between Adversarial and Natural Distributional
Robustness [48.44639585732391]
In practice, models need to enjoy both types of robustness to ensure reliability.
In this work, we show that in fact, explicit tradeoffs exist between adversarial and natural distributional robustness.
arXiv Detail & Related papers (2022-09-15T19:58:01Z) - Generalizing electrocardiogram delineation: training convolutional
neural networks with synthetic data augmentation [63.51064808536065]
Existing databases for ECG delineation are small, being insufficient in size and in the array of pathological conditions they represent.
This article delves has two main contributions. First, a pseudo-synthetic data generation algorithm was developed, based in probabilistically composing ECG traces given "pools" of fundamental segments, as cropped from the original databases, and a set of rules for their arrangement into coherent synthetic traces.
Second, two novel segmentation-based loss functions have been developed, which attempt at enforcing the prediction of an exact number of independent structures and at producing closer segmentation boundaries by focusing on a reduced number of samples.
arXiv Detail & Related papers (2021-11-25T10:11:41Z) - MSED: a multi-modal sleep event detection model for clinical sleep
analysis [62.997667081978825]
We designed a single deep neural network architecture to jointly detect sleep events in a polysomnogram.
The performance of the model was quantified by F1, precision, and recall scores, and by correlating index values to clinical values.
arXiv Detail & Related papers (2021-01-07T13:08:44Z) - Robustness to Spurious Correlations via Human Annotations [100.63051542531171]
We present a framework for making models robust to spurious correlations by leveraging humans' common sense knowledge of causality.
Specifically, we use human annotation to augment each training example with a potential unmeasured variable.
We then introduce a new distributionally robust optimization objective over unmeasured variables (UV-DRO) to control the worst-case loss over possible test-time shifts.
arXiv Detail & Related papers (2020-07-13T20:05:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.