mlsanityData to 7 Oct 2026

Neural Bandits for Data Mining: Searching for Dangerous Polypharmacy

arXiv 2212.05190 ↗First posted 10 Dec 2022cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Polypharmacy, most often defined as the simultaneous consumption of five or more drugs at once, is a prevalent phenomenon in the older population. Some of these polypharmacies, deemed inappropriate, may be associated with adverse health outcomes such as death or hospitalization. Considering the combinatorial nature of the problem as well as the size of claims database and the cost to compute an exact association measure for a given drug combination, it is impossible to investigate every possible combination of drugs. Therefore, we propose to optimize the search for potentially inappropriate polypharmacies (PIPs). To this end, we propose the OptimNeuralTS strategy, based on Neural Thompson Sampling and differential evolution, to efficiently mine claims datasets and build a predictive model of the association between drug combinations and health outcomes. We benchmark our method using two datasets generated by an internally developed simulator of polypharmacy data containing 500 drugs and 100 000 distinct combinations. Empirically, our method can detect up to 72% of PIPs while maintaining an average precision score of 99% using 30 000 time steps.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 33 references that are in the map. First posted on arXiv 10 Dec 2022.

Builds on

11 of 33 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  3. 2018Tune: A Research Platform for Distributed Model Selection and Trainingcited by 395
  4. 2018Modeling polypharmacy side effects with graph convolutional networkscited by 237
  5. 2020Neural Thompson Samplingcited by 127
  6. 2016An optimal algorithm for the Thresholding Bandit Problemcited by 62
  7. 2019Top-k Combinatorial Bandits with Full-Bandit Feedbackcited by 28
  8. 2017Nearly Optimal Sampling Algorithms for Combinatorial Pure Explorationcited by 18
  9. 2021Pure Exploration in Kernel and Neural Banditscited by 13
  10. 2017Thresholding Bandits with Augmented UCBcited by 11
  11. 2014Bandits Warm-up Cold Recommender Systemscited by 4

Built on by

Not cited yet.