Zhiyang Wang

Zhiyang Wang

Auto-generated profile, based on publicly available information

Zhiyang Wang

Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 March 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ZWZhiyang Wang
Zhiyang Wang
MEMark Eisen
Mark Eisen
ARAlejandro Ribeiro
Alejandro Ribeiro
We consider the broad class of decentralized optimal resource allocation problems in wireless networks, which can be formulated as a constrained statistical learning problems with a localized information structure. We develop the use of Aggregation Graph Neural Networks (Agg-GNNs), which process a sequence of delayed and potentially asynchronous graph aggregated state information obtained locally at each transmitter from multi-hop neighbors. We further utilize model-free primal-dual learning methods to optimize performance subject to constraints in the presence of delay and asynchrony inherent to decentralized networks. We demonstrate a permutation equivariance property of the resulting resource allocation policy that can be shown to facilitate transference to dynamic network configurations. The proposed framework is validated with numerical simulations that exhibit superior performance to baseline strategies.

20 March 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
CBClaudio Battiloro
Claudio Battiloro
ZWZhiyang Wang
Zhiyang Wang
HRHans Riess
Hans Riess
PLPaolo Di Lorenzo
Paolo Di Lorenzo
ARAlejandro Ribeiro
Alejandro Ribeiro
In this work we introduce a convolution operation over the tangent bundle of Riemann manifolds in terms of exponentials of the Connection Laplacian operator. We define tangent bundle filters and tangent bundle neural networks (TNNs) based on this convolution operation, which are novel continuous architectures operating on tangent bundle signals, i.e. vector fields over the manifolds. Tangent bundle filters admit a spectral representation that generalizes the ones of scalar manifold filters, graph filters and standard convolutional filters in continuous time. We then introduce a discretization procedure, both in the space and time domains, to make TNNs implementable, showing that their discrete counterpart is a novel principled variant of the very recently introduced sheaf neural networks. We formally prove that this discretized architecture converges to the underlying continuous TNN. Finally, we numerically evaluate the effectiveness of the proposed architecture on various learning tasks, both on synthetic and real data, comparing it against other state-of-the-art and benchmark architectures.

25 April 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ZWZhiyang Wang
Zhiyang Wang
LRLuana Ruiz
Luana Ruiz
ARAlejandro Ribeiro
Alejandro Ribeiro
This paper studies the relationship between a graph neural network (GNN) and a manifold neural network (MNN) when the graph is constructed from a set of points sampled from the manifold, thus encoding geometric information. We consider convolutional MNNs and GNNs where the manifold and the graph convolutions are respectively defined in terms of the Laplace-Beltrami operator and the graph Laplacian. Using the appropriate kernels, we analyze both dense and moderately sparse graphs. We prove non-asymptotic error bounds showing that convolutional filters and neural networks on these graphs converge to convolutional filters and neural networks on the continuous manifold. As a byproduct of this analysis, we observe an important trade-off between the discriminability of graph filters and their ability to approximate the desired behavior of manifold filters. We then discuss how this trade-off is ameliorated in neural networks due to the frequency mixing property of nonlinearities. We further derive a transferability corollary for geometric graphs sampled from the same manifold. We validate our results numerically on a navigation control problem and a point cloud classification task.

22 September 2023 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
APAlejandro Parada-Mayorga
Alejandro Parada-Mayorga
ZWZhiyang Wang
Zhiyang Wang
ARAlejandro Ribeiro
Alejandro Ribeiro
In this paper we propose a pooling approach for convolutional information processing on graphs relying on the theory of graphons and limits of dense graph sequences. We present three methods that exploit the induced graphon representation of graphs and graph signals on partitions of [0, 1] 2 in the graphon space. As a result we derive low dimensional representations of the convolutional operators, while a dimensionality reduction of the signals is achieved by simple local interpolation of functions in L 2 ([0, 1]). We prove that those low dimensional representations constitute a convergent sequence of graphs and graph signals, respectively. The methods proposed and the theoretical guarantees that we provide show that the reduced graphs and signals inherit spectral-structural properties of the original quantities. We evaluate our approach with a set of numerical experiments performed on graph neural networks (GNNs) that rely on graphon pooling. We observe that graphon pooling performs significantly better than other approaches proposed in the literature when dimensionality reduction ratios between layers are large. We also observe that when graphon pooling is used we have, in general, less overfitting and lower computational cost.

19 March 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ZWZhiyang Wang
Zhiyang Wang
LRLuana Ruiz
Luana Ruiz
ARAlejandro Ribeiro
Alejandro Ribeiro
The paper defines and studies manifold (M) convolutional filters and neural networks (NNs). Manifold filters and MNNs are defined in terms of the Laplace-Beltrami operator exponential and are such that graph (G) filters and neural networks (NNs) are recovered as discrete approximations when the manifold is sampled. These filters admit a spectral representation which is a generalization of both the spectral representation of graph filters and the frequency response of standard convolutional filters in continuous time. The main technical contribution of the paper is to analyze the stability of manifold filters and MNNs to smooth deformations of the manifold. This analysis generalizes known stability properties of graph filters and GNNs and it is also a generalization of known stability properties of standard convolutional filters and neural networks in continuous time. The most important observation that follows from this analysis is that manifold filters, same as graph filters and standard continuous time filters, have difficulty discriminating high frequency components in the presence of deformations. This is a challenge that can be ameliorated with the use of manifold, graph, or continuous time neural networks. The most important practical consequence of this analysis is to shed light on the behavior of graph filters and GNNs in large scale graphs.

12 December 2023 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
APAlejandro Parada-Mayorga
Alejandro Parada-Mayorga
ZWZhiyang Wang
Zhiyang Wang
FGFernando Gama
Fernando Gama
ARAlejandro Ribeiro
Alejandro Ribeiro
In this paper we study the stability properties of aggregation graph neural networks (Agg-GNNs) considering perturbations of the underlying graph. An Agg-GNN is a hybrid architecture where information is defined on the nodes of a graph, but it is processed block-wise by Euclidean CNNs on the nodes after several diffusions on the graph shift operator. We derive stability bounds for the mapping operator associated to a generic Agg-GNN, and we specify conditions under which such operators can be stable to deformations. We prove that the stability bounds are defined by the properties of the filters in the first layer of the CNN that acts on each node. Additionally, we show that there is a close relationship between the number of aggregations, the filter's selectivity, and the size of the stability constants. We also conclude that in Agg-GNNs the selectivity of the mapping operators can be limited by the stability restrictions imposed on the first layer of the CNN stage, but this is compensated by the pointwise nonlinearities and filters in subsequent layers which are not subject to any restriction. This shows a substantial difference with respect to the stability properties of selection GNNs, where the selectivity of the filters in all layers is constrained by their stability. We provide numerical evidence corroborating the results derived, testing the behavior of Agg-GNNs in real life application scenarios considering perturbations of different magnitude.