Show simple item record

dc.contributor.advisorQian, Xiaoning
dc.creatorApaydin, Meltem
dc.date.accessioned2022-02-23T18:03:17Z
dc.date.available2023-05-01T06:36:46Z
dc.date.created2021-05
dc.date.issued2021-04-05
dc.date.submittedMay 2021
dc.identifier.urihttps://hdl.handle.net/1969.1/195632
dc.description.abstractIn many real-world applications, decision-making often has a nested structure with interactions among involved parties. Bilevel optimization provides a useful tool to formulate these problems to render effective solutions. However, when abstracting the real-world decision-making problems with mathematical models, simplifications or strict assumptions are often made. For example, the common assumptions for computational convenience are made, such as the "cooperation assumption" among outer- and inner-level decision-makers and the "uniqueness property", which the solution set to the inner-level optimization problem is a singleton. Violating such assumptions in real-world problems may lead to either unrealistic or poor solutions. In this thesis, we investigate the practical pessimistic view of bilevel optimization to mitigate these issues. We aim to obtain more robust solutions under potential uncertainty when modeling nested decision-making in real-world applications from metabolic engineering and machine learning. Specifically, new pessimistic reformulations are proposed for the bilevel mutant strain design and microbial community models in metabolic engineering, which lead to robust predictions and intervention strategies with microbial metabolic network models. The solutions are in fact scalable to genome-scale networks as the final mathematical programming formulations are bilevel linear programming. Furthermore, by allowing a relaxation for the inner-level problems, modeling uncertainties are incorporated to achieve robust solutions. Detailed empirical analyses have been performed to evaluate the impact of uncertainty and the violation of the aforementioned assumptions for these specific applications. Finally, we question the suitability of the commonly adopted optimistic view underlying recent bilevel hyperparameter optimization models where potential model uncertainty may arise under scarce data, or especially when the uniqueness assumption is violated. Thus, pessimistic bilevel hyperparameter optimization is proposed to assure appropriate outer-level hyperparameters to better generalize the inner-level learned models. To solve the resulting computationally challenging pessimistic bilevel optimization problem, a novel relaxation-based approximation method is developed. Extensive empirical experiments have been conducted to evaluate the usefulness of pessimistic solutions when we have limited training data or perturbed testing data. Under model simplifications and uncertainties, pessimistic bilevel optimization is a useful tool to obtain robust solutions for the presented metabolic engineering and machine learning applications. The proposed practical reformulations in this thesis can be extended to other real-world decision-making problems with scalable and computationally efficient solution algorithms.en
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectbilevel optimizationen
dc.subjectpessimistic bilevel optimizationen
dc.subjectmetabolic engineeringen
dc.subjectflux balance analysisen
dc.subjectmachine learningen
dc.subjecthyperparameter tuningen
dc.titlePESSIMISTIC BILEVEL OPTIMIZATION AND ITS APPLICATIONSen
dc.typeThesisen
thesis.degree.departmentElectrical and Computer Engineeringen
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.grantorTexas A&M Universityen
thesis.degree.nameDoctor of Philosophyen
thesis.degree.levelDoctoralen
dc.contributor.committeeMemberShen, Yang
dc.contributor.committeeMemberShakkottai, Srinivas
dc.contributor.committeeMemberArroyave, Raymundo
dc.type.materialtexten
dc.date.updated2022-02-23T18:03:17Z
local.embargo.terms2023-05-01
local.etdauthor.orcid0000-0002-5794-2889


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record