Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bram Wasti

dblp:220/3931 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 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.

Artificial intelligence
2 papers
Efficient and distributed learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › adaptive computation
early exit
0.812024
LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding · ACL (1) 2024
Machine learning › Efficient and distributed learning
inference efficiency
0.812024
LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding · ACL (1) 2024
Machine learning › Efficient and distributed learning › inference acceleration › speculative decoding
self-speculative decoding
0.812024
LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding · ACL (1) 2024
Machine learning › Efficient and distributed learning › inference acceleration
speculative decoding
0.812024
LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding · ACL (1) 2024
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN inference
edge inference
0.412019
Machine Learning at Facebook: Understanding Inference at the Edge · HPCA 2019
Hardware accelerators and domain-specific architectures › machine learning accelerator
inference accelerator
0.412019
Machine Learning at Facebook: Understanding Inference at the Edge · HPCA 2019
Machine learning › Efficient and distributed learning
on-device inference
0.112019
Machine Learning at Facebook: Understanding Inference at the Edge · HPCA 2019

Methods — techniques the papers use, named apart from their topics

layer skipping · 0.8data-driven workload characterization · 0.8
YearPublicationVenuePosition
2024 LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding
abstract
Mostafa Elhoushi, Akshat Shrivastava, Diana Liskovich, Basil Hosmer, Bram Wasti, Liangzhen Lai, Anas Mahmoud, Bilge Acun, Saurabh Agarwal, Ahmed Roman, Ahmed Aly, Beidi Chen, Carole-Jean Wu. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.
Mostafa Elhoushi, Akshat Shrivastava, Diana Liskovich, Basil Hosmer, Bram Wasti, Liangzhen Lai, Anas Mahmoud 0002, Bilge Acun, Ahmed Roman, Ahmed A. Aly, Beidi Chen, Carole-Jean Wu
ACL (1)5
2022 Q-gym: An Equality Saturation Framework for DNN Inference Exploiting Weight Repetition
abstract
The high computation cost is one of the key bottlenecks for adopting deep neural networks (DNNs) in different hardware. When client data are sensitive, privacy-preserving DNN evaluation method, such as homomorphic encryptions (HE), shows even more computation cost. Prior works employed weight repetition in quantized neural networks to save the computation of convolutions by memorizing or arithmetic factorization. However, such methods fail to fully exploit the exponential search space from factorizing and reusing computation. We propose Q-gym, a DNN framework consisting of two components. First, we propose a compiler, which leverages equality saturation to generate computation expressions for convolutional layers with a significant reduction in the number of operations. Second, we integrate the computation expressions with various parallelization methods to accelerate DNN inference on different hardware. We also employ the efficient expressions to accelerate DNN inference under HE.
Cheng Fu 0002, Hanxian Huang, Bram Wasti, Chris Cummins, Riyadh Baghdadi, Kim M. Hazelwood, Yuandong Tian, Jishen Zhao, Hugh Leather
PACT3
2022 CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research
abstract
Interest in applying Artificial Intelligence (AI) techniques to compiler optimizations is increasing rapidly, but compiler research has a high entry barrier. Unlike in other domains, compiler and AI researchers do not have access to the datasets and frameworks that enable fast iteration and development of ideas, and getting started requires a significant engineering investment. What is needed is an easy, reusable experimental infrastructure for real world compiler optimization tasks that can serve as a common benchmark for comparing techniques, and as a platform to accelerate progress in the field.We introduce CompilerGym, a set of environments for real world compiler optimization tasks, and a toolkit for exposing new optimization tasks to compiler researchers. CompilerGym enables anyone to experiment on production compiler optimization problems through an easy-to-use package, regardless of their experience with compilers. We build upon the popular OpenAI Gym interface enabling researchers to interact with compilers using Python and a familiar API.We describe the CompilerGym architecture and implementation, characterize the optimization spaces and computational efficiencies of three included compiler environments, and provide extensive empirical evaluations. Compared to prior works, CompilerGym offers larger datasets and optimization spaces, is 27× more computationally efficient, is fault-tolerant, and capable of detecting reproducibility bugs in the underlying compilers.In making it easy for anyone to experiment with compilers - irrespective of their background - we aim to accelerate progress in the AI and compiler research domains.
Chris Cummins, Bram Wasti, Jiadong Guo, Brandon Cui, Jason Ansel, Sahir Gomez, Somya Jain, Olivier Teytaud, Benoit Steiner, Yuandong Tian, Hugh Leather
CGO2
2019 Machine Learning at Facebook: Understanding Inference at the Edge
abstract
At Facebook, machine learning provides a wide range of capabilities that drive many aspects of user experience including ranking posts, content understanding, object detection and tracking for augmented and virtual reality, speech and text translations. While machine learning models are currently trained on customized data-center infrastructure, Facebook is working to bring machine learning inference to the edge. By doing so, user experience is improved with reduced latency (inference time) and becomes less dependent on network connectivity. Furthermore, this also enables many more applications of deep learning with important features only made available at the edge. This paper takes a data-driven approach to present the opportunities and design challenges faced by Facebook in order to enable machine learning inference locally on smart phones and other edge platforms.
Carole-Jean Wu, David Brooks 0001, Douglas Chen, Sy Choudhury, Marat Dukhan, Kim M. Hazelwood, Eldad Isaac, Yangqing Jia, Bill Jia, Tommer Leyvand, Yang Lu 0013, Lin Qiao, Brandon Reagen, Joe Spisak, Fei Sun 0002, Andrew Tulloch, Peter Vajda, Xiaodong Wang 0020, Yanghan Wang, Bram Wasti, Yiming Wu 0013, Ran Xian, Sungjoo Yoo, Peizhao Zhang
HPCA22