21 accepted papers
Semantic communication, rather than on a bit-by-bit recovery of the transmitted messages, focuses on the meaning and the goal of the communication itself. In this paper, we propose a novel semantic image coding scheme that preserves the semantic content of an image, while ensuring a good trade-off b…
In this work, we study the problem of stability of Graph Convolutional Neural Networks (GCNs) under random small perturbations in the underlying graph topology, i.e. under a limited number of insertions or deletions of edges. We derive a novel bound on the expected difference between the outputs of…
Weighing the topological domain over which data can be represented and analysed is a key strategy in many signal processing and machine learning applications, enabling the extraction and exploitation of meaningful data features and their (higher order) relationships. Our goal in this paper is to pre…
This paper introduces topological Slepians, i.e., a novel class of signals defined over topological spaces (e.g., simplicial complexes) that are maximally concentrated on the topological domain (e.g., over a set of nodes, edges, triangles, etc.) and perfectly localized on the dual domain (e.g., a se…
The aim of this work is to propose a novel dynamic resource allocation strategy for adaptive Federated Learning (FL), in the context of beyond 5G networks endowed with Reconfigurable Intelligent Surfaces (RISs). Due to time-varying wireless channel conditions, communication resources (e.g., set of t…
Whenever communication takes place to fulfill a goal, an effective way to encode the source data to be transmitted is to use an encoding rule that allows the receiver to meet the requirements of the goal. A formal way to identify the relevant information with respect to a goal can be obtained exploi…
This work aims to propose a novel architecture and training strategy for graph convolutional networks (GCN). The proposed architecture, named Autoencoder-Aided GCN (AA-GCN), compresses the convolutional features in an information-rich embedding at multiple hidden layers, exploiting the presence of a…
The goal of this paper is to investigate the impact of perturbations of topological descriptors, such as graphs and simplicial complexes, on the robustness of filters acting on signals observed over such domains. Given a nominal graph that may undergo small perturbations of its edges, we design robu…
The aim of this paper is to propose a novel dynamic resource allocation strategy for energy-efficient federated learning at the wireless network edge, with latency and learning performance guarantees. We consider a set of devices collecting local data and uploading processed information to an edge s…
The aim of this paper is to propose a method for online learning of time-varying graphs from noisy observations of smooth graph signals collected over the vertices. Starting from an initial graph, and assuming that the topology can undergo the perturbation of a small percentage of edges over time, t…
In this paper, we address the problem of dynamic allocation of communication and computation resources for Edge Machine Learning (EML) exploiting Multi-Access Edge Computing (MEC). In particular, we consider an IoT scenario, where sensor devices collect data from the environment and upload them to a…
The aim of this work is to develop a dynamic optimization strategy to allocate communication and computation resources in a Multi-access Edge Computing (MEC) scenario, where Unmanned Aerial Vehicles (UAVs) act as flying base station platforms endowed with computation capabilities to provide edge clo…
We study distributed processing of subspace-constrained signals in multi-agent networks with sparse connectivity. We introduce the first optimization framework based on distributed subspace projections, aimed at minimizing a network cost function depending on the specific processing task, while impo…
Multi-Access Edge Computing (MEC) is one of the key technology enablers of the 5G ecosystem, in combination with the high speed access provided by mmWave communications. In this paper, among all services enabled by MEC, we focus on computation offloading, devising an algorithm to optimize computatio…
We study decentralized estimation of time-varying signals at a fusion center (FC), when energy harvesting sensors transmit sampled data over rate-constrained links. We propose a dynamic strategy based on stochastic optimization for selecting radio parameters, sampling set, and harvested energy at ea…
We study centralized interpolation of bandlimited graph signals at a fusion center (FC), when sampled data are transmitted over rate-constrained links. In such a scenario, the performance of the reconstruction task is inevitably affected by several sources of errors such as observation noise and qua…
The goal of this paper is to derive a small perturbation analysis for networks subject to random changes of a small number of edges. Small perturbation theory allows us to derive, albeit approximate, closed form expressions that make possible the theoretical statistical characterization of the netwo…
A key tool to analyze signals defined over a graph is the so called Graph Fourier Transform (GFT). Alternative definitions of GFT have been proposed, based on the eigen-decomposition of either the graph Laplacian or adjacency matrix. In this paper, we introduce an alternative approach, valid for the…
Developing tools to analyze signals defined over a graph is a research area that is attracting a significant amount of contributions because of its many applications. However, a graph representation does not capture the overall information about the data, as it implicitly takes into account only pai…
Controlling the behavior of a signal defined over a graph by acting on a limited set of nodes is a problem that finds application in many fields. In this paper, we merge recently developed tools in graph signal processing with control theory of complex networks and consider the reconstruction of ban…
The goal of this paper is to propose a network formation game where strategic agents decide whether to form or sever a link with other agents depending on the net balance between the benefit resulting from the additional information coming from the new link and the cost associated to establish the l…