Search Results for author:
Found 7 papers, 3 papers with code
Differentiable Search for Finding Optimal Quantization Strategy
To solve the issue, in this paper, we propose a differentiable quantization strategy search (DQSS) to assign optimal quantization strategy for individual layer by taking advantages of the benefits of different quantization algorithms.
SparseByteNN: A Novel Mobile Inference Acceleration Framework Based on Fine-Grained Group Sparsity
Our framework consists of two parts: (a) A fine-grained kernel sparsity schema with a sparsity granularity between structured pruning and unstructured pruning.
Privacy-preserving Online AutoML for Domain-Specific Face Detection
Thanks to HyperFD, each local task (client) is able to effectively leverage the learning "experience" of previous tasks without uploading raw images to the platform; meanwhile, the meta-feature extractor is continuously learned to better trade off the bias and variance.
Learning to Rank Ace Neural Architectures via Normalized Discounted Cumulative Gain
One of the key challenges in Neural Architecture Search (NAS) is to efficiently rank the performances of architectures.
PAMS: Quantized Super-Resolution via Parameterized Max Scale
Specifically, most state-of-the-art SR models without batch normalization have a large dynamic quantization range, which also serves as another cause of performance drop.
Interpretable Neural Network Decoupling
More specifically, we introduce a novel architecture controlling module in each layer to encode the network architecture by a vector.
Towards Optimal Structured CNN Pruning via Generative Adversarial Learning
In this paper, we propose an effective structured pruning approach that jointly prunes filters as well as other structures in an end-to-end manner.
