2 citations · 5 across the 6 of their papers we have counts for
5 papers · 1 filter
High-Order Relation Construction and Mining for Graph Matching
Hui Xu, Liyao Xiang, Youmin Le +4
Graph matching pairs corresponding nodes across two or more graphs. The problem is difficult as it is hard to capture the structural similarity across graphs, especially on large g…
Certified Distributional Robustness on Smoothed Classifiers
Jungang Yang, Liyao Xiang, Ruidong Chen +3
The robustness of deep neural networks (DNNs) against adversarial example attacks has raised wide attention. For smoothed classifiers, we propose the worst-case adversarial loss ov…
Achieving Adversarial Robustness via Sparsity
Shufan Wang, Ningyi Liao, Liyao Xiang +2
Network pruning has been known to produce compact models without much accuracy degradation. However, how the pruning process affects a network's robustness and the working mechanis…
Rotation-Equivariant Neural Networks for Privacy Protection
Hao Zhang, Yiting Chen, Haotian Ma +5
In order to prevent leaking input information from intermediate-layer features, this paper proposes a method to revise the traditional neural network into the rotation-equivariant…
Deep Quaternion Features for Privacy Protection
Hao Zhang, Yiting Chen, Liyao Xiang +3
We propose a method to revise the neural network to construct the quaternion-valued neural network (QNN), in order to prevent intermediate-layer features from leaking input informa…