SDM-Q: Cost-Aware Staged Decision-Making for Multi-Omics Classification with Deep Q-Learning
Not on the map. Why?
Abstract (arXiv)
Multi-omics data provide complementary molecular characterizations of disease phenotypes and play an important role in disease diagnosis and subtype classification in precision medicine. However, acquiring complete multi-omics profiles is expensive and time-consuming, while most existing deep learning methods assume full modality availability during inference, resulting in substantial redundancy and limited practicality in clinical settings. To address this issue, we propose SDM-Q, a reinforcement learning framework for adaptive and cost-aware multi-omics classification. Specifically, multi-omics diagnosis is reformulated as a finite-horizon sequential decision problem, where the currently acquired omics modalities define the diagnostic state at each stage. An action--value function determines whether to acquire an additional modality or terminate the decision process and output the final prediction. To balance diagnostic utility and acquisition cost, the reward is defined only at the terminal stage and jointly determined by classification correctness and cumulative modality acquisition cost. A backward stage-wise optimization strategy is introduced to improve policy consistency and training stability. Experiments on four public multi-omics datasets, including ROSMAP, LGG, BRCA, and KIPAN, demonstrate that SDM-Q effectively reduces redundant modality acquisition while maintaining competitive classification performance compared with methods using complete multi-omics inputs. In the BRCA and KIPAN datasets, more than 99% and 95% of subjects, respectively, achieve accurate classification using only a single omics modality, while the average number of acquired modalities remains below two for ROSMAP and LGG. These results suggest that cost-aware sequential decision-making provides an effective paradigm for improving the efficiency of precision medicine workflows.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 35 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
10 of 35 references.
References · 10
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2017Gated Multimodal Units for Information Fusioncited by 244
- 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
- 2022Trusted Multi-View Classification with Dynamic Evidential Fusioncited by 167
- 2020More Diverse Means Better: Multimodal Deep Learning Meets Remote Sensing Imagery Classificationcited by 126
- 2020Discrimination-aware Network Pruning for Deep Model Compressioncited by 50
- 2014Better prediction by use of co-data: Adaptive group-regularized ridge regressioncited by 18
- 2016Sequential Cost-Sensitive Feature Acquisitioncited by 7
- 2025An Uncertainty-Aware Dynamic Decision Framework for Progressive Multi-Omics Integration in Classification Taskscited by 1
Built on by
Not cited yet.