Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,878 papers · 148 categories

Trend · papers per month

0111 · Nov 201619922001200920172026
14 results for Warfarin

This study uses bandit algorithms to predict Warfarin dosages more accurately.

problem Determining the correct initial Warfarin dosage is challenging due to patient variability and adverse effects.
method Developed and evaluated linear bandit algorithms on real data from PharmGKB.
result Proposed algorithms outperformed fixed-dose and clinical algorithms.

Warfarin dosing remains challenging due to narrow therapeutic index and highly individual variability. Incorrect warfarin dosing is associated with devastating adverse events. Remarkable efforts have been made to develop the machine learning based warfarin dosing algorithms incorporating clinical factors and genetic va…

2018-09-10abs ↗pdf ↗

Determining the optimal initial dose for warfarin is a critically important task. Several factors have an impact on the therapeutic dose for individual patients, such as patients' physical attributes (Age, Height, etc.), medication profile, co-morbidities, and metabolic genotypes (CYP2C9 and VKORC1). These wide range f…

2019-03-21abs ↗pdf ↗

Model predicts VKA dosage for Indian patients, aiding in safe medication.

problem Safe and accurate dosing of VKA drugs for Indian patients.
method Support Vector Machine (SVM) Regression model trained on patient data.
result Predicted dosages closely match actual dosages.

Develops deep jump learning for continuous treatment OPE.

problem Estimating mean outcomes under new treatment rules using historical data from different rules.
method Adaptive deep discretization of continuous treatment space using deep learning and multi-scale change point detection.
result Validated method through theoretical results, simulations, and real application to Warfarin Dosing.

We study the problem of policy evaluation and learning from batched contextual bandit data when treatments are continuous, going beyond previous work on discrete treatments. Previous work for discrete treatment/action spaces focuses on inverse probability weighting (IPW) and doubly robust (DR) methods that use a reject…

2018-02-16abs ↗pdf ↗

Paper addresses regret minimization and inference in high-dimensional online decision-making.

problem Regret minimization and statistical inference in high-dimensional online decision-making.
method Integrates ε-greedy bandit algorithm with hard thresholding for sparse bandit parameters and debiasing method for inference.
result Achieves either O(T1/2)O(T^{1/2}) regret or O(T1/2)O(T^{1/2})-consistent inference, with trade-off between exploration and exploitation.

The introduction of data analytics into medicine has changed the nature of patient treatment. In this, patients are asked to disclose personal information such as genetic markers, lifestyle habits, and clinical history. This data is then used by statistical models to predict personalized treatments. However, due to pri…

2016-11-26abs ↗pdf ↗

Two-stage mechanism designs reduce regret in recommender systems with stochastic covariates.

problem Designing effective recommender systems with user covariates sampled online.
method Two-stage algorithm integrating incentivized exploration with offline learning methods.
result Achieves sublinear regret while maintaining incentive compatibility.

The paper tackles fair sharing of exploration costs across groups in online learning.

problem Sharing the cost of exploration fairly across multiple groups in online learning.
method The paper introduces the 'grouped' bandit model and uses axiomatic bargaining theory, specifically the Nash bargaining solution, to formalize fairness.
result The paper derives policies that are optimally fair and regret-optimal, showing that regret-optimal policies can be unfair.

CausalLongPFN predicts counterfactual outcomes from time-series data.

problem Predicting future outcomes under varying treatments in time-series data with confounding and heterogeneity.
method Prior-fitted network pretrained on synthetic episodes of temporal structural causal models.
result CausalLongPFN outperforms domain-trained models on factual and counterfactual prediction tasks.