← Search

Shupeng Gui

6 accepted papers

2021

UMEC: Unified model and embedding compression for efficient recommendation systems

ICLR 2021poster

The recommendation system (RS) plays an important role in the content recommendation and retrieval scenarios. The core part of the system is the Ranking neural network, which is usually a bottleneck of whole system performance during online inference. In this work, we propose a unified model and em…

2020

Automatic Neural Network Compression by Sparsity-Quantization Joint Learning: A Constrained Optimization-Based Approach

CVPR 2020poster

Deep Neural Networks (DNNs) are applied in a wide range of usecases. There is an increased demand for deploying DNNs on devices that do not have abundant resources such as memory and computation units. Recently, network compression through a variety of techniques such as pruning and quantization hav…

Cited by 76PDFScholar
2020

GAN Slimming: All-in-One GAN Compression by A Unified Optimization Framework

ECCV 2020poster

Generative adversarial networks (GANs) have gained increasing popularity in various computer vision applications, and recently start to be deployed to resource-constrained mobile devices. Similar to other deep models, state-of-the-art GANs also suffer from high parameter complexities. That has recen…

2020

Once-for-All Adversarial Training: In-Situ Tradeoff between Robustness and Accuracy for Free

NeurIPS 2020poster

Adversarial training and its many variants substantially improve deep network robustness, yet at the cost of compromising standard accuracy. Moreover, the training process is heavy and hence it becomes impractical to thoroughly explore the trade-off between accuracy and robustness. This paper asks t…

2019

Model Compression with Adversarial Robustness: A Unified Optimization Framework

NeurIPS 2019poster

Deep model compression has been extensively studied, and state-of-the-art methods can now achieve high compression ratios with minimal accuracy loss. This paper studies model compression through a different lens: could we compress models without hurting their robustness to adversarial attacks, in ad…

2017

On The Projection Operator to A Three-view Cardinality Constrained Set

ICML 2017poster

The cardinality constraint is an intrinsic way to restrict the solution structure in many domains, for example, sparse learning, feature selection, and compressed sensing. To solve a cardinality constrained problem, the key challenge is to solve the projection onto the cardinality constraint set, wh…

Cited by 0SourcePDFScholar