Alert button
Picture for Xiaoyun Wang

Xiaoyun Wang

Alert button

Deterministic End-to-End Transmission to Optimize the Network Efficiency and Quality of Service: A Paradigm Shift in 6G

Jul 02, 2023
Xiaoyun Wang, Shuangfeng Han, Zhiming Liu, Qixing Wang

Figure 1 for Deterministic End-to-End Transmission to Optimize the Network Efficiency and Quality of Service: A Paradigm Shift in 6G
Figure 2 for Deterministic End-to-End Transmission to Optimize the Network Efficiency and Quality of Service: A Paradigm Shift in 6G

Toward end-to-end mobile service provision with optimized network efficiency and quality of service, tremendous efforts have been devoted in upgrading mobile applications, transport and internet networks, and wireless communication networks for many years. However, the inherent loose coordination between different layers in the end-to-end communication networks leads to unreliable data transmission with uncontrollable packet delay and packet error rate, and a terrible waste of network resources incurred for data re-transmission. In an attempt to shed some lights on how to tackle these challenges, design methodologies and some solutions for deterministic end-to-end transmission for 6G and beyond are presented, which will bring a paradigm shift to the end-to-end wireless communication networks.

* 5 pages, 2 figures 
Viaarxiv icon

Network Architecture Design toward Convergence of Mobile Applications and Networks

Jun 15, 2023
Shuangfeng Han, Zhiming Liu, Tao Sun, Xiaoyun Wang

Figure 1 for Network Architecture Design toward Convergence of Mobile Applications and Networks
Figure 2 for Network Architecture Design toward Convergence of Mobile Applications and Networks
Figure 3 for Network Architecture Design toward Convergence of Mobile Applications and Networks
Figure 4 for Network Architecture Design toward Convergence of Mobile Applications and Networks

With the quick proliferation of extended reality (XR) services, the mobile communications networks are faced with gigantic challenges to meet the diversified and challenging service requirements. A tight coordination or even convergence of applications and mobile networks is highly motivated. In this paper, a multi-domain (e.g. application layer, transport layer, the core network, radio access network, user equipment) coordination scheme is first proposed, which facilitates a tight coordination between applications and networks based on the current 5G networks. Toward the convergence of applications and networks, a network architectures with cross-domain joint processing capability is further proposed for 6G mobile communications and beyond. Both designs are able to provide more accurate information of the quality of experience (QoE) and quality of service (QoS), thus paving the path for the joint optimization of applications and networks. The benefits of the QoE assisted scheduling are further investigated via simulations. A new QoE-oriented fairness metric is further proposed, which is capable of ensuring better fairness when different services are scheduled. Future research directions and their standardization impacts are also identified. Toward optimized end-to-end service provision, the paradigm shift from loosely coupled to converged design of applications and wireless communication networks is indispensable.

* 7 pages, 5 figures, IEEE communications magazine, under review 
Viaarxiv icon

Energy-based Out-of-distribution Detection

Oct 13, 2020
Weitang Liu, Xiaoyun Wang, John D. Owens, Yixuan Li

Figure 1 for Energy-based Out-of-distribution Detection
Figure 2 for Energy-based Out-of-distribution Detection
Figure 3 for Energy-based Out-of-distribution Detection
Figure 4 for Energy-based Out-of-distribution Detection

Determining whether inputs are out-of-distribution (OOD) is an essential building block for safely deploying machine learning models in the open world. However, previous methods relying on the softmax confidence score suffer from overconfident posterior distributions for OOD data. We propose a unified framework for OOD detection that uses an energy score. We show that energy scores better distinguish in- and out-of-distribution samples than the traditional approach using the softmax scores. Unlike softmax confidence scores, energy scores are theoretically aligned with the probability density of the inputs and are less susceptible to the overconfidence issue. Within this framework, energy can be flexibly used as a scoring function for any pre-trained neural classifier as well as a trainable cost function to shape the energy surface explicitly for OOD detection. On a CIFAR-10 pre-trained WideResNet, using the energy score reduces the average FPR (at TPR 95%) by 18.03% compared to the softmax confidence score. With energy-based training, our method outperforms the state-of-the-art on common benchmarks.

Viaarxiv icon

GraphDefense: Towards Robust Graph Convolutional Networks

Nov 11, 2019
Xiaoyun Wang, Xuanqing Liu, Cho-Jui Hsieh

Figure 1 for GraphDefense: Towards Robust Graph Convolutional Networks
Figure 2 for GraphDefense: Towards Robust Graph Convolutional Networks
Figure 3 for GraphDefense: Towards Robust Graph Convolutional Networks
Figure 4 for GraphDefense: Towards Robust Graph Convolutional Networks

In this paper, we study the robustness of graph convolutional networks (GCNs). Despite the good performance of GCNs on graph semi-supervised learning tasks, previous works have shown that the original GCNs are very unstable to adversarial perturbations. In particular, we can observe a severe performance degradation by slightly changing the graph adjacency matrix or the features of a few nodes, making it unsuitable for security-critical applications. Inspired by the previous works on adversarial defense for deep neural networks, and especially adversarial training algorithm, we propose a method called GraphDefense to defend against the adversarial perturbations. In addition, for our defense method, we could still maintain semi-supervised learning settings, without a large label rate. We also show that adversarial training in features is equivalent to adversarial training for edges with a small perturbation. Our experiments show that the proposed defense methods successfully increase the robustness of Graph Convolutional Networks. Furthermore, we show that with careful design, our proposed algorithm can scale to large graphs, such as Reddit dataset.

Viaarxiv icon

Attack Graph Convolutional Networks by Adding Fake Nodes

Oct 26, 2018
Xiaoyun Wang, Joe Eaton, Cho-Jui Hsieh, Felix Wu

Figure 1 for Attack Graph Convolutional Networks by Adding Fake Nodes
Figure 2 for Attack Graph Convolutional Networks by Adding Fake Nodes
Figure 3 for Attack Graph Convolutional Networks by Adding Fake Nodes
Figure 4 for Attack Graph Convolutional Networks by Adding Fake Nodes

Graph convolutional networks (GCNs) have been widely used for classifying graph nodes in the semi-supervised setting. Previous work have shown that GCNs are vulnerable to the perturbation on adjacency and feature matrices of existing nodes. However, it is unrealistic to change existing nodes in many applications, such as existing users in social networks. In this paper, we design algorithms to attack GCNs by adding fake nodes. A greedy algorithm is proposed to generate adjacency and feature matrices of fake nodes, aiming to minimize the classification accuracy on the existing nodes. In additional, we introduce a discriminator to classify fake nodes from real nodes, and propose a Greedy-GAN attack to simultaneously update the discriminator and the attacker, to make fake nodes indistinguishable to the real ones. Our non-targeted attack decreases the accuracy of GCN down to 0.10, and our targeted attack reaches a success rate of 99% on the whole datasets, and 94% on average for attacking a single target node.

Viaarxiv icon