SearcharxivSearch

arXiv · 2507.01370

Dose-Escalation Trial Protocols that Extend Naturally to Admit Titration

Abstract

Dose-escalation trials in oncology drug development still today typically aim to identify 1-size-fits-all dose recommendations, as arbitrary quantiles of the toxicity thresholds evident in patient samples. In the late 1990s efforts to individualize dosing emerged fleetingly in the oncology trial methods literature, but these have gained little traction due to a nexus of conceptual, technical, commercial, and regulatory barriers. To reduce the activation energy needed for transforming current 1-size-fits-all dose-escalation trial designs to the dose-titration designs required for patient-centered dose individualization, we demonstrate a categorical formulation of dose-escalation protocols that extends readily to allow gradual introduction of dose titration. Central to this formulation is a symmetric monoidal preorder on the accessible states of dose-escalation trials, embodying pharmacologic intuitions regarding dose-monotonicity of drug toxicity and ethical intuitions relating to the therapeutic intent of such trials. A trial protocol that assigns doses to enrolling participants consistently with these intuitions is then a monotone map from this preorder to the sequence of doses being trialed. We illustrate this formulation by reference to the ubiquitous 3+3 dose-escalation design, which despite its many widely discussed flaws remains familiar to oncology trialists and moreover has available an executable specification in Prolog. Remarkably, examined in light of our preorder the 3+3 protocol discloses a new flaw not previously described: a non-monotone dose recommendation. The right Kan extension approximates this protocol from the side of safety, dissolving its triplet cohorts to allow incremental enrollment, and rectifying said non-monotonicity. It also facilitates accelerated enrollment while toxicity assessments remain pending, as well as discretionary dose titration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David C. Norris. 2025-07-02. Dose-Escalation Trial Protocols that Extend Naturally to Admit Titration. https://arxiv.org/abs/2507.01370

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT