Nugent, Peter
FAIR Universe HiggsML Uncertainty Challenge Competition
Bhimji, Wahid, Calafiura, Paolo, Chakkappai, Ragansu, Chang, Po-Wen, Chou, Yuan-Tang, Diefenbacher, Sascha, Dudley, Jordan, Farrell, Steven, Ghosh, Aishik, Guyon, Isabelle, Harris, Chris, Hsu, Shih-Chieh, Khoda, Elham E, Lyscar, Rémy, Michon, Alexandre, Nachman, Benjamin, Nugent, Peter, Reymond, Mathis, Rousseau, David, Sluijter, Benjamin, Thorne, Benjamin, Ullah, Ihsan, Zhang, Yulei
The FAIR Universe -- HiggsML Uncertainty Challenge focuses on measuring the physics properties of elementary particles with imperfect simulators due to differences in modelling systematic errors. Additionally, the challenge is leveraging a large-compute-scale AI platform for sharing datasets, training models, and hosting machine learning competitions. Our challenge brings together the physics and machine learning communities to advance our understanding and methodologies in handling systematic (epistemic) uncertainties within AI techniques.
Identifying Transients in the Dark Energy Survey using Convolutional Neural Networks
Ayyar, Venkitesh, Knop, Robert Jr., Awbrey, Autumn, Andersen, Alexis, Nugent, Peter
The ability to discover new transient candidates via image differencing without direct human intervention is an important task in observational astronomy. For these kind of image classification problems, machine Learning techniques such as Convolutional Neural Networks (CNNs) have shown remarkable success. In this work, we present the results of an automated transient candidate identification on images with CNNs for an extant dataset from the Dark Energy Survey Supernova program (DES-SN), whose main focus was on using Type Ia supernovae for cosmology. By performing an architecture search of CNNs, we identify networks that efficiently select non-artifacts (e.g. The CNNs also help us identify a subset of mislabeled images. Performing a relabeling of the images in this subset, the resulting classification with CNNs is significantly better than previous results, lowering the false positive rate by 27% at a fixed missed detection rate of 0.05. INTRODUCTION A major aspect of observational astronomy is the "survey" which involves the wholesale mapping of various regions of the sky to create catalogs which are subsequently mined for scientifically important astronomical objects. We refer to a transient candidate as the detection on a single image of a new or varying source with respect to a previously taken reference image, regardless of its astrophysical nature since at this stage its classification is unknown and will remain so until further data is taken (spectroscopy and/or additional photometry). Some examples of such transient candidates are solar system objects, supernovae, active galactic nuclei, variable stars, and neutron star mergers, etc. Since some of these events are quite rare and will fade rapidly, it is often important to trigger follow-up observations immediately to glean their underlying nature and discover new physics. Hence, identifying transient candidates in images quickly and efficiently is very important so as not to waste precious, and expensive, follow-up resources. For many years this process was conducted by manual inspection of images by humans.
Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery
Wu, Yulun, Choma, Nicholas, Chen, Andrew, Cashman, Mikaela, Prates, Érica T., Shah, Manesh, Vergara, Verónica G. Melesse, Clyde, Austin, Brettin, Thomas S., de Jong, Wibe A., Kumar, Neeraj, Head, Martha S., Stevens, Rick L., Nugent, Peter, Jacobson, Daniel A., Brown, James B.
We developed Distilled Graph Attention Policy Networks (DGAPNs), a curiosity-driven reinforcement learning model to generate novel graph-structured chemical representations that optimize user-defined objectives by efficiently navigating a physically constrained domain. The framework is examined on the task of generating molecules that are designed to bind, noncovalently, to functional sites of SARS-CoV-2 proteins. We present a spatial Graph Attention Network (sGAT) that leverages self-attention over both node and edge attributes as well as encoding spatial structure -- this capability is of considerable interest in areas such as molecular and synthetic biology and drug discovery. An attentional policy network is then introduced to learn decision rules for a dynamic, fragment-based chemical environment, and state-of-the-art policy gradient techniques are employed to train the network with enhanced stability. Exploration is efficiently encouraged by incorporating innovation reward bonuses learned and proposed by random network distillation. In experiments, our framework achieved outstanding results compared to state-of-the-art algorithms, while increasing the diversity of proposed molecules and reducing the complexity of paths to chemical synthesis.