Advances in Kriging-Based Autonomous X-Ray Scattering Experiments.

Autonomous experimentation is an emerging paradigm for scientific discovery, wherein measurement instruments are augmented with decision-making algorithms, allowing them to autonomously explore parameter spaces of interest. We have recently demonstrated a generalized approach to autonomous experimental control, based on generating a surrogate model to interpolate experimental data, and a corresponding uncertainty model, which are computed using a Gaussian process regression known as ordinary Kriging (OK). We demonstrated the successful application of this method to exploring materials science problems using x-ray scattering measurements at a synchrotron beamline. Here, we report several improvements to this methodology that overcome limitations of traditional Kriging methods. The variogram underlying OK is global and thus insensitive to local data variation. We augment the Kriging variance with model-based measures, for instance providing local sensitivity by including the gradient of the surrogate model. As with most statistical regression methods, OK minimizes the number of measurements required to achieve a particular model quality. However, in practice this may not be the most stringent experimental constraint; e.g. the goal may instead be to minimize experiment duration or material usage. We define an adaptive cost function, allowing the autonomous method to balance information gain against measured experimental cost. We provide synthetic and experimental demonstrations, validating that this improved algorithm yields more efficient autonomous data collection

Computational design of nanophotonic structures using an adaptive finite element method

We consider the problem of the construction of the nanophotonic structures of arbitrary geometry with prescribed desired properties. We reformulate this problem as an optimization problem for the Tikhonov functional which is minimized on adaptively locally refined meshes. These meshes are refined only in places where the nanophotonic structure should be designed. Our special symmetric mesh refinement procedure allows the construction of different nanophotonic structures. We illustrate efficiency of our adaptive optimization algorithm on the construction of nanophotonic structure in two dimensions

Exploring, tailoring, and traversing the solution landscape of a phase-shaped CARS process

Pulse shaping techniques are used to improve the selectivity of broadband CARS experiments, and to reject the overwhelming background. Knowledge about the fitness landscape and the capability of tailoring it is crucial for both fundamental insight and performing an efficient optimization of phase shapes. We use an evolutionary algorithm to find the optimal spectral phase of the broadband pump and probe beams in a background-suppressed shaped CARS process. We then investigate the shapes, symmetries, and topologies of the landscape contour lines around the optimal solution and also around the point corresponding to zero phase. We demonstrate the significance of the employed phase bases in achieving convex contour lines, suppressed local optima, and high optimization fitness with a few (and even a single) optimization parameter

Structured Sparsity: Discrete and Convex approaches

Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics applications: While the ambient dimension is vast in modern data analysis problems, the relevant information therein typically resides in a much lower dimensional space. However, many solutions proposed nowadays do not leverage the true underlying structure. Recent results in CS extend the simple sparsity idea to more sophisticated {\em structured} sparsity models, which describe the interdependency between the nonzero components of a signal, allowing to increase the interpretability of the results and lead to better recovery performance. In order to better understand the impact of structured sparsity, in this chapter we analyze the connections between the discrete models and their convex relaxations, highlighting their relative advantages. We start with the general group sparse model and then elaborate on two important special cases: the dispersive and the hierarchical models. For each, we present the models in their discrete nature, discuss how to solve the ensuing discrete problems and then describe convex relaxations. We also consider more general structures as defined by set functions and present their convex proxies. Further, we discuss efficient optimization solutions for structured sparsity problems and illustrate structured sparsity in action via three applications.Comment: 30 pages, 18 figure