Clinical Trial Optimization background cover

Clinical Trial Optimization

Optimize clinical trials based on the Mayo Clinic dataset

ingenii

Hosted by

ingenii

OverviewDocsCodeRulesDiscussionLeaderboard
This competition ended on September 30, 2024. You can still make submissions to collect points and appear on the leaderboard, but you will not qualify for any prizes.

Getting Started on Aqora

If you need to understand how to interact with the Aqora platform first, please follow our tutorial.

Competition Period

  • Held online from April 2, 2024, to September 30, 2024.

Prizes (Awarded via Invoice for Final Solution)

  • First Prize: $500 cash, a research internship* (conditional upon solution adoption), spotlight on Ingenii’s LinkedIn & Discord, and a research presentation opportunity.
  • Second Prize: $300 cash, spotlight on Ingenii’s LinkedIn & Discord.
  • Third Prize: $200 cash, spotlight on Ingenii’s LinkedIn & Discord.

Clinical trial optimization

Assigning subjects to treatment groups is is pivotal in experimental clinical trials for novel drugs. A critical component involves identifying distinct subject cohorts suitable for specific treatments. These cohorts should exhibit maximum similarity based on measurable covariates (or attributes), which influence individual responses to treatment, thus enabling the differentiation of treatment effects from confounding factors.
On average, clinical trials for newly approved drugs incur costs of $1 billion, with a failure rate of 70%. In 2010, global pharmaceutical companies allocated $32.5 billion to conduct clinical trials out of a total research and development expenditure of $46.4 billion. The financial and temporal constraints of this complex process requires accurate patient stratification to enhance the likelihood of success.

Setting

Each patient is associated with r=3r=3 covariates w⃗i=(wi1,wi2,wi3)\vec{w}_i = (w_{i1}, w_{i2}, w_{i3}) that are relevant for predicting the patient's outcome. There are nn patients in total. The decision maker knows the total number of subjects of the experiment nn and the respective covariates w⃗=(w⃗1,⋯,w⃗n)\vec{w}=(\vec{w}_1, ⋯, \vec{w}_n). The decision maker will assign k:=N/mk:=N/m subjects to each of m≥2m ≥ 2 treatment groups. In this case, we will consider the scenario where only two groups are used (m=2m=2).
The binary decision variables are x⃗={xip∣i=1,⋯ ,N,p=1,2}\vec{x} = \{x_{ip}| i=1,\cdots, N, p=1,2\}, where xip=1x_{ip}=1 if patient ii is assigned to group pp, and xip=0x_{ip}=0 otherwise.

Objective

The objective of the assignment is to minimize the discrepancy between any two groups in the weighted sum of the first and second moments of the covariates. That is, the discrepancy is calculated as follows:
d=∑s=13∣Δμs∣+ρ∑s=13∣Δσss∣+2ρ∑s=13∑s′=s+13∣Δσss′∣d = \sum_{s=1}^3 |\Delta \mu_s| + \rho \sum_{s=1}^3 |\Delta \sigma_{ss}| + 2 \rho \sum_{s=1}^3 \sum_{s'=s+1}^3|\Delta \sigma_{ss'}|
where
Δμs=1n∑i=1nwis(xi1−xi2),∀s∈{1,2,3}\Delta \mu_s = \frac{1}{n} \sum_{i=1}^n w_{is} (x_{i1} - x_{i2}), \quad \forall s \in \{1, 2, 3\}
and
Δσss′=1n∑i=1nwiswis′(xi1−xi2),∀s∈{1,2,3},s′∈{s,⋯ ,3}\Delta \sigma_{ss'} = \frac{1}{n} \sum_{i=1}^n w_{is}w_{is'} (x_{i1} - x_{i2}), \quad \forall s \in \{1, 2, 3\}, s'\in \{s, \cdots, 3\}
The parameter ρ\rho regulates the relative weight of the first and the second moments. In this case, we will set ρ=0.5\rho=0.5.

Constraints

There are several constraints that needed to ensure an appropriate patient stratification:
  • Number of patients in each group: Groups 1 and 2 need to have the same number of patients, n/2n/2. This constraint can be written as:
∑ixip=N/2,∀p∈{1,2}.\sum_i x_{ip} = N/2, \quad \forall p \in \{1,2\}.
  • Each patient should be assigned to exactly one group. This constraint can be written as:
xi1+xi2=1∀i∈{1,⋯ ,n}x_{i1} + x_{i2} = 1 \quad \forall i \in \{1, \cdots, n\}
  • Symmetry redundancy: this constraint reduces the redundancy as a result of permutation symmetry in group numbering (changing group 1 by group 2). This constraint can be written as:
x12=0x_{12} = 0

Problem formulation

Putting it all together, this problem can be formulated as follows:
min⁡x∑s=13∣Δμs∣+ρ∑s=13∣Δσss∣+2ρ∑s=13∑s′=s+13∣Δσss′∣=d\min_{x} \sum_{s=1}^3 |\Delta \mu_s| + \rho \sum_{s=1}^3 |\Delta \sigma_{ss}| + 2 \rho \sum_{s=1}^3 \sum_{s'=s+1}^3|\Delta \sigma_{ss'}| = d s.t\text{s.t} ∑ixip=n/2,∀p∈{1,2}\sum_i x_{ip} = n/2, \quad \forall p \in \{1,2\} xi1+xi2=1,∀i∈{1,⋯ ,n}x_{i1} + x_{i2} = 1, \quad \forall i \in \{1, \cdots, n\} x12=0x_{12} = 0
This corresponds to a mixed-integer optimization problem with 10 continuous variable ({d,Δμ1,Δμ2,Δμ3,Δσ11,Δσ22,Δσ33,Δσ12,Δσ13,Δσ23}\{d,\Delta\mu_1, \Delta\mu_2, \Delta\mu_3, \Delta\sigma_{11}, \Delta\sigma_{22}, \Delta\sigma_{33}, \Delta\sigma_{12}, \Delta\sigma_{13},\Delta\sigma_{23} \}) and 2n−12n-1 binary variables ({x11,⋯ ,xn1,x22,⋯ ,xn2})(\{x_{11}, \cdots , x_{n1}, x_{22}, \cdots, x_{n2}\}).
Solving this optimization problem classically is challenging (or even impossible!) when the number of patients is large. For this reason, quantum computing can provide significant advantage to solve this kind of problems.