Variable length genetic algorithm with continuous parameters
optimization of beam layout in proton therapy
- URL: http://arxiv.org/abs/2205.08398v1
- Date: Tue, 17 May 2022 14:31:33 GMT
- Title: Variable length genetic algorithm with continuous parameters
optimization of beam layout in proton therapy
- Authors: Fran\c{c}ois Smekens, Nicolas Freud, Bruno Sixou, Guillaume Beslon and
Jean M L\'etang
- Abstract summary: We investigate a new optimization framework based on a genetic approach.
We propose to optimize simultaneously the target points and beam incidence angles in a continuous manner.
No textita priori technological constraints are taken into account, textiti.e.the beam energy values, incidence directions and target points are free parameters.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Proton therapy is a modality in fast development. Characterized by a maximum
dose deposition at the end of the proton trajectory followed by a sharp
fall-off, proton beams can deliver a highly conformal dose to the tumor while
sparing organs at risk and surrounding healthy tissues. New treatment planning
systems based on spot scanning techniques can now propose multi-field
optimization. However, in most cases, this optimization only processes the
field fluences whereas the choice of ballistics (field geometry) is left to the
oncologist and medical physicist.
In this work, we investigate a new optimization framework based on a genetic
approach. This tool is intended to explore new irradiation schemes and to
evaluate the potential of actual or future irradiation systems. We propose to
optimize simultaneously the target points and beam incidence angles in a
continuous manner and with a variable number of beams. No \textit{a priori}
technological constraints are taken into account, \textit{i.e.}~the beam energy
values, incidence directions and target points are free parameters.
The proposed algorithm is based on a modified version of classical genetic
operators: mutation, crossover and selection. We use the real coding associated
with random perturbations of the parameters to obtain a continuous variation of
the potential solutions. We also introduce a perturbation in the exchange
points of the crossover to allow variations of the number of beams. These
variations are controlled by introducing a beam fluence lower limit.
In this paper, we present a complete description of the algorithm and of its
behaviour in an elementary test case. The proposed method is finally assessed
in a clinically-realistic test case.
Related papers
- Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models [57.52124921268249]
We propose a Trust Sequential Quadratic Programming method to find both first and second-order stationary points.
To converge to first-order stationary points, our method computes a gradient step in each iteration defined by minimizing a approximation of the objective subject.
To converge to second-order stationary points, our method additionally computes an eigen step to explore the negative curvature the reduced Hessian matrix.
arXiv Detail & Related papers (2024-09-24T04:39:47Z) - Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels [78.6096486885658]
We introduce lower bounds to the linearized Laplace approximation of the marginal likelihood.
These bounds are amenable togradient-based optimization and allow to trade off estimation accuracy against computational complexity.
arXiv Detail & Related papers (2023-06-06T19:02:57Z) - Retrieving space-dependent polarization transformations via near-optimal
quantum process tomography [55.41644538483948]
We investigate the application of genetic and machine learning approaches to tomographic problems.
We find that the neural network-based scheme provides a significant speed-up, that may be critical in applications requiring a characterization in real-time.
We expect these results to lay the groundwork for the optimization of tomographic approaches in more general quantum processes.
arXiv Detail & Related papers (2022-10-27T11:37:14Z) - Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplings [10.47175870857988]
We introduce NubOT, a neural unbalanced OT formulation that relies on the formalism of semi-couplings to account for creation and destruction of mass.
We apply our method to the challenging task of forecasting heterogeneous responses of multiple cancer cell lines to various drugs.
arXiv Detail & Related papers (2022-09-30T17:48:04Z) - Designing Biological Sequences via Meta-Reinforcement Learning and
Bayesian Optimization [68.28697120944116]
We train an autoregressive generative model via Meta-Reinforcement Learning to propose promising sequences for selection.
We pose this problem as that of finding an optimal policy over a distribution of MDPs induced by sampling subsets of the data.
Our in-silico experiments show that meta-learning over such ensembles provides robustness against reward misspecification and achieves competitive results.
arXiv Detail & Related papers (2022-09-13T18:37:27Z) - Experimental Design for Linear Functionals in Reproducing Kernel Hilbert
Spaces [102.08678737900541]
We provide algorithms for constructing bias-aware designs for linear functionals.
We derive non-asymptotic confidence sets for fixed and adaptive designs under sub-Gaussian noise.
arXiv Detail & Related papers (2022-05-26T20:56:25Z) - Towards the optimization of ballistics in proton therapy using genetic
algorithms: implementation issues [0.0]
We investigate a new optimization framework based on a genetic algorithm approach.
The proposed optimization routine takes typically into account several thousands of spots of fixed size.
The behavior of the proposed genetic algorithm is illustrated in both elementary and clinically-realistic test cases.
arXiv Detail & Related papers (2022-05-17T12:31:14Z) - E-detectors: a nonparametric framework for sequential change detection [86.15115654324488]
We develop a fundamentally new and general framework for sequential change detection.
Our procedures come with clean, nonasymptotic bounds on the average run length.
We show how to design their mixtures in order to achieve both statistical and computational efficiency.
arXiv Detail & Related papers (2022-03-07T17:25:02Z) - Learning the Physics of Particle Transport via Transformers [0.0]
We present a data-driven dose calculation algorithm predicting the dose deposited by mono-energetic proton beams.
Our proposed model is 33 times faster than current clinical analytic pencil beam algorithms.
Our model could overcome a major obstacle that has so far prohibited real-time adaptive proton treatments.
arXiv Detail & Related papers (2021-09-08T22:26:03Z) - Optimizing Radiotherapy Plans for Cancer Treatment with Tensor Networks [0.0]
Intensity-Modulated Radiation Therapy (IMRT) technique allows treating irregular and inhomogeneous tumors while reducing the radiation toxicity on healthy organs.
We map the dose optimization problem into the search of the ground state of an Ising-like Hamiltonian, describing a system of long-range interacting qubits.
A similar approach can be applied to future hybrid classical-quantum algorithms, paving the way for the use of quantum technologies in future medical treatments.
arXiv Detail & Related papers (2020-10-19T14:28:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.