activity
20172023
most citedData Decisions and Theoretical Implications when Adversarially Learning Fair Representations

299 citations · 942 across the 23 of their papers we have counts for

collaborators
Showing cs.LGShow all

13 papers · 1 filter

cs.LG2023★ 2 cited

COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Search

Shibal Ibrahim, Wenyu Chen, Hussein Hazimeh +3

The sparse Mixture-of-Experts (Sparse-MoE) framework efficiently scales up model capacity in various domains, such as natural language processing and vision. Sparse-MoEs select a s…

cs.LG2023★ 1 cited

Edge-free but Structure-aware: Prototype-Guided Knowledge Distillation from GNNs to MLPs

Taiqiang Wu, Zhe Zhao, Jiahao Wang +4

Distilling high-accuracy Graph Neural Networks (GNNs) to low-latency multilayer perceptions (MLPs) on graph tasks has become a hot research topic. However, conventional MLP learnin…

cs.LG2023★ 3 cited

Fast as CHITA: Neural Network Pruning with Combinatorial Optimization

Riade Benbaki, Wenyu Chen, Xiang Meng +4

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

cs.LG2022★ 2 cited

SAMP: A Model Inference Toolkit of Post-Training Quantization for Text Processing via Self-Adaptive Mixed-Precision

Rong Tian, Zijing Zhao, Weijie Liu +4

The latest industrial inference engines, such as FasterTransformer and TurboTransformers, have verified that half-precision floating point (FP16) and 8-bit integer (INT8) quantizat…

cs.LG2022★ 13 cited

Improving Multi-Task Generalization via Regularizing Spurious Correlation

Ziniu Hu, Zhe Zhao, Xinyang Yi +4

Multi-Task Learning (MTL) is a powerful learning paradigm to improve generalization performance via knowledge sharing. However, existing studies find that MTL could sometimes hurt…

cs.LG2021★ 29 cited

Efficiently Identifying Task Groupings for Multi-Task Learning

Christopher Fifty, Ehsan Amid, Zhe Zhao +3

Multi-task learning can leverage information learned by one task to benefit the training of other tasks. Despite this capacity, naively training all tasks together in one model oft…

cs.LG2021★ 8 cited

The Benchmark Lottery

Mostafa Dehghani, Yi Tay, Alexey A. Gritsenko +5

The world of empirical machine learning (ML) strongly relies on benchmarks in order to determine the relative effectiveness of different algorithms and methods. This paper proposes…

cs.LG2021★ 16 cited

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

Hussein Hazimeh, Zhe Zhao, Aakanksha Chowdhery +5

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. Sta…

cs.LG2020★ 7 cited

Measuring and Harnessing Transference in Multi-Task Learning

Christopher Fifty, Ehsan Amid, Zhe Zhao +3

Multi-task learning can leverage information learned by one task to benefit the training of other tasks. Despite this capacity, naive formulations often degrade performance and in…

cs.LG2020★ 6 cited

Small Towers Make Big Differences

Yuyan Wang, Zhe Zhao, Bo Dai +4

Multi-task learning aims at solving multiple machine learning tasks at the same time. A good solution to a multi-task learning problem should be generalizable in addition to being…

cs.LG2020★ 3 cited

Learning-to-Rank with Partitioned Preference: Fast Estimation for the Plackett-Luce Model

Jiaqi Ma, Xinyang Yi, Weijing Tang +4

We investigate the Plackett-Luce (PL) model based listwise learning-to-rank (LTR) on data with partitioned preference, where a set of items are sliced into ordered and disjoint par…

cs.LG2020★ 87 cited

Understanding and Improving Knowledge Distillation

Jiaxi Tang, Rakesh Shivanna, Zhe Zhao +4

Knowledge Distillation (KD) is a model-agnostic technique to improve model quality while having a fixed capacity budget. It is a commonly used technique for model compression, wher…

cs.LG2017★ 299 cited

Data Decisions and Theoretical Implications when Adversarially Learning Fair Representations

Alex Beutel, Jilin Chen, Zhe Zhao +1

How can we learn a classifier that is "fair" for a protected or sensitive group, when we do not know if the input to the classifier belongs to the protected group? How can we train…