PLATONT: Learning a Platonic Representation for Unified Network Tomography

• URL: http://arxiv.org/abs/2511.15251v1
• Date: Wed, 19 Nov 2025 09:10:32 GMT
• Title: PLATONT: Learning a Platonic Representation for Unified Network Tomography
• Abstract summary: We present PLATONT, a unified framework that models different network indicators as projections of a shared latent network state.<n>Experiments on synthetic and real-world datasets show that PLATONT consistently outperforms existing methods in link estimation, topology inference, and traffic prediction.
• Score: 7.800399349334518
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Network tomography aims to infer hidden network states, such as link performance, traffic load, and topology, from external observations. Most existing methods solve these problems separately and depend on limited task-specific signals, which limits generalization and interpretability. We present PLATONT, a unified framework that models different network indicators (e.g., delay, loss, bandwidth) as projections of a shared latent network state. Guided by the Platonic Representation Hypothesis, PLATONT learns this latent state through multimodal alignment and contrastive learning. By training multiple tomography tasks within a shared latent space, it builds compact and structured representations that improve cross-task generalization. Experiments on synthetic and real-world datasets show that PLATONT consistently outperforms existing methods in link estimation, topology inference, and traffic prediction, achieving higher accuracy and stronger robustness under varying network conditions.

Related papers

• Cross-Domain Generalization in Optical Networks via Joint Contrastive and Classification Learning [1.0709603403936399]
  robustness of machine learning techniques remains an open challenge in optical networks.<n>Models trained on data from a specific topology or operational configuration often exhibit degraded performance when deployed in unseen networks.<n>We propose a representation learning technique aimed at capturing task-relevant relationships that remain stable across domains.
  arXiv  Detail & Related papers  (2026-07-22T19:02:45Z)
• Interpreting Manifolds and Graph Neural Embeddings from Internet of Things Traffic Flows [1.8510825807956957]
  This work introduces an interpretable pipeline that generates directly visualizable low-dimensional representations by mapping high-dimensional embeddings onto a latent manifold.<n>The framework achieves a classification F1-score of 0.830 for intrusion detection while also highlighting phenomena such as concept drift.
  arXiv  Detail & Related papers  (2026-02-05T16:08:24Z)
• Hierarchical Frequency-Decomposition Graph Neural Networks for Road Network Representation Learning [17.71971203386826]
  Road networks are critical infrastructures underpinning intelligent transportation systems and their related applications.<n>HiFiNet is a novel hierarchical frequency-decomposition graph neural network that unifies spatial and spectral modeling.
  arXiv  Detail & Related papers  (2025-11-16T08:48:02Z)
• Contrastive Network Representation Learning [20.236657764682715]
  Network representation learning seeks to embed networks into a low-dimensional space while preserving the structural and semantic properties.<n>We propose a novel contrastive learning-based statistical approach for network edge embedding.<n>We show that our method achieves the minimax optimal convergence rate for edge representation learning.
  arXiv  Detail & Related papers  (2025-09-14T15:25:59Z)
• Joint Graph Convolution and Sequential Modeling for Scalable Network Traffic Estimation [11.751952500567388]
  This study focuses on the challenge of predicting network traffic within complex topological environments.<n>It introduces a Graph Contemporalal Networks (GCN) with Gated Recurrent Units (GRU) modeling approach.<n>The effectiveness of the proposed model is validated through comprehensive experiments on the real-world Abilene network traffic dataset.
  arXiv  Detail & Related papers  (2025-05-12T15:38:19Z)
• Improving Network Interpretability via Explanation Consistency Evaluation [56.14036428778861]
  We propose a framework that acquires more explainable activation heatmaps and simultaneously increase the model performance. Specifically, our framework introduces a new metric, i.e., explanation consistency, to reweight the training samples adaptively in model learning. Our framework then promotes the model learning by paying closer attention to those training samples with a high difference in explanations.
  arXiv  Detail & Related papers  (2024-08-08T17:20:08Z)
• Scalable Self-Supervised Representation Learning from Spatiotemporal Motion Trajectories for Multimodal Computer Vision [0.0]
  We propose a self-supervised, unlabeled method for learning representations of geographic locations from GPS trajectories. We show that reachability embeddings are semantically meaningful representations and result in 4-23% gain in performance as measured using area under precision-recall curve (AUPRC) metric.
  arXiv  Detail & Related papers  (2022-10-07T02:41:02Z)
• Mixed Graph Contrastive Network for Semi-Supervised Node Classification [63.924129159538076]
  We propose a novel graph contrastive learning method, termed Mixed Graph Contrastive Network (MGCN)<n>In our method, we improve the discriminative capability of the latent embeddings by an unperturbed augmentation strategy and a correlation reduction mechanism.<n>By combining the two settings, we extract rich supervision information from both the abundant nodes and the rare yet valuable labeled nodes for discriminative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)
• Imposing Consistency for Optical Flow Estimation [73.53204596544472]
  Imposing consistency through proxy tasks has been shown to enhance data-driven learning. This paper introduces novel and effective consistency strategies for optical flow estimation.
  arXiv  Detail & Related papers  (2022-04-14T22:58:30Z)
• SpatioTemporal Focus for Skeleton-based Action Recognition [66.8571926307011]
  Graph convolutional networks (GCNs) are widely adopted in skeleton-based action recognition. We argue that the performance of recent proposed skeleton-based action recognition methods is limited by the following factors. Inspired by the recent attention mechanism, we propose a multi-grain contextual focus module, termed MCF, to capture the action associated relation information.
  arXiv  Detail & Related papers  (2022-03-31T02:45:24Z)
• Temporal Graph Network Embedding with Causal Anonymous Walks Representations [54.05212871508062]
  We propose a novel approach for dynamic network representation learning based on Temporal Graph Network. For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings. We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
  arXiv  Detail & Related papers  (2021-08-19T15:39:52Z)
• Network Embedding via Deep Prediction Model [25.727377978617465]
  This paper proposes a network embedding framework to capture the transfer behaviors on structured networks via deep prediction models. A network structure embedding layer is added into conventional deep prediction models, including Long Short-Term Memory Network and Recurrent Neural Network. Experimental studies are conducted on various datasets including social networks, citation networks, biomedical network, collaboration network and language network.
  arXiv  Detail & Related papers  (2021-04-27T16:56:00Z)
• Variational Structured Attention Networks for Deep Visual Representation Learning [49.80498066480928]
  We propose a unified deep framework to jointly learn both spatial attention maps and channel attention in a principled manner. Specifically, we integrate the estimation and the interaction of the attentions within a probabilistic representation learning framework. We implement the inference rules within the neural network, thus allowing for end-to-end learning of the probabilistic and the CNN front-end parameters.
  arXiv  Detail & Related papers  (2021-03-05T07:37:24Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.