SearcharxivSearch

arXiv subjects

William Hua

Publications and source records attributed to William Hua.

3 recordsLinked to original sources

Personalized Dynamic Treatment Regimes in Continuous Time: A Bayesian Approach for Optimizing Clinical Decisions with Timing

Accurate models of clinical actions and their impacts on disease progression are critical for estimating personalized optimal dynamic treatment regimes (DTRs) in medical/health research, especially in managing chronic conditions. Traditional statistical methods for DTRs usually focus on estimating the optimal treatment or dosage at each given medical intervention, but overlook the important question of "when this intervention should happen." We fill this gap by developing a two-step Bayesian approach to optimize clinical decisions with timing. In the first step, we build a generative model for a sequence of medical interventions-which are discrete events in continuous time-with a marked temporal point process (MTPP) where the mark is the assigned treatment or dosage. Then this clinical action model is embedded into a Bayesian joint framework where the other components model clinical observations including longitudinal medical measurements and time-to-event data conditional on treatment histories. In the second step, we propose a policy gradient method to learn the personalized optimal clinical decision that maximizes the patient survival by interacting the MTPP with the model on clinical observations while accounting for uncertainties in clinical observations learned from the posterior inference of the Bayesian joint model in the first step. A signature application of the proposed approach is to schedule follow-up visitations and assign a dosage at each visitation for patients after kidney transplantation. We evaluate our approach with comparison to alternative methods on both simulated and real-world datasets. In our experiments, the personalized decisions made by the proposed method are clinically useful: they are interpretable and successfully help improve patient survival.

stat.ME

More bounds on the diameters of convex polytopes

Finding a good bound on the maximal edge diameter $Δ(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known, the behaviour of the function $Δ(d,n)$ is largely unknown. The Hirsch conjecture, formulated in 1957 and reported in \cite{GD}, states that $Δ(d,n)$ is linear in $n$ and $d$: $Δ(d,n) \leq n-d$. The conjecture is known to hold in small dimensions, i.e., for $d \leq 3$ \cite{VK}, along with other specific pairs of $d$ and $n$ (Table \ref{before}). However, the asymptotic behaviour of $Δ(d,n)$ is not well understood: the best upper bound -- due to Kalai and Kleitman -- is quasi-polynomial \cite{GKDK}. In this article we will show that $Δ(4,12)=7$ and present strong evidence for $Δ(5,12)=Δ(6,13)=7$. The first of these new values is of particular interest since it indicates that the Hirsch bound is not sharp in dimension 4.

math.CO

Berge Sorting

In 1966, Claude Berge proposed the following sorting problem. Given a string of $n$ alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of $\lceil\frac{n}{2}\rceil$ white pegs followed immediately by $\lfloor\frac{n}{2}\rfloor$ black pegs (or vice versa) using only moves which take 2 adjacent pegs to 2 vacant adjacent holes. Avis and Deza proved that the alternating string can be sorted in $\lceil\frac{n}{2}\rceil$ such {\em Berge 2-moves} for $n\geq 5$. Extending Berge's original problem, we consider the same sorting problem using {\em Berge $k$-moves}, i.e., moves which take $k$ adjacent pegs to $k$ vacant adjacent holes. We prove that the alternating string can be sorted in $\lceil\frac{n}{2}\rceil$ Berge 3-moves for $n\not\equiv 0\pmod{4}$ and in $\lceil\frac{n}{2}\rceil+1$ Berge 3-moves for $n\equiv 0\pmod{4}$, for $n\geq 5$. In general, we conjecture that, for any $k$ and large enough $n$, the alternating string can be sorted in $\lceil\frac{n}{2}\rceil$ Berge $k$-moves. This estimate is tight as $\lceil\frac{n}{2}\rceil$ is a lower bound for the minimum number of required Berge $k$-moves for $k\geq 2$ and $n\geq 5$.

math.CO