← Search

Mostafa Elhoushi

13 accepted papers

2026

Don't Drop Dropout: Optimizing Layer Sparsity for Efficient LLM Training and Inference

ICML 2026poster

Layer dropout (a.k.a.\ stochastic depth) has been shown to enable faster training, higher accuracy, and robustness to zero-shot layer pruning in both language and vision transformers. However, as models and datasets have scaled, dropout---particularly layer dropout---has largely disappeared from LLM…

Cited by 0SourceScholar
2026

How Text Quality Interventions Reshape Neural Scaling Laws for LLMs: Empirical Study

ICLR 2026poster

Neural scaling laws are widely used for performance projection and resource planning, yet their sensitivity to data quality interventions remains poorly understood. We present an empirical study of how interventions—deduplication, heuristic filtering, and LLM-guided rewriting—reshape scaling behavi…

Cited by 0SourceScholar
2025

CATransformers: Carbon Aware Transformers Through Joint Model-Hardware Optimization

NeurIPS 2025poster

Machine learning solutions are rapidly adopted to enable a variety of key use cases, from conversational AI assistants to scientific discovery. As the adoption of machine learning models becomes increasingly prevalent, the associated lifecycle carbon footprint is expected to increase, including both…

Cited by 0SourcecodeScholar
2025

Demystifying Synthetic Data in LLM Pre-training: A Systematic Study of Scaling Laws, Benefits, and Pitfalls

EMNLP 2025

Training data plays a crucial role in Large Language Models (LLM) scaling, yet high quality data is of limited supply. Synthetic data techniques offer a potential path toward sidestepping these limitations.We conduct a large-scale empirical investigation (>1000 LLMs with >100k GPU hours) using a uni

2024

AST-T5: Structure-Aware Pretraining for Code Generation and Understanding

ICML 2024poster

Large language models (LLMs) have made significant advancements in code-related tasks, yet many LLMs treat code as simple sequences, neglecting its structured nature. We introduce AST-T5, a novel pretraining paradigm that leverages the Abstract Syntax Tree (AST) for enhanced code generation, transpi…

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

Evaluation of LLMs on Syntax-Aware Code Fill-in-the-Middle Tasks

ICML 2024oral

We introduce **S**yntax-**A**ware **F**ill-**i**n-the-**M**iddle (SAFIM), a new benchmark for evaluating Large Language Models (LLMs) on the code Fill-in-the-Middle (FIM) task. This benchmark focuses on syntax-aware completions of program structures such as code blocks and conditional expressions, a…

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…

2024

Sieve: Multimodal Dataset Pruning using Image Captioning Models

CVPR 2024poster

Vision-Language Models (VLMs) are pretrained on large diverse and noisy web-crawled datasets. This underscores the critical need for dataset pruning as the quality of these datasets is strongly correlated with the performance of VLMs on downstream tasks. Using CLIPScore from a pretrained model to on…

2023

Learning Compiler Pass Orders using Coreset and Normalized Value Prediction

ICML 2023poster

Finding the optimal pass sequence of compilation can lead to a significant reduction in program size. Prior works on compilation pass ordering have two major drawbacks. They either require an excessive budget (in terms of the number of compilation passes) at compile time or fail to generalize to uns…

2022

Fire Together Wire Together: A Dynamic Pruning Approach With Self-Supervised Mask Prediction

CVPR 2022poster

Dynamic model pruning is a recent direction that allows for the inference of a different sub-network for each input sample during deployment. However, current dynamic methods rely on learning a continuous channel gating through regularization by inducing sparsity loss. This formulation introduces co…

Cited by 45PDFcodeScholar