Goto

Collaborating Authors

 Government


DPM: A deep learning PDE augmentation method (with application to large-eddy simulation)

arXiv.org Machine Learning

DPM: A deep learning PDE augmentation method (with application to large-eddy simulation) Jonathan B. Freund, Jonathan F. MacArt โ€ , and Justin Sirignano โ€กยง November 22, 2019 Abstract Machine learning for scientific applications faces the challenge of limited data. We propose a framework that leverages a priori known physics to reduce overfitting when training on relatively small datasets. A deep neural network is embedded in a partial differential equation (PDE) that expresses the known physics and learns to describe the corresponding unknown or unrepresented physics from the data. Crafted as such, the neural network can also provide corrections for erroneously represented physics, such as discretization errors associated with the PDE's numerical solution. Once trained, the deep learning PDE model (DPM) can make out-of-sample predictions for new physical parameters, geometries, and boundary conditions. Estimating the embedded neural network requires optimizing over the entire PDE, which itself is a function of the neural network. Adjoint partial differential equations are used to efficiently calculate the high-dimensional gradient of the objective function with respect to the neural network parameters. A stochastic adjoint method (SAM), similar in spirit to stochastic gradient descent, further accelerates training. The approach is demonstrated and evaluated for turbulence predictions using large-eddy simulation (LES), a filtered version of the Navier-Stokes equation containing unclosed sub-filter-scale terms. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training and testing data. The DPM outperforms the widely-used constant-coefficient and dynamic Smagorinsky models, even for filter sizes so large that these established models become qualitatively incorrect. It also significantly outperforms a priori trained models, which do not account for the full PDE. For comparable accuracy, the overall cost is reduced. Simulations of the DPM are accelerated by efficient GPU implementations of network evaluations. Measures of discretization errors, which are well-known to be consequential in LES, suggest that the ability of the training formulation to correct for these errors Mechanical Science & Engineering and Aerospace Engineering, University of Illinois at Urbana-Champaign, jbfre-und@illinois.edu


Robustness Certificates for Sparse Adversarial Attacks by Randomized Ablation

arXiv.org Machine Learning

Recently, techniques have been developed to provably guarantee the robustness of a classifier to adversarial perturbations of bounded L 1 and L 2 magnitudes by using randomized smoothing: the robust classification is a consensus of base classifications on randomly noised samples where the noise is additive. In this paper, we extend this technique to the L 0 threat model. We propose an efficient and certifiably robust defense against sparse adversarial attacks by randomly ablating input features, rather than using additive noise. Experimentally, on MNIST, we can certify the classifications of over 50% of images to be robust to any distortion of at most 8 pixels. This is comparable to the observed empirical robustness of unprotected classifiers on MNIST to modern L 0 attacks, demonstrating the tightness of the proposed robustness certificate. We also evaluate our certificate on ImageNet and CIFAR-10. Our certificates represent an improvement on those provided in a concurrent work (Lee et al. 2019) which uses random noise rather than ablation (median certificates of 8 pixels versus 4 pixels on MNIST; 16 pixels versus 1 pixel on ImageNet.) Additionally, we empirically demonstrate that our classifier is highly robust to modern sparse adversarial attacks on MNIST. Our classifications are robust, in median, to adversarial perturbations of up to 31 pixels, compared to 22 pixels reported as the state-of-the-art defense, at the cost of a slight decrease (around 2. 3%) in the classification accuracy. Introduction Adversarial attacks, and defenses against these attacks, have been active topics of research in machine learning in recent years (Szegedy et al. 2013; Carlini and Wagner 2017; Madry et al. 2017).


OmniFold: A Method to Simultaneously Unfold All Observables

arXiv.org Machine Learning

Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, U.S.A. Collider data must be corrected for detector effects ("unfolded") to be compared with theoretical calculations and measurements from other experiments. Unfolding is traditionally done for individual, binned observables without including all information relevant for characterizing the detector response. We introduce OmniFold, an unfolding method that iteratively reweights a simulated dataset, using machine learning to capitalize on all available information. Our approach is un-binned, works for arbitrarily high-dimensional data, and naturally incorporates information from the full phase space. We illustrate this technique on a realistic jet substructure example from the Large Hadron Collider and compare it to standard binned unfolding methods. This new paradigm enables the simultaneous measurement of all observables, including those not yet invented at the time of the analysis.


Replication-based emulation of the response distribution of stochastic simulators using generalized lambda distributions

arXiv.org Machine Learning

Due to limited computational power, performing uncertainty quantification analyses with complex computational models can be a challenging task. This is exacerbated in the context of stochastic simulators, the response of which to a given set of input parameters, rather than being a deterministic value, is a random variable with unknown probability density function (PDF). Of interest in this paper is the construction of a surrogate that can accurately predict this response PDF for any input parameters. We suggest using a flexible distribution family -- the generalized lambda distribution -- to approximate the response PDF. The associated distribution parameters are cast as functions of input parameters and represented by sparse polynomial chaos expansions. To build such a surrogate model, we propose an approach based on a local inference of the response PDF at each point of the experimental design based on replicated model evaluations. Two versions of this framework are proposed and compared on analytical examples and case studies.


Challenges with Extreme Class-Imbalance and Temporal Coherence: A Study on Solar Flare Data

arXiv.org Machine Learning

In analyses of rare-events, regardless of the domain of application, class-imbalance issue is intrinsic. Although the challenges are known to data experts, their explicit impact on the analytic and the decisions made based on the findings are often overlooked. This is in particular prevalent in interdisciplinary research where the theoretical aspects are sometimes overshadowed by the challenges of the application. To show-case these undesirable impacts, we conduct a series of experiments on a recently created benchmark data, named Space Weather ANalytics for Solar Flares (SWAN-SF). This is a multivariate time series dataset of magnetic parameters of active regions. As a remedy for the imbalance issue, we study the impact of data manipulation (undersampling and oversampling) and model manipulation (using class weights). Furthermore, we bring to focus the auto-correlation of time series that is inherited from the use of sliding window for monitoring flares' history. Temporal coherence, as we call this phenomenon, invalidates the randomness assumption, thus impacting all sampling practices including different cross-validation techniques. We illustrate how failing to notice this concept could give an artificial boost in the forecast performance and result in misleading findings. Throughout this study we utilized Support Vector Machine as a classifier, and True Skill Statistics as a verification metric for comparison of experiments. We conclude our work by specifying the correct practice in each case, and we hope that this study could benefit researchers in other domains where time series of rare events are of interest.


A CNN-RNN Framework for Crop Yield Prediction

arXiv.org Machine Learning

Crop yield prediction is extremely challenging due to its dependence on multiple factors such as crop genotype, environmental factors, management practices, and their interactions. This paper presents a deep learning framework using convolutional neural networks (CNN) and recurrent neural networks (RNN) for crop yield prediction based on environmental data and management practices. The proposed CNN-RNN model, along with other popular methods such as random forest (RF), deep fully-connected neural networks (DFNN), and LASSO, was used to forecast corn and soybean yield across the entire Corn Belt (including 13 states) in the United States for years 2016, 2017, and 2018 using historical data. The new model achieved a root-mean-square-error (RMSE) 9% and 8% of their respective average yields, substantially outperforming all other methods that were tested. The CNN-RNN have three salient features that make it a potentially useful method for other crop yield prediction studies. (1) The CNN-RNN model was designed to capture the time dependencies of environmental factors and the genetic improvement of seeds over time without having their genotype information. (2) The model demonstrated the capability to generalize the yield prediction to untested environments without significant drop in the prediction accuracy. (3) Coupled with the backpropagation method, the model could reveal the extent to which weather conditions, accuracy of weather predictions, soil conditions, and management practices were able to explain the variation in the crop yields.


Deep Minimax Probability Machine

arXiv.org Machine Learning

--Deep neural networks enjoy a powerful representation and have proven effective in a number of applications. However, recent advances show that deep neural networks are vulnerable to adversarial attacks incurred by the so-called adversarial examples. Although the adversarial example is only slightly different from the input sample, the neural network classifies it as the wrong class. In order to alleviate this problem, we propose the Deep Minimax Probability Machine (DeepMPM), which applies MPM to deep neural networks in an end-to-end fashion. In a worst-case scenario, MPM tries to minimize an upper bound of misclassification probabilities, considering the global information (i.e., mean and covariance information of each class). DeepMPM can be more robust since it learns the worst-case bound on the probability of misclassification of future data. Experiments on two real-world datasets can achieve comparable classification performance with CNN, while can be more robust on adversarial attacks.


Invariant Representations through Adversarial Forgetting

arXiv.org Machine Learning

We propose a novel approach to achieving invariance for deep neural networks in the form of inducing amnesia to unwanted factors of data through a new adversarial forgetting mechanism. We show that the forgetting mechanism serves as an information-bottleneck, which is manipulated by the adversarial training to learn invariance to unwanted factors. Empirical results show that the proposed framework achieves state-of-the-art performance at learning invariance in both nuisance and bias settings on a diverse collection of datasets and tasks.


USAF Plans For Its "Skyborg" AI Computer Brain To Be Flying Drones In The Next Two Years

#artificialintelligence

"I expect the first things that we'll do will not appear as sexy as what you might imagine in a movie, but will be completely game-changing," Roper explained at the conference on Mar. 13, 2019. He did not elaborate, but one of the immediate benefits of an AI or AI-enabled system is the increased speed of decision-making. At first, a drone with Skyborg might not necessarily do anything a manned aircraft can't do already, but it will be able to perform those tasks, such as aerial combat maneuvers or weapons employment, faster based on its set parameters. Where a human might be distracted or confused by the chaos of an aerial engagement, an autonomous unmanned aircraft would simply act. The drone would be able to make its decision quickly, but also based on an immense amount of situational data that would take an actual pilot much longer to process.


The BYTE 11/15/19

#artificialintelligence

Welcome to the BYTE, where we serve up the latest home and tech news from the last week for you to sink your teeth into. This week we're taking a BYTE out of a battlefield tested skincare, A.I. device that can detect unattended children, VR and labor, and an app that can track drones. If it's military-grade, it's bound to be top of the line, right? And the number one skincare product that service members pack for deployment is baby wipes. So why not create wipes that are specifically geared towards active duty service members?