Erik Skau

Erik Skau

Auto-generated profile, based on publicly available information

Erik Skau

Los Alamos National Laboratory

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 July 2018 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
HWHan Wang
Han Wang
ESErik Skau
Erik Skau
HKHamid Krim
Hamid Krim
GCGuido Cervone
Guido Cervone
Data heterogeneity can pose a great challenge to process and systematically fuse low-level data from different modalities with no recourse to heuristics and manual adjustments and refinements. In this paper, a new methodology is introduced for the fusion of measured data for detecting and predicting weather-driven natural hazards. The proposed research introduces a robust theoretical and algorithmic framework for the fusion of heterogeneous data in near real time. We establish a flexible information-based fusion framework with a target optimality criterion of choice, which for illustration, is specialized to a maximum entropy principle and a least effort principle for semisupervised learning with noisy labels. We develop a methodology to account for multimodality data and a solution for addressing inherent sensor limitations. In our case study of interest, namely, that of flood density estimation, we further show that by fusing remote sensing and social media data, we can develop well founded and actionable flood maps. This capability is valuable in situations where environmental hazards, such as hurricanes or severe weather, affect very large areas. Relative to the state of the art working with such data, our proposed information-theoretic solution is principled and systematic, while offering a joint exploitation of any set of heterogeneous sensor modalities with minimally assuming priors. This flexibility is coupled with the ability to quantitatively and clearly state the fusion principles with very reasonable computational costs. The proposed method is tested and substantiated with the multimodality data of a 2013 Boulder Colorado flood event.

8 February 2020 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
GCGopinath Chennupati
Gopinath Chennupati
RVRaviteja Vangara
Raviteja Vangara
ESErik Skau
Erik Skau
HDHristo Djidjev
Hristo Djidjev
BABoian S. Alexandrov
Boian S. Alexandrov

7 March 2023 in Digital Threats: Research and Practice
Verified
Journal Article
Open access
MEMaksim E. Eren
Maksim E. Eren
JMJuston S. Moore
Juston S. Moore
ESErik Skau
Erik Skau
EMElisabeth Moore
Elisabeth Moore
MBManish Bhattarai
Manish Bhattarai
BABoian S. Alexandrov
Boian S. Alexandrov
Distinguishing malicious anomalous activities from unusual but benign activities is a fundamental challenge for cyber defenders. Prior studies have shown that statistical user behavior analysis yields accurate detections by learning behavior profiles from observed user activity. These unsupervised models are able to generalize to unseen types of attacks by detecting deviations from normal behavior without knowledge of specific attack signatures. However, approaches proposed to date based on probabilistic matrix factorization are limited by the information conveyed in a two-dimensional space. Non-negative tensor factorization, however, is a powerful unsupervised machine learning method that naturally models multi-dimensional data, capturing complex and multi-faceted details of behavior profiles. Our new unsupervised statistical anomaly detection methodology matches or surpasses state-of-the-art supervised learning baselines across several challenging and diverse cyber application areas, including detection of compromised user credentials, botnets, spam e-mails, and fraudulent credit card transactions.

19 January 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
BABoian S. Alexandrov
Boian S. Alexandrov
GMGianmarco Manzini
Gianmarco Manzini
ESErik W. Skau
Erik W. Skau
DTDuc P. Truong
Duc P. Truong
RVRadoslav G Vuchkov
Radoslav G Vuchkov
Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

8 September 2023 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
IBIsmael Boureima
Ismael Boureima
MBManish Bhattarai
Manish Bhattarai
MEMaksim Eren
Maksim Eren
ESErik Skau
Erik Skau
PRPhilip Romero
Philip Romero
BABoian S. Alexandrov
Boian S. Alexandrov
We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density $$10^{-6}$$ 10 - 6 .

1 March 2017
Verified
Conference Paper
Closed access
SMShahin Mahdizadehaghdam
Shahin Mahdizadehaghdam
LDLiyi Dai
Liyi Dai
HKHamid Krim
Hamid Krim
ESErik Skau
Erik Skau
HWHan Wang
Han Wang
Hierarchical dictionary learning seeks multiple dictionaries at different image scales to capture complementary coherent characteristics. We propose a method to learn a hierarchy of two overcomplete synthesis dictionaries with an image classification goal. The classification objective in some sense regularizes the joint optimization of the hierarchical dictionaries and injects refinement feedback. The validation of the proposed approach is based on its classification performance using two well-known data sets.