Searcharxiv⌕ Search

arXiv subjects

Tilahun M. Getu

Publications and source records attributed to Tilahun M. Getu.

8 recordsLinked to original sources

Fundamental Limits of Deep Learning-Based Binary Classifiers Trained with Hinge Loss

Although deep learning (DL) has led to several breakthroughs in many disciplines, the fundamental understanding on why and how DL is empirically successful remains elusive. To attack this fundamental problem and unravel the mysteries behind DL's empirical successes, significant innovations toward a unified theory of DL have been made. Although these innovations encompass nearly fundamental advances in optimization, generalization, and approximation, no work has quantified the testing performance of a DL-based algorithm employed to solve a pattern classification problem. To overcome this fundamental challenge in part, this paper exposes the fundamental testing performance limits of DL-based binary classifiers trained with hinge loss. For binary classifiers that are based on deep rectified linear unit (ReLU) feedforward neural networks (FNNs) and deep FNNs with ReLU and Tanh activation, we derive their respective novel asymptotic testing performance limits, which are validated by extensive computer experiments.

cs.LG↗

A Multi-Agent DRL-Based Framework for Optimal Resource Allocation and Twin Migration in the Multi-Tier Vehicular Metaverse

Although multi-tier vehicular Metaverse promises to transform vehicles into essential nodes -- within an interconnected digital ecosystem -- using efficient resource allocation and seamless vehicular twin (VT) migration, this can hardly be achieved by the existing techniques operating in a highly dynamic vehicular environment, since they can hardly balance multi-objective optimization problems such as latency reduction, resource utilization, and user experience (UX). To address these challenges, we introduce a novel multi-tier resource allocation and VT migration framework that integrates Graph Convolutional Networks (GCNs), a hierarchical Stackelberg game-based incentive mechanism, and Multi-Agent Deep Reinforcement Learning (MADRL). The GCN-based model captures both spatial and temporal dependencies within the vehicular network; the Stackelberg game-based incentive mechanism fosters cooperation between vehicles and infrastructure; and the MADRL algorithm jointly optimizes resource allocation and VT migration in real time. By modeling this dynamic and multi-tier vehicular Metaverse as a Markov Decision Process (MDP), we develop a MADRL-based algorithm dubbed the Multi-Objective Multi-Agent Deep Deterministic Policy Gradient (MO-MADDPG), which can effectively balances the various conflicting objectives. Extensive simulations validate the effectiveness of this algorithm that is demonstrated to enhance scalability, reliability, and efficiency while considerably improving latency, resource utilization, migration cost, and overall UX by 12.8%, 9.7%, 14.2%, and 16.1%, respectively.

cs.NI↗

Deep Learning-Enabled Text Semantic Communication under Interference: An Empirical Study

At the confluence of 6G, deep learning (DL), and natural language processing (NLP), DL-enabled text semantic communication (SemCom) has emerged as a 6G enabler since it minimizes bandwidth consumption, transmission delay, and power usage. Among existing text SemCom techniques, a popular text SemCom scheme -- that can reliably transmit semantic information in the low signal-to-noise ratio (SNR) regimes -- is DeepSC, whose fundamental asymptotic performance limits under radio frequency interference (RFI) were accurately predicted by our recently developed theory [1]. Although our theory was corroborated by simulations, trained deep networks can defy classical statistical wisdom, calling for extensive computer experiments. This empirical work thus follows using the training, validation, and testing sets tokenized and vectorized from the Proceedings of the European Parliament (Europarl) dataset. Specifically, we train the DeepSC architecture in Keras 2.9 with TensorFlow 2.9 as a backend and test it under Gaussian multi-interferer RFI received over Rayleigh fading channels. Our testing results corroborate that DeepSC produces semantically irrelevant sentences under huge Gaussian RFI emitters, validating our theory. Therefore, a fundamental 6G design paradigm for interference-resistant and robust SemCom (IR$^2$ SemCom) is needed.

eess.SP↗

Performance Limits of a Deep Learning-Enabled Text Semantic Communication under Interference

Although deep learning (DL)-enabled semantic communication (SemCom) has emerged as a 6G enabler by minimizing irrelevant information transmission -- minimizing power usage, bandwidth consumption, and transmission delay, its benefits can be limited by radio frequency interference (RFI) that causes substantial semantic noise. Such semantic noise's impact can be alleviated using an interference-resistant and robust (IR$^2$) SemCom design, though no such design exists yet. To stimulate fundamental research on IR2 SemCom, the performance limits of a popular text SemCom system named DeepSC are studied in the presence of (multi-interferer) RFI. By introducing a principled probabilistic framework for SemCom, we show that DeepSC produces semantically irrelevant sentences as the power of (multi-interferer) RFI gets very large. We also derive DeepSC's practical limits and a lower bound on its outage probability under multi-interferer RFI, and propose a (generic) lifelong DL-based IR$^2$ SemCom system. We corroborate the derived limits with simulations and computer experiments, which also affirm the vulnerability of DeepSC to a wireless attack using RFI.

eess.SP↗

Tutorial-Cum-Survey on Semantic and Goal- Oriented Communication: Research Landscape, Challenges, and Future Directions

SemCom and goal-oriented SemCom are designed to transmit only semantically-relevant information and hence help to minimize power usage, bandwidth consumption, and transmission delay. Consequently, SemCom and goal-oriented SemCom embody a paradigm shift that can change the status quo that wireless connectivity is an opaque data pipe carrying messages whose context-dependent meaning and effectiveness have been ignored. On the other hand, 6G is critical for the materialization of major SemCom use cases (e.g., machine-to-machine SemCom) and major goal-oriented SemCom use cases (e.g., autonomous transportation). The paradigms of \textit{6G for (goal-oriented) SemCom} and \textit{(goal-oriented) SemCom for 6G} call for the tighter integration and marriage of 6G, SemCom, and goal-oriented SemCom. To facilitate this integration and marriage of 6G, SemCom, and goal-oriented SemCom, this comprehensive tutorial-cum-survey paper first explains the fundamentals of semantics and semantic information, semantic representation, theories of semantic information, and definitions of semantic entropy. It then builds on this understanding and details the state-of-the-art research landscape of SemCom and goal-oriented SemCom in terms of their respective algorithmic, theoretical, and realization research frontiers. This paper also exposes the fundamental and major challenges of SemCom and goal-oriented SemCom, and proposes novel future research directions for them in terms of their aforementioned research frontiers. By presenting novel future research directions for SemCom and goal-oriented SemCom along with their corresponding fundamental and major challenges, this tutorial-cum-survey article duly stimulates major streams of research on SemCom and goal-oriented SemCom theory, algorithm, and implementation for 6G and beyond.

cs.NI↗

Making Sense of Meaning: A Survey on Metrics for Semantic and Goal-Oriented Communication

Semantic communication (SemCom) aims to convey the meaning behind a transmitted message by transmitting only semantically-relevant information. This semantic-centric design helps to minimize power usage, bandwidth consumption, and transmission delay. SemCom and goal-oriented SemCom (or effectiveness-level SemCom) are therefore promising enablers of 6G and developing rapidly. Despite the surge in their swift development, the design, analysis, optimization, and realization of robust and intelligent SemCom as well as goal-oriented SemCom are fraught with many fundamental challenges. One of the challenges is that the lack of unified/universal metrics of SemCom and goal-oriented SemCom can stifle research progress on their respective algorithmic, theoretical, and implementation frontiers. Consequently, this survey paper documents the existing metrics -- scattered in many references -- of wireless SemCom, optical SemCom, quantum SemCom, and goal-oriented wireless SemCom. By doing so, this paper aims to inspire the design, analysis, and optimization of a wide variety of SemCom and goal-oriented SemCom systems. This article also stimulates the development of unified/universal performance assessment metrics of SemCom and goal-oriented SemCom, as the existing metrics are purely statistical and hardly applicable to reasoning-type tasks that constitute the heart of 6G and beyond.

eess.SP↗

Blind Estimation of a Doubly Selective OFDM Channel: A Deep Learning Algorithm and Theory

We provide a new generation solution to the fundamental old problem of a doubly selective fading channel estimation for orthogonal frequency division multiplexing (OFDM) systems. For systems based on OFDM, we propose a deep learning (DL)-based blind doubly selective channel estimator. This estimator does require no pilot symbols, unlike the corresponding state-of-the-art estimators, even during the estimation of a deep fading doubly selective channel. We also provide the first of its kind theory on the testing mean squared error (MSE) performance of our investigated blind OFDM channel estimator based on over-parameterized ReLU FNNs.

eess.SP↗

Error Bounds for a Matrix-Vector Product Approximation with Deep ReLU Neural Networks

Among the several paradigms of artificial intelligence (AI) or machine learning (ML), a remarkably successful paradigm is deep learning. Deep learning's phenomenal success has been hoped to be interpreted via fundamental research on the theory of deep learning. Accordingly, applied research on deep learning has spurred the theory of deep learning-oriented depth and breadth of developments. Inspired by such developments, we pose these fundamental questions: can we accurately approximate an arbitrary matrix-vector product using deep rectified linear unit (ReLU) feedforward neural networks (FNNs)? If so, can we bound the resulting approximation error? In light of these questions, we derive error bounds in Lebesgue and Sobolev norms that comprise our developed deep approximation theory. Guided by this theory, we have successfully trained deep ReLU FNNs whose test results justify our developed theory. The developed theory is also applicable for guiding and easing the training of teacher deep ReLU FNNs in view of the emerging teacher-student AI or ML paradigms that are essential for solving several AI or ML problems in wireless communications and signal processing; network science and graph signal processing; and network neuroscience and brain physics.

cs.LG↗