Relative Representations of Latent Spaces enable Efficient Semantic Channel Equalization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913591320379392 |
|---|---|
| author | Hüttebräucker, Tomás Fiorellino, Simone Sana, Mohamed Di Lorenzo, Paolo Strinati, Emilio Calvanese |
| author_facet | Hüttebräucker, Tomás Fiorellino, Simone Sana, Mohamed Di Lorenzo, Paolo Strinati, Emilio Calvanese |
| contents | In multi-user semantic communication, language mismatche poses a significant challenge when independently trained agents interact. We present a novel semantic equalization algorithm that enables communication between agents with different languages without additional retraining. Our algorithm is based on relative representations, a framework that enables different agents employing different neural network models to have unified representation. It proceeds by projecting the latent vectors of different models into a common space defined relative to a set of data samples called \textit{anchors}, whose number equals the dimension of the resulting space. A communication between different agents translates to a communication of semantic symbols sampled from this relative space. This approach, in addition to aligning the semantic representations of different agents, allows compressing the amount of information being exchanged, by appropriately selecting the number of anchors. Eventually, we introduce a novel anchor selection strategy, which advantageously determines prototypical anchors, capturing the most relevant information for the downstream task. Our numerical results show the effectiveness of the proposed approach allowing seamless communication between agents with radically different models, including differences in terms of neural network architecture and datasets used for initial training. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19719 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Relative Representations of Latent Spaces enable Efficient Semantic Channel Equalization Hüttebräucker, Tomás Fiorellino, Simone Sana, Mohamed Di Lorenzo, Paolo Strinati, Emilio Calvanese Machine Learning In multi-user semantic communication, language mismatche poses a significant challenge when independently trained agents interact. We present a novel semantic equalization algorithm that enables communication between agents with different languages without additional retraining. Our algorithm is based on relative representations, a framework that enables different agents employing different neural network models to have unified representation. It proceeds by projecting the latent vectors of different models into a common space defined relative to a set of data samples called \textit{anchors}, whose number equals the dimension of the resulting space. A communication between different agents translates to a communication of semantic symbols sampled from this relative space. This approach, in addition to aligning the semantic representations of different agents, allows compressing the amount of information being exchanged, by appropriately selecting the number of anchors. Eventually, we introduce a novel anchor selection strategy, which advantageously determines prototypical anchors, capturing the most relevant information for the downstream task. Our numerical results show the effectiveness of the proposed approach allowing seamless communication between agents with radically different models, including differences in terms of neural network architecture and datasets used for initial training. |
| title | Relative Representations of Latent Spaces enable Efficient Semantic Channel Equalization |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2411.19719 |