eCommons

 

Advances in Sparse and Bayesian Optimization for Autonomous Scientific Discovery

dc.contributor.authorAment, Sebastian
dc.contributor.chairGomes, Carlaen_US
dc.contributor.committeeMemberBindel, Daviden_US
dc.contributor.committeeMemberSelman, Barten_US
dc.date.accessioned2023-03-31T16:37:40Z
dc.date.available2023-03-31T16:37:40Z
dc.date.issued2022-12
dc.description283 pagesen_US
dc.description.abstractScientists are increasingly leveraging modern computational methods for the analysis of experimental data and the design of new experiments in order to enable and accelerate scientific progress. Particularly valuable to scientific research are sparse, interpretable models, uncertainty quantification, and the minimization of the number of experiments that are required to achieve a scientific end. The fields of sparse and Bayesian optimization (BO) constitute a highly suitable basis for tackling these scientific problems and, despite considerable prior work, contain many questions that require further inquiry: Can we design algorithms that can outperform existing ones on key problems? What are the precise conditions under which an algorithm can determine a sparse model from little data? How can machines best design scientific experiments to minimize their cost? This thesis puts forth algorithmic and theoretical advances that aim to answer these questions. Part I provides an overview of the main contributions of this thesis. In Part II, we develop novel theoretical insights on sparsity-promoting algorithms and propose per- formant new algorithms. In Part III, we propose exact methods that reduce the complexity of a critical step in first-order BO from quadratic to linear in the dimensionality of the input. In Part IV, we focus on applications in scientific discovery, a highlight being the Scientific Autonomous Reasoning Agent (SARA), which was deployed at the Cornell High-Energy Synchrotron Source (CHESS) and the Stanford Linear Accelerator Center (SLAC), accelerating the acquisition of relevant scientific data for materials discovery by orders of magnitude. We conclude with future research directions in Part V.en_US
dc.identifier.doihttps://doi.org/10.7298/rg9z-6p14
dc.identifier.otherAment_cornellgrad_0058F_13285
dc.identifier.otherhttp://dissertations.umi.com/cornellgrad:13285
dc.identifier.urihttps://hdl.handle.net/1813/112894
dc.language.isoen
dc.rightsAttribution 4.0 International*
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/*
dc.subjectActive Learningen_US
dc.subjectAutonomousen_US
dc.subjectBayesian Optimizationen_US
dc.subjectGaussian Processen_US
dc.subjectMaterials Scienceen_US
dc.subjectSparsityen_US
dc.titleAdvances in Sparse and Bayesian Optimization for Autonomous Scientific Discoveryen_US
dc.typedissertation or thesisen_US
dcterms.licensehttps://hdl.handle.net/1813/59810.2
thesis.degree.disciplineComputer Science
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Computer Science

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Ament_cornellgrad_0058F_13285.pdf
Size:
17.07 MB
Format:
Adobe Portable Document Format