The 9th EMC2 - Energy Efficient Machine Learning and Cognitive Computing

Welcome and Opening Remarks

Satyam Srivastava, d-Matrix

Dense-and-Sparse Quantization Methods for Efficient LLM Serving

Amir Gholami, UC Berkeley link

Slides Video
The availability of unprecedented unsupervised training data, along with neural scaling laws, has resulted in an unprecedented surge in model size and compute requirements for serving/training LLMs. However, the main performance bottleneck for serving these models is increasingly shifting to memory bandwidth rather than compute. While quantization has emerged as a promising solution by representing model weights with reduced precision, previous efforts have often resulted in notable performance degradation. To address this, I will discuss our on-going work on a new type of quantization scheme called dense-and-sparse quantization which enables lossless compression to ultra-low precisions of up to 2-bit, while achieving state-of-the-art accuracy. Dense-and-sparse quantization allows this by decomposing the parameters and KVCache values into two components: a sparse component that includes outliers and sensitive values in the network, along with a dense component which is amenable to low precision compression. This allows us to achieve lossless compression for model parameters down to 3 bits, as well as down to 2-bits for compressing KV Cache values enabling serving a LLaMA-7B model on a single A100 GPU even with a context length of 1M token length.

Hardware-aware Algorithms for Language Modeling

Tri Dao, Princeton University link

Slides Video
Transformers are slow and memory-hungry on long sequences, since the time and memory complexity of self-attention are quadratic in sequence length. In the first half, we describe FlashAttention, a fast and memory-efficient exact attention algorithm. By making attention algorithms IO-aware (accounting for reads and writes between levels of GPU memory) FlashAttention is 4-8x faster than optimized baselines, enabling 4-16x longer context in Transformers and yielding higher quality models. We will also describe optimizations for long-context LLM inference, leading to 2-8x faster end-to-end inference time. In the second half, we focus on subquadratic-time architectures such structured state space models (SSMs). We identify that a key weakness of such models is their inability to perform content-based reasoning, and propose a selection mechanism to address this shortcoming. Though this change prevents the use of efficient convolutions, we design a hardware-aware parallel algorithm in recurrent mode. We integrate these selective SSMs into a simplified end-to-end neural network architecture without attention or even MLP blocks. The resulting Mamba architecture matches or exceeds the performance of strong modern Transformers on language modeling, validated at 1B and 3B scales on both pretraining and downstream evaluation, while enjoying 5x higher inference throughput and linear scaling in sequence length.

Towards Greener LLMs: Bringing Energy-Efficiency to the Forefront of LLM Inference

Jovan Stojkovic, Esha Choukse, Chaojie Zhang, Inigo Goiri, Josep Torrellas

Demystifying Neuro-Symbolic AI via Workload Characterization and Cross-Layer Co-Design

Zishen Wan

Is Flash Attention Stable?

Alicia Golden, Samuel Hsia, Fei Sun, Bilge Acun, Basil Hosmer, Yejin Lee, Zachary DeVito, Jeff Johnson, Gu-Yeon Wei, David Brooks, Carole-Jean Wu

Break/Q&A

Embracing Machine Learning for the Next Generation of Domain Specific Accelerators

Amir Yazdanbakhsh, Google Deepmind link

Slides Video
In recent years, computer architecture research has been enriched by the advent of machine learning (ML) techniques. In this talk, we will discuss the interplay between ML and designing domain specific architectures. Then, we will delve into the synergies between these two domains, highlighting their collaborative potential to advance design of computer systems. We will explore the diverse range of opportunities that ML affords for optimizing various aspects across the entire compute stack, from algorithmic to system-level optimization. Furthermore, we will embark on a journey towards Architecture 2.0, envisioning a future where ML-assisted architecture research takes center stage. This discussion will emphasize the importance of nurturing and fostering a community that embraces data-driven solutions in computer architecture design.

Put LLMs on device? Challenges and new opportunities

Zechun Liu, Meta Reality Labs link

Slides Video
Large language models (LLMs) are permeating various facets of human life, influencing not only communication and work but also shaping everyday entertainment experiences. Due to limitations in memory size and computational cost, there is an increasing demand to deploy LLM on smartphones and mobile devices. To address these challenges, a new research direction has emerged that focuses on downsizing LLMs for on-device inference. This includes techniques such as model compression, deployment acceleration, small model design, etc. In this talk, we will discuss the constraints and solutions for optimizing models in on-device use cases as well as practical methods for LLM quantization.

Rapid LLM deployments: with great power comes great responsibility

Esha Choukse, Microsoft Research link

Slides Video
With the ubiquitous use-cases of modern LLMs, the deployment scale of these models is unforeseen. This has led to a large-scale datacenter expansion with GPUs, currently running into an energy wall worldwide. This talk will focus on the properties of generative LLMs that can be used to make the deployment of these models more power-efficient. The talk will also introduce POLCA and Splitwise, two techniques to reduce the power consumption for the LLM serving.

Sponsor Talk by d-Matrix

Sree Ganesan, VP Product, d-Matrix link

Slides Video

Poster Session / Lunch Break

Efficient and Effective Methods for Mixed Precision Neural Network Quantization for Faster, Energy-efficient Inference

Deepika Bablani, Jeffrey McKinstry, Steven Esser, Rathinakumar Appuswamy, Dharmendra Modha

Accurate Block Quantization in LLMs with Outliers

Ilya Soloveychik, Nikita Trukhanov

Efficient Multi-modal LLM

Song Han, MIT, NVIDIA link

Slides Video
This talk presents efficient multi-modal LLM innovations and system implementations. I’ll first present VILA, a visual language model pre-training recipe beyond visual instruction tuning, enabling multi-image reasoning and in-context learning. Followed by SmoothQuant and AWQ for LLM quantization, and the TinyChat inference library. AWQ and TinyChat enable VILA 2.7B deployable on Jetson Orin Nano, bringing new opportunities for mobile vision applications. Second, I’ll present efficient representation learning, including EfficientViT for high-resolution vision, accelerating SAM by 48x without performance loss; and condition-aware neural networks(CAN), a novel way to add control to diffusion models. Third, I’ll present StreamingLLM, a KV cache optimization technique for long conversation and LongLoRA, using sparse, shifted attention for long-context LLM. Finally, I’ll present PockEngine for efficient LLM fine-tuning. Many of these techniques have been incorporated into NVIDIA’s large language model optimization library, TensorRT-LLM.

The Path to AGI: Directions and Challenges

Video
Recent advances in AI has profoundly affected our perception of the technology. Not only are there domains where AI has reached superhuman performance levels, it is also starting to influence our interaction with machines (courtesy of LLMs).At the same time, observations of emergent properties has excited many in the community as a potential existence proof of future AGI. How and when we get there is an open question though. In this panel we discuss the various elements across algorithm innovation, computing infrastructure, training and data generation, even ethics and governance that need to come together for us to create truly intelligent systems.

Moderator: Raj Parihar

Hadi S. Esmaeilzadeh, UCSD

Amir Yazdanbakhsh, Google

Tatiana Shpeisman, Modular

Hyoukjun Kwon, UCI

Sree Ganesan, d-Matrix

Break

Neural Networks are not Matrix Multiplications

Hadi S. Esmaeilzadeh, UCSD link

Slides Video
With the ever-increasing prevalence of neural networks and language models, it is time to rethink neural acceleration. Past research has focused disproportionately on General Matrix Multiplication (GEMM) operations, assuming they dominate neural computations. However, non-GEMM operations have grown in diversity and complexity, interweaving with GEMM. Conventional Neural Processing Units (NPUs) have taken simplistic approaches to handling these operations. In this talk, I will discuss our most recent work that challenges the conventional wisdom in neural accelerator design and explores the architecture of a specialized “Tandem Processor” that complements the GEMM unit. The Tandem Processor is specialized for memory access logic with a novel Instruction Set Architecture (ISA) and microarchitecture that alleviates the register file, while offering programmability at the mathematical level for non-GEMM layers. This balances specialization and programmability, sustaining the throughput and utilization of the neural accelerator. We provide the Register Transfer Level (RTL) code that is synthesizable both for Field-Programmable Gate Array (FPGA) and Application-Specific Integrated Circuit (ASIC) implementations in addition to the associated compiler as part of the open-source GeneSys initiative (https://actlab-genesys.github.io/). Tandem and GeneSys are the result of more than a decade of pioneering work in NPU design and open-sourcing accelerators.

Efficient AI Programming with Mojo and Max

Tatiana Shpeisman, Modular link

Slides Video
As AI grows in its capabilities and ubiquity, it becomes increasingly important to improve efficiency of AI applications. At the same time, developing and deploying new applications requires the ability to quickly iterate on the design and have flexibility to modify it as required by the deployment scenario. In this talk, we will describe how Mojo and Modular MAX platform help to achieve this goal. We will give a brief overview of Mojo and MAX and illustrate by example how AI programmers can benefit from Max and its extensibility via Mojo.

CHAI: Clustered Head Attention for Efficient LLM Inference

Bilge Acun, Meta link

Slides Video
Large Language Models (LLMs) with hundreds of billions of parameters have transformed the field of machine learning. However, serving these models at inference time is both compute and memory intensive, where a single request can require multiple GPUs and tens of Gigabytes of memory. Multi-Head Attention is one of the key components of LLMs, which can account for over 50% of LLMs memory and compute requirement. We observe that there is a high amount of redundancy across heads on which tokens they pay attention to. Based on this insight, we propose Clustered Head Attention (CHAI). CHAI combines heads with a high amount of correlation for self-attention at runtime, thus reducing both memory and compute. In our experiments, we show that CHAI is able to reduce the memory requirements for storing K,V cache by up to 21.4% and inference time latency by up to 1.73x without any fine-tuning required. CHAI achieves this with a maximum 3.2% deviation in accuracy across 3 different models (i.e. OPT-66B, LLAMA-7B, LLAMA-33B) and 5 different evaluation datasets.

Teaching LLMs to Use Tools at Scale

Shishir Patil, UC Berkeley link

Slides Video
In this talk, we will explore our innovative approach to integrating Large Language Models (LLMs) with various tools via APIs. Bridging LLMs with APIs presents a significant challenge, primarily because of the models’ struggles to generate precise input arguments and their propensity to hallucinate API calls. Gorilla LLM, trained with our novel Retriever-Aware-Training (RAT), surpasses the performance of all open-sourced LLMs on writing API calls. Gorilla presents a novel PL-inspired metric to measure hallucination, commonly encountered in LLMs. Gorilla is an open-source project having served hundreds of thousand user requests, with enterprise adoption, and an energetic community supporting it. We’ll also spotlight the Berkeley Function Calling Leaderboard to evaluate an LLM’s ability to call functions (tools) accurately. We’ll conclude with our learnings from our deployment experiences, and present open research questions to enable wider integration of LLMs in applications.

Closing Remarks

Sushant Kondguli, Meta