seed solution
LieSolver: A PDE-constrained solver for IBVPs using Lie symmetries
Klausen, René P., Timofeev, Ivan, Frank, Johannes, Naujoks, Jonas, Wiegand, Thomas, Lapuschkin, Sebastian, Samek, Wojciech
We introduce a method for efficiently solving initial-boundary value problems (IBVPs) that uses Lie symmetries to enforce the associated partial differential equation (PDE) exactly by construction. By leveraging symmetry transformations, the model inherently incorporates the physical laws and learns solutions from initial and boundary data. As a result, the loss directly measures the model's accuracy, leading to improved convergence. Moreover, for well-posed IBVPs, our method enables rigorous error estimation. The approach yields compact models, facilitating an efficient optimization. We implement LieSolver and demonstrate its application to linear homogeneous PDEs with a range of initial conditions, showing that it is faster and more accurate than physics-informed neural networks (PINNs). Overall, our method improves both computational efficiency and the reliability of predictions for PDE-constrained problems.
Extracting Structured Seed-Mediated Gold Nanorod Growth Procedures from Literature with GPT-3
Walker, Nicholas, Dagdelen, John, Cruse, Kevin, Lee, Sanghoon, Gleason, Samuel, Dunn, Alexander, Ceder, Gerbrand, Alivisatos, A. Paul, Persson, Kristin A., Jain, Anubhav
Abstract--Although gold nanorods have been the subject of much research, the pathways for controlling their shape and thereby their optical properties remain largely heuristically understood. Although it is apparent that the simultaneous presence of and interaction between various reagents during synthesis control these properties, computational and experimental approaches for exploring the synthesis space can be either intractable or too time-consuming in practice. This motivates an alternative approach leveraging the wealth of synthesis information already embedded in the body of scientific literature by developing tools to extract relevant structured data in an automated, high-throughput manner. To that end, we present an approach using the powerful GPT-3 language model to extract structured multi-step seed-mediated growth procedures and outcomes for gold nanorods from unstructured scientific text. GPT-3 prompt completions are finetuned to predict synthesis templates in the form of JSON documents from unstructured text input with an overall accuracy of 86%. The performance is notable, considering the model is performing simultaneous entity recognition and relation extraction. We present a dataset of 11,644 entities extracted from 1,137 papers, resulting in 268 papers with at least one complete seed-mediated gold nanorod growth procedure and outcome for a total of 332 complete procedures. In the last three semiconductor technology,[11, 12] biomedicine,[13, 14] and decades, chemists have developed the ability to synthesize cosmetics.[15] The suitability of a nanoparticle for a particular anisotropic metal nanoparticles in a controllable and re-application depends on its morphology and size, which correspond to different plasmonic properties.[16,
A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses
Ampellio, Enrico, Vassio, Luca
In many technical fields, single-objective optimization procedures in continuous domains involve expensive numerical simulations. In this context, an improvement of the Artificial Bee Colony (ABC) algorithm, called the Artificial super-Bee enhanced Colony (AsBeC), is presented. AsBeC is designed to provide fast convergence speed, high solution accuracy and robust performance over a wide range of problems. It implements enhancements of the ABC structure and hybridizations with interpolation strategies. The latter are inspired by the quadratic trust region approach for local investigation and by an efficient global optimizer for separable problems. Each modification and their combined effects are studied with appropriate metrics on a numerical benchmark, which is also used for comparing AsBeC with some effective ABC variants and other derivative-free algorithms. In addition, the presented algorithm is validated on two recent benchmarks adopted for competitions in international conferences. Results show remarkable competitiveness and robustness for AsBeC.