Search arXivSearch

arXiv · 1611.01399

Towards Robust Adaptive Radiation Therapy Strategies

Abstract

The authors propose robust adaptive strategies based on stochastic minimax optimization for a series of simulated treatments on a one-dimensional patient phantom. The plan applied during the first fractions should be able to handle anticipated systematic and random errors. At scheduled fractions, the impact of the measured errors on the delivered dose distribution is evaluated. For a patient receiving a dose that does not satisfy clinical goals, the plan is reoptimized based on these individually measured errors. The adapted plan is then applied during subsequent fractions until a new scheduled adaptation becomes necessary. In the first adaptive strategy, the measured systematic and random error scenarios and their assigned probabilities are updated to guide the robust reoptimization. In the second strategy, the grade of conservativeness is adapted in response to the measured dose delivery errors. In the third strategy, the uncertainty margins around the target are recalculated based on the measured errors. The simulated systematic and random errors are either similar to the anticipated errors or unpredictably larger, in order to critically evaluate the performance of the adaptive strategies. The simulations show that robustly optimized treatment plans provide sufficient treatment quality for those treatment error scenarios similar to the anticipated error scenarios. Combining robust planning with adaptation leads to improved OAR protection. In case of unpredictably larger treatment errors, the first strategy performs best at improving treatment quality in terms of target coverage and OAR protection. According to the simulations, these robust adaptive treatment strategies are able to identify candidates for an adaptive treatment, thus giving the opportunity to provide individualized plans, and improve their treatment quality through adaptation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michelle Böck, Anders Forsgren, Kjell Eriksson, Björn Hårdemark. 2016-11-04. Towards Robust Adaptive Radiation Therapy Strategies. https://doi.org/10.1002/mp.12226

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

KEEP EXPLORING

Related papers

AdGT: Decentralized Gradient Tracking with Adaptive Per-Agent Stepsizes

In decentralized optimization, gradient-tracking methods typically rely on a single global stepsize. This choice can be conservative when agents have local objectives with different smoothness constants, since the stepsize must remain stable for the agent with the largest smoothness constant. This paper proposes AdGT, a decentralized gradient-tracking method in which each agent adapts its own stepsize using local gradient variation and a single global safety factor. The method reduces fixed-stepsize tuning effort and allows agents to exploit local smoothness information during the iterations. For smooth and strongly convex local objectives over undirected networks, we prove that the analyzed AdGT update converges linearly to the exact consensus optimizer. We also study two adaptive stepsize updates that use changes in the gradient-tracking direction. We characterize when the corresponding candidate determines the stepsize and prove conditional lower and upper stepsize bounds and linear convergence under an additional relative tracking-disagreement condition. Experiments on logistic regression, ridge regression, synthetic quadratic problems, and a linear-regression benchmark against state-of-the-art decentralized solvers show that AdGT often reaches a given accuracy in fewer iterations or gradient evaluations than tuned fixed-stepsize GT and the tested baselines, especially under heterogeneous local smoothness. In the topology experiments, each tested AdGT update uses one common safety factor across all graphs, whereas the fixed GT stepsize is tuned separately for each graph and seed.

math.OC

Brockett cost function for symplectic eigenvalues

The sum of symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. Optimal solutions to this problem only offer a symplectic basis for the symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this note, we introduce a Brockett cost function and investigate its properties and the connection with the symplectic eigenvalues and eigenvectors of the considered matrix. Specifically, we prove that any stationary point consists of symplectic eigenvectors, characterize the saddle points and global minimizers based on which the trace minimization theorem for the symplectic eigenvalues is re-established, and the nonexistence of local nonglobal minimizers is justified.

math.OC

Riemannian Bilevel Optimization with Gradient Aggregation

We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggregates the lower-level descent direction with the upper-level gradient under a decaying multiplier, and its hypergradient is the reverse-mode derivative of the unrolled loop. Under geodesic convexity and quadratic growth of the lower level, the inner iterates converge to a point of the optimistic solution set at a polynomial rate. Approximate minimizers of the objective with a finite number of inner iterations converge to minimizers of the optimistic value. In the experiments RBDA selects the optimistic solution where the implicit and unrolled estimators remain at the initial point or stop at a larger query loss. While each of its outer steps costs more than that of the unrolled estimator, it attains the highest test accuracy in data hyper-cleaning.

math.OC