← Search

Saurabh Agarwal

7 accepted papers

2025

Everything Everywhere All at Once: LLMs can In-Context Learn Multiple Tasks in Superposition

ICML 2025spotlight

Large Language Models (LLMs) have demonstrated remarkable in-context learning (ICL) capabilities. In this study, we explore a surprising phenomenon related to ICL: LLMs can perform multiple, computationally distinct ICL tasks simultaneously, during a single inference call, a capability we term task…

Cited by 3SourcePDFScholar
2025

StitchLLM: Serving LLMs, One Block at a Time

ACL 2025long

The rapid evolution of large language models (LLMs) has revolutionized natural language processing (NLP) tasks such as text generation, translation, and comprehension. However, the increasing computational demands and inference costs of these models present significant challenges. This study investi…

Cited by 0SourcePDFScholar
2024

CHAI: Clustered Head Attention for Efficient LLM Inference

ICML 2024poster

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 atte…

2024

LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding

ACL 2024long

We present LayerSkip, an end-to-end solution to speed-up inference of large language models (LLMs). First, during training we apply layer dropout, with low dropout rates for earlier layers and higher dropout rates for later layers, and an early exit loss where all transformer layers share the same e…

2020

Attack of the Tails: Yes, You Really Can Backdoor Federated Learning

NeurIPS 2020poster

Due to its decentralized nature, Federated Learning (FL) lends itself to adversarial attacks in the form of backdoors during training. The goal of a backdoor is to corrupt the performance of the trained model on specific sub-tasks (e.g., by classifying green cars as frogs). A range of FL backdoor at…

2020

Regularized Graph Convolutional Networks for Short Text Classification

COLING 2020industry

Short text classification is a fundamental problem in natural language processing, social network analysis, and e-commerce. The lack of structure in short text sequences limits the success of popular NLP methods based on deep learning. Simpler methods that rely on bag-of-words representations tend t…

Cited by 14SourcePDFScholar