Demo Data from EDBT 2026 / reviewers in the wild / expert
Matthew L. Weiss
dblp:277/7063
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0003-2930-1520ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 61% GPUs and heterogeneous computing · 39% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation › workload characterization
AI workload characterization |
0.6 | 1 | 2022 | AI-Enabling Workloads on Large-Scale GPU-Accelerated System: Characterization, Opportunities, and Implications · HPCA 2022 |
GPUs and heterogeneous computing › GPU computing
GPU-accelerated systems |
0.6 | 1 | 2022 | AI-Enabling Workloads on Large-Scale GPU-Accelerated System: Characterization, Opportunities, and Implications · HPCA 2022 |
Performance modeling and evaluation
workload characterization |
0.6 | 1 | 2022 | AI-Enabling Workloads on Large-Scale GPU-Accelerated System: Characterization, Opportunities, and Implications · HPCA 2022 |
GPUs and heterogeneous computing
GPU computing |
0.2 | 1 | 2022 | AI-Enabling Workloads on Large-Scale GPU-Accelerated System: Characterization, Opportunities, and Implications · HPCA 2022 |
Methods — techniques the papers use, named apart from their topics
user behavior analysis · 0.6job trace analysis · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | AI-Enabling Workloads on Large-Scale GPU-Accelerated System: Characterization, Opportunities, and ImplicationsabstractProduction high-performance computing (HPC) systems are adopting and integrating GPUs into their design to accommodate artificial intelligence (AI), machine learning, and data visualization workloads. To aid with the design and operations of new and existing GPU-based large-scale systems, we provide a detailed characterization of system operations, job characteristics, user behavior, and trends on a contemporary GPU-accelerated production HPC system. Our insights indicate that the pre-mature phases in modern AI workflow take up significant GPU hours while underutilizing GPUs, which opens up the opportunity for a multi-tier system. Finally, we provide various potential recommendations and areas for future investment for system architects, operators, and users. Baolin Li 0001, Rohin Arora, Siddharth Samsi, Tirthak Patel, William Arcand, David Bestor, Chansup Byun, Rohan Basu Roy, Bill Bergeron, John T. Holodnak, Michael Houle 0001, Matthew Hubbell, Michael Jones 0001, Jeremy Kepner, Anna Klein, Peter Michaleas, Joseph McDonald, Lauren Milechin, Julie Mullen, Andrew Prout, Benjamin Price, Albert Reuther, Antonio Rosa, Matthew L. Weiss, Charles Yee, Daniel Edelman, Allan Vanterpool, Anson Cheng, Vijay Gadepally, Devesh Tiwari |
HPCA | 24 |
| 2019 | Deep Learning with Domain Randomization for Optimal FilteringabstractFiltering is the process of recovering a signal, x(t), from noisy measurements z(t). One common filter is the Kalman Filter, which is proven to be the conditional minimum variance estimator of x(t) when the measurements are a Gaussian random processes. However, in practice (a) the measurements are not necessarily Gaussian and (b) an estimation of the measurement covariance is problematic and often tuned using cross-validation and domain knowledge. In order to address the Kalman Filter's suboptimal performance in situations where non-Gaussian noise is present, we train a deep autoencoder to learn a mapping of the noisy measurements to a "learned" noise process covariance R(t) and measurements z(t), which are passed to a Kalman Filter. The Kalman Filter's output is then mapped to the original measurement space via the decoder portion of the autoencoder, where this output and original measurements are compared. Training this autoencoder-Kalman Filter (AEKF) via domain randomization on simulated noisy sensor responses, we show the AEKF's estimate of x(t), in the majority of cases, achieves a lower MSE than both a standard Kalman Filter and a Long Short-Term Memory (LSTM) recurrent deep neural network. Most significantly, the AEKF outperforms all methods in the case of simulated Cauchy noise. Matthew L. Weiss, Randy C. Paffenroth, Jacob Whitehill, Joshua R. Uzarski |
ICMLA | 1 |