← Search

Hussein Hazimeh

9 accepted papers

2026

A Robust Optimization Guided Pruning Framework for Vision and Large Language Models

ICML 2026poster

Pruning is a common approach to reduce the memory footprint and inference cost of large vision and language models. As these architectures continue to scale, one-shot pruning methods - i.e. approaches that prune the network without any retraining - have become increasingly attractive. Many popular o…

Cited by 0SourceScholar
2025

Scaling Laws for Downstream Task Performance in Machine Translation

ICLR 2025poster

Scaling laws provide important insights that can guide the design of large language models (LLMs). Existing work has primarily focused on studying scaling laws for pretraining (upstream) loss. However, in transfer learning settings, in which LLMs are pretrained on an unsupervised dataset and then fi…

Cited by 2SourcePDFScholar
2024

OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization

ICML 2024poster

Structured pruning is a promising approach for reducing the inference costs of large vision and language models. By removing carefully chosen structures, e.g., neurons or attention heads, the improvements from this approach can be realized on standard deep learning hardware. In this work, we focus o…

2023

Benchmarking Robustness to Adversarial Image Obfuscations

NeurIPS 2023poster

Automated content filtering and moderation is an important tool that allows online platforms to build striving user communities that facilitate cooperation and prevent abuse. Unfortunately, resourceful actors try to bypass automated filters in a bid to post content that violate platform policies and…

2023

Fast as CHITA: Neural Network Pruning with Combinatorial Optimization

ICML 2023poster

The sheer size of modern neural networks makes model serving a serious computational challenge. A popular class of compression techniques overcomes this challenge by pruning or sparsifying the weights of pretrained networks. While useful, these techniques often face serious tradeoffs between computa…

2023

Mind the (optimality) Gap: A Gap-Aware Learning Rate Scheduler for Adversarial Nets

AISTATS 2023poster

Adversarial nets have proved to be powerful in various domains including generative modeling (GANs), transfer learning, and fairness. However, successfully training adversarial nets using first-order methods remains a major challenge. Typically, careful choices of the learning rates are needed to ma…

Cited by 2SourcePDFScholar
2021

DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning

NeurIPS 2021poster

The Mixture-of-Experts (MoE) architecture is showing promising results in improving parameter sharing in multi-task learning (MTL) and in scaling high-capacity neural networks. State-of-the-art MoE models use a trainable "sparse gate'" to select a subset of the experts for each input example. While…

2020

The Tree Ensemble Layer: Differentiability meets Conditional Computation

ICML 2020poster

Neural networks and tree ensembles are state-of-the-art learners, each with its unique statistical and computational advantages. We aim to combine these advantages by introducing a new layer for neural networks, composed of an ensemble of differentiable decision trees (a.k.a. soft trees). While diff…