activity
20192022
most citedFast Gaussian Process Posterior Mean Prediction via Local Cross Validation and Precomputation

1 citations · 2 across the 4 of their papers we have counts for

collaborators

7 papers

cs.LG20221 cited

Scalable Gaussian Process Hyperparameter Optimization via Coverage Regularization

Killian Wood, Alec M. Dunton, Amanda Muyskens +1

Gaussian processes (GPs) are Bayesian non-parametric models popular in a variety of applications due to their accuracy and native uncertainty quantification (UQ). Tuning GP hyperpa…

cs.LG20221 cited

Fast Gaussian Process Posterior Mean Prediction via Local Cross Validation and Precomputation

Alec M. Dunton, Benjamin W. Priest, Amanda Muyskens

Gaussian processes (GPs) are Bayesian non-parametric models useful in a myriad of applications. Despite their popularity, the cost of GP predictions (quadratic storage and cubic co…

math.NA2021

Deterministic matrix sketches for low-rank compression of high-dimensional simulation data

Alec Michael Dunton, Alireza Doostan

Matrices arising in scientific applications frequently admit linear low-rank approximations due to smoothness in the physical and/or temporal domain of the problem. In large-scale…

cs.CE2021

Task-parallel in-situ temporal compression of large-scale computational fluid dynamics data

Heather Pacella, Alec Dunton, Alireza Doostan +1

Present day computational fluid dynamics simulations generate extremely large amounts of data, sometimes on the order of TB/s. Often, a significant fraction of this data is discard…

math.NA2020

Mixed precision matrix interpolative decompositions for model reduction

Alec Michael Dunton, Alyson Fox

Renewed interest in mixed-precision algorithms has emerged due to growing data capacity and bandwidth concerns, as well as the advancement of GPUs, which enable significant speedup…

cs.LG2020

Scaling Graph Clustering with Distributed Sketches

Benjamin W. Priest, Alec Dunton, Geoffrey Sanders

The unsupervised learning of community structure, in particular the partitioning vertices into clusters or communities, is a canonical and well-studied problem in exploratory graph…