NeuroSep-CP-LCB: A Deep Learning-based Contextual Multi-armed Bandit Algorithm with Uncertainty Quantification for Early Sepsis Prediction
Not on the map. Why?
Abstract (arXiv)
In critical care settings, timely and accurate predictions can significantly impact patient outcomes, especially for conditions like sepsis, where early intervention is crucial. We aim to model patient-specific reward functions in a contextual multi-armed bandit setting. The goal is to leverage patient-specific clinical features to optimize decision-making under uncertainty. This paper proposes NeuroSep-CP-LCB, a novel integration of neural networks with contextual bandits and conformal prediction tailored for early sepsis detection. Unlike the algorithm pool selection problem in the previous paper, where the primary focus was identifying the most suitable pre-trained model for prediction tasks, this work directly models the reward function using a neural network, allowing for personalized and adaptive decision-making. Combining the representational power of neural networks with the robustness of conformal prediction intervals, this framework explicitly accounts for uncertainty in offline data distributions and provides actionable confidence bounds on predictions.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 24 references that are in the map. First posted on arXiv 20 Mar 2025.
Builds on
20 of 24 references.
References · 20
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 792
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2019Conformal Prediction Under Covariate Shiftcited by 519
- 2020Is Pessimism Provably Efficient for Offline RL?cited by 364
- 2021Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimismcited by 279
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 222
- 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 169
- 2020Conformal Inference of Counterfactuals and Individual Treatment Effectscited by 151
8 more
- 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 132
- 2020Minimax-Optimal Off-Policy Evaluation with Linear Function Approximationcited by 120
- 2019Finite Depth and Width Corrections to the Neural Tangent Kernelcited by 115
- 2022HyperImpute: Generalized Iterative Imputation with Automatic Model Selectioncited by 83
- 2020Asymptotically Efficient Off-Policy Evaluation for Tabular Reinforcement Learningcited by 60
- 2021On the Optimality of Batch Policy Optimization Algorithmscited by 28
- 2021Offline Neural Contextual Bandits: Pessimism, Optimization and Generalizationcited by 25
- 2020Offline Contextual Bandits with Overparameterized Modelscited by 10
Built on by
Citing papers per year: 2025: 1.
1 paper.