Antibiotic resistance is one of the major challenges we face in modern times. Antibiotic use, especially their overuse, is the single most important driver of antibiotic resistance. Efforts have been made to reduce unnecessary drug prescriptions, but limited work is devoted to optimising dosage regimes when they are prescribed. The design of antibiotic treatments can be formulated as an optimisation problem where candidate solutions are encoded as vectors of dosages per day. The formulation naturally gives rise to competing objectives, as we want to maximise the treatment effectiveness while minimising the total drug use, the treatment duration and the concentration of antibiotic experienced by the patient. This article combines a recent mathematical model of bacterial growth including both susceptible and resistant bacteria, with a multi-objective evolutionary algorithm in order to automatically design successful antibiotic treatments. We consider alternative formulations combining relevant objectives and constraints. Our approach obtains shorter treatments, with improved success rates and smaller amounts of drug than the standard practice of administering daily fixed doses. These new treatments consistently involve a higher initial dose followed by lower tapered doses.
CopyrightItems in 'OpenAIR@RGU', Robert Gordon University Open Access Institutional Repository, are protected by copyright and intellectual property law. If you believe that any material held in 'OpenAIR@RGU' infringes copyright, please contact openair-help@rgu.ac.uk with details. The item will be removed from the repository while the claim is investigated. ABSTRACTProblem structure, or linkage, refers to the interaction between variables in a black-box fitness function. Discovering structure is a feature of a range of algorithms, including estimation of distribution algorithms (EDAs) and perturbation methods (PMs). The complexity of structure has traditionally been used as a broad measure of problem difficulty, as the computational complexity relates directly to the complexity of structure. The EDA literature describes necessary and unnecessary interactions in terms of the relationship between problem structure and the structure of probabilistic graphical models discovered by the EDA. In this paper we introduce a classification of problems based on monotonicity invariance. We observe that the minimal problem structures for these classes often reveal that significant proportions of detected structures are unnecessary. We perform a complete classification of all functions on 3 bits. We consider nonmonotonicity linkage discovery using perturbation methods and derive a concept of directed ordinal linkage associated to optimization schedules. The resulting refined classification factored out by relabeling, shows a hierarchy of nine directed ordinal linkage classes for all 3-bit functions. We show that this classification allows precise analysis of computational complexity and parallelizability and conclude with a number of suggestions for future work.
Benchmarks are important for comparing performance of optimisation algorithms, but we can select instances that present our algorithm favourably, and dismiss those on which our algorithm under-performs. Also related are automated design of algorithms, which use problem instances (benchmarks) to train an algorithm: careful choice of instances is needed for the algorithm to generalise. We sweep parameter se ings of di erential evolution to applied to the BBOB benchmarks. Several benchmark functions are highly correlated. is may lead to the false conclusion that an algorithm performs well in general, when it performs poorly on a few key instances. ese correlations vary with the number of evaluations.
This is an author produced version of a paper published in IEEE Congress on Evolutionary Computation (CEC): Proceedings (ISBN 9781479974924)This version may not include final proof corrections and does not include published layout or pagination. Citation DetailsCitation for the version of the work held in 'OpenAIR@RGU': Copyright Items in 'OpenAIR@RGU', Robert Gordon University Open Access Institutional Repository, are protected by copyright and intellectual property law. If you believe that any material held in 'OpenAIR@RGU' infringes copyright, please contact openair-help@rgu.ac.uk with details. The item will be removed from the repository while the claim is investigated. Abstract-Metaheuristics assume some kind of coherence between decision and objective spaces. Estimation of Distribution algorithms approach this by constructing an explicit probabilistic model of high fitness solutions, the structure of which is intended to reflect the structure of the problem. In this context, "structure" means the dependencies or interactions between problem variables in a probabilistic graphical model. There are many approaches to discovering these dependencies, and existing work has already shown that often these approaches discover "unnecessary" elements of structure -that is, elements which are not needed to correctly rank solutions. This work performs an exhaustive analysis of all 2 and 3 bit problems, grouped into classes based on mononotic invariance. It is shown in [1] that each class has a minimal Walsh structure that can be used to solve the problem. We compare the structure discovered by different structure learning approaches to the minimal Walsh structure for each class, with summaries of which interactions are (in)correctly identified. Our analysis reveals a large number of symmetries that may be used to simplify problem solving. We show that negative selection can result in improved coherence between discovered and necessary structure, and conclude with some directions for a general programme of study building on this work.for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.