EDBT 2026 Demo / reviewers in the wild / expert
Zhiwei Ke
dblp:186/0673
· DBLP profile ↗
6ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0003-7636-2446ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Window-Diffusion: Accelerating Diffusion Language Model Inference with Windowed Token Pruning and Caching
Fengrui Zuo, Zhiwei Ke, Wenqi Lou, Lei Gong 0003, Chao Wang 0003, Xuehai Zhou |
APPT | 2 |
| 2026 | Two-Stage Hierarchy-Aware Learning with Gradient Conflict Mitigation for HLS Latency and Resource Prediction
Zhiwei Ke, Fengrui Zuo, Wenqi Lou, Chao Wang 0003, Xuehai Zhou |
Euro-Par (2) | 1 |
| 2026 | Realizable N:M Sparse Transformer Inference via Search-Kernel Co-design
Wenqi Lou, Zhiguang Wang, Zhiwei Ke, Fengrui Zuo, Chao Wang 0003, Xuehai Zhou |
Euro-Par (1) | 4 |
| 2023 | Deep Ensemble Robustness by Adaptive Sampling in Dropout-Based Simultaneous TrainingabstractRecent studies show that an ensemble of deep networks can have better adversarial robustness by increasing the deep feature learning diversity of base models to limit the adversarial transferability. However, existing schemes mostly rely on a second-order method for gradient regularization which usually involves a heavy computation overhead. In this paper, we propose a simple yet effective method which eliminates the use of a second-order optimization and significantly reduces the computation complexity of regularized simultaneous training of deep ensemble networks. For the first time, we show analytically that stochastic regularization by the proposed approach can promote both model smoothness and feature diversity of representation learning in the deep space. We also show that the proposed method is able to achieve a better gain of certified robustness. This is due to the effect of a prioritized feature selection enabled by an adaptive and continuous sampling of neuron activation among the base networks. Experimental results show that our method can improve adversarial robustness significantly comparing with the existing ensemble models on several image benchmark datasets. The ensemble performance can be further boosted by complementing the stochastic regularization approach with other defense paradigms such as adversarial training. Quanwei Wu, Bo Huang 0017, Yi Wang 0017, Zhiwei Ke |
ECAI | 4 |
| 2021 | Adversarial Defence by Diversified Simultaneous Training of Deep EnsemblesabstractLearning-based classifiers are susceptible to adversarial examples. Existing defence methods are mostly devised on individual classifiers. Recent studies showed that it is viable to increase adversarial robustness by promoting diversity over an ensemble of models. In this paper, we propose adversarial defence by encouraging ensemble diversity on learning high-level feature representations and gradient dispersion in simultaneous training of deep ensemble networks. We perform extensive evaluations under white-box and black-box attacks including transferred examples and adaptive attacks. Our approach achieves a significant gain of up to 52% in adversarial robustness, compared with the baseline and the state-of-the-art method on image benchmarks with complex data scenes. The proposed approach complements the defence paradigm of adversarial training, and can further boost the performance. The source code is available at https://github.com/ALIS-Lab/AAAI2021-PDD. Bo Huang 0017, Zhiwei Ke, Yi Wang 0017, Wei Wang 0011, LinLin Shen, Feng Liu 0013 |
AAAI | 2 |
| 2020 | Group-Wise Dynamic Dropout Based on Latent Semantic VariationsabstractDropout regularization has been widely used in various deep neural networks to combat overfitting. It works by training a network to be more robust on information-degraded data points for better generalization. Conventional dropout and variants are often applied to individual hidden units in a layer to break up co-adaptations of feature detectors. In this paper, we propose an adaptive dropout to reduce the co-adaptations in a group-wise manner by coarse semantic information to improve feature discriminability. In particular, we showed that adjusting the dropout probability based on local feature densities can not only improve the classification performance significantly but also enhance the network robustness against adversarial examples in some cases. The proposed approach was evaluated in comparison with the baseline and several state-of-the-art adaptive dropouts over four public datasets of Fashion-MNIST, CIFAR-10, CIFAR-100 and SVHN. Zhiwei Ke, Zhiwei Wen, Weicheng Xie 0001, Yi Wang 0017, LinLin Shen |
AAAI | 1 |