eCommons

 

Advances in Sparse and Bayesian Optimization for Autonomous Scientific Discovery

Other Titles

Abstract

Scientists 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.

Journal / Series

Volume & Issue

Description

283 pages

Sponsorship

Date Issued

2022-12

Publisher

Keywords

Active Learning; Autonomous; Bayesian Optimization; Gaussian Process; Materials Science; Sparsity

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Gomes, Carla

Committee Co-Chair

Committee Member

Bindel, David
Selman, Bart

Degree Discipline

Computer Science

Degree Name

Ph. D., Computer Science

Degree Level

Doctor of Philosophy

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Attribution 4.0 International

Types

dissertation or thesis

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record