Skip to yearly menu bar Skip to main content


In-Person Poster presentation / poster accept

When to Make and Break Commitments?

Alihan Hüyük · Zhaozhi Qian · Mihaela van der Schaar

MH1-2-3-4 #92

Keywords: [ General Machine Learning ] [ sequential hypothesis testing ] [ optimal stopping/switching ] [ adaptive experimentation ]


Abstract:

In many scenarios, decision-makers must commit to long-term actions until their resolution before receiving the payoff of said actions, and usually, staying committed to such actions incurs continual costs. For instance, in healthcare, a newly-discovered treatment cannot be marketed to patients until a clinical trial is conducted, which both requires time and is also costly. Of course in such scenarios, not all commitments eventually pay off. For instance, a clinical trial might end up failing to show efficacy. Given the time pressure created by the continual cost of keeping a commitment, we aim to answer: When should a decision-maker break a commitment that is likely to fail—either to make an alternative commitment or to make no further commitments at all? First, we formulate this question as a new type of optimal stopping/switching problem called the optimal commitment problem (OCP). Then, we theoretically analyze OCP, and based on the insights we gain, propose a practical algorithm for solving it. Finally, we empirically evaluate the performance of our algorithm in running clinical trials with subpopulation selection.

Chat is not available.