🤖 AI Summary
This study addresses the heterogeneity in patient responses to treatment by formulating individualized treatment rule learning as a weighted classification problem and proposing a unified theoretical framework that accommodates various surrogate loss functions and kernel choices. The core contributions include establishing, for the first time, a general relationship between the 0–1 risk and a broad class of non-negative surrogate losses, providing convergence rate guarantees for Matérn kernels combined with non-convex losses, and characterizing the conditions under which kernels with tunable smoothness are applicable. By integrating constrained variational transformations with Matérn or Gaussian kernels and both convex and non-convex losses, the authors design two iteratively reweighted convex optimization algorithms. Numerical experiments on simulated data and the ACTG 175 clinical trial dataset demonstrate the theoretical validity and practical superiority of the proposed approach.
📝 Abstract
Personalized medicine aims to tailor treatments to individual patients, especially when people respond heterogeneously to therapies. A key objective is to learn individualized treatment rules that recommend optimal treatments from patient characteristics. Outcome weighted learning (OWL) is an important framework because it reformulates the task as a weighted classification problem targeting clinical benefit and using modern machine learning tools. Existing OWL theory has been focusing on specific surrogate losses and Gaussian kernels. Matern kernels, which allow adjustable smoothness and better match many real world data structures, are often more suitable and include the Gaussian kernel as a special case. This work develops a general relationship between population 0-1 risk and risks from a broad class of nonnegative surrogate losses using a constrained variational transformation. The transform simplifies for convex losses and provides simple expressions for certain nonconvex losses. A condition is established that ensures a nontrivial upper bound on the excess 0-1 risk. The paper establishes convergence rates for kernel based OWL under smoothness conditions with Matern kernels or geometric noise conditions with Gaussian kernels for both convex and nonconvex losses. It also proposes two iteratively reweighted convex optimization algorithms. Simulations and an application to ACTG 175 show strong performance.