collaborators

16 papers

cs.CL2026

Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization

Palaash Goel, Ayan Sengupta, Akshay Nambi +1

Structured pruning is a promising approach for compressing large language models (LLMs), yet existing methods rely heavily on greedy heuristics that produce myopic decisions, and o…

cs.CL2026

It Takes a MAESTRO To Prune Bad Experts

Palaash Goel, Ayush Maheshwari, Tanmoy Chakraborty

Sparsely-activated Mixture-of-Experts (MoE) language models achieve remarkable inference efficiency by activating only a small fraction of parameters per token, yet their full expe…

cs.CL2026

Exposing Long-Tail Safety Failures in Large Language Models through Efficient Diverse Response Sampling

Suvadeep Hajra, Palash Nandi, Tanmoy Chakraborty

Safety tuning through supervised fine-tuning and reinforcement learning from human feedback has substantially improved the robustness of large language models. However, it typicall…

cs.CL2026

From Images to Words: Efficient Cross-Modal Knowledge Distillation to Language Models from Black-box Teachers

Ayan Sengupta, Shantanu Dixit, Md Shad Akhtar +1

Knowledge distillation (KD) methods are pivotal in compressing large pre-trained language models into smaller models, ensuring computational efficiency without significantly droppi…

cs.CL2025

The Art of Scaling Test-Time Compute for Large Language Models

Aradhye Agarwal, Ayan Sengupta, Tanmoy Chakraborty

Test-time scaling (TTS) -- the dynamic allocation of compute during inference -- is a promising direction for improving reasoning in large language models (LLMs). However, a system…

cs.CL2025

Value-Guided KV Compression for LLMs via Approximated CUR Decomposition

Ayan Sengupta, Siddhant Chaudhary, Tanmoy Chakraborty

Key-value (KV) cache compression has emerged as a critical technique for reducing the memory and latency overhead of autoregressive language models during inference. Prior approach…