Unsupervised Attributed Dynamic Network Embedding with Stability Guarantees

• URL: http://arxiv.org/abs/2503.02859v1
• Date: Tue, 04 Mar 2025 18:34:55 GMT
• Title: Unsupervised Attributed Dynamic Network Embedding with Stability Guarantees
• Abstract summary: We present attributed unfolded adjacency spectral embedding (AUASE), a stable unsupervised representation learning framework for dynamic networks.<n>We quantify the benefits of our dynamic embedding by comparing with state-of-the-art network representation learning methods on three real attributed networks.
• Score: 1.7261860761946977
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Stability for dynamic network embeddings ensures that nodes behaving the same at different times receive the same embedding, allowing comparison of nodes in the network across time. We present attributed unfolded adjacency spectral embedding (AUASE), a stable unsupervised representation learning framework for dynamic networks in which nodes are attributed with time-varying covariate information. To establish stability, we prove uniform convergence to an associated latent position model. We quantify the benefits of our dynamic embedding by comparing with state-of-the-art network representation learning methods on three real attributed networks. To the best of our knowledge, AUASE is the only attributed dynamic embedding that satisfies stability guarantees without the need for ground truth labels, which we demonstrate provides significant improvements for link prediction and node classification.

Related papers

• Shift-Invariant Attribute Scoring for Kolmogorov-Arnold Networks via Shapley Value [5.757852060704622]
  Kolmogorov-Arnold Networks (KANs) address this by employing learnable spline-based activation functions on edges.<n>We propose ShapKAN, a pruning framework using Shapley value attribution to assess node importance in a shift-invariant manner.<n>Our approach improves KAN's interpretability advantages, facilitating deployment in resource-constrained environments.
  arXiv  Detail & Related papers  (2025-10-02T04:45:02Z)
• Unsupervised Online 3D Instance Segmentation with Synthetic Sequences and Dynamic Loss [52.28880405119483]
  Unsupervised online 3D instance segmentation is a fundamental yet challenging task.<n>Existing methods, such as UNIT, have made progress in this direction but remain constrained by limited training diversity.<n>We propose a new framework that enriches the training distribution through synthetic point cloud sequence generation.
  arXiv  Detail & Related papers  (2025-09-27T08:53:27Z)
• PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis [75.14189839277928]
  We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
  arXiv  Detail & Related papers  (2025-08-29T01:47:27Z)
• Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation [1.4747234049753448]
  A common approach is to learn time-varying node embeddings, whose effectiveness depends on satisfying key stability properties.<n>We propose Unfolded Laplacian Spectral Embedding, a new method that extends the Unfolded Adjacency Spectral Embedding framework to normalized Laplacians.<n>As a bonus, we establish a new Cheeger-style inequality that connects the embeddings to the conductance of the underlying dynamic graphs.
  arXiv  Detail & Related papers  (2025-08-18T07:13:53Z)
• Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding [1.6044444452278062]
  This paper proposes a novel unifying dynamic network embedding method that simultaneously preserves both structural proximity and equivalence. We then introduce a temporal-structural random walk to flexibly sample time-respecting sequences of nodes, considering both their temporal proximity and similarity in evolving structures. The proposed method is evaluated using five real-world networks on node classification where it outperforms benchmark methods.
  arXiv  Detail & Related papers  (2025-03-14T08:40:05Z)
• Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptation [66.40525136929398]
  Test-time adaptation (TTA) has attracted attention due to its ability to adapt a pre-trained model to a target domain, without re-accessing the source domain.<n>We propose Matcha, an innovative framework designed for effective and efficient adaptation to structure shifts in graphs.<n>We validate the effectiveness of Matcha on both synthetic and real-world datasets, demonstrating its robustness across various combinations of structure and attribute shifts.
  arXiv  Detail & Related papers  (2024-10-09T15:15:40Z)
• Enhancing lattice kinetic schemes for fluid dynamics with Lattice-Equivariant Neural Networks [79.16635054977068]
  We present a new class of equivariant neural networks, dubbed Lattice-Equivariant Neural Networks (LENNs) Our approach develops within a recently introduced framework aimed at learning neural network-based surrogate models Lattice Boltzmann collision operators. Our work opens towards practical utilization of machine learning-augmented Lattice Boltzmann CFD in real-world simulations.
  arXiv  Detail & Related papers  (2024-05-22T17:23:15Z)
• A Simple and Powerful Framework for Stable Dynamic Network Embedding [6.171990546748666]
  We propose a wide class of established static network embedding methods to produce interpretable dynamic network embeddings. We provide a theoretical guarantee that, regardless of embedding dimension, these unfolded methods will produce stable embeddings. We additionally define a hypothesis testing framework which can be used to evaluate the quality of a dynamic network embedding.
  arXiv  Detail & Related papers  (2023-11-14T15:38:17Z)
• Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks [50.2033914945157]
  We present a representation learning framework, Intensity Profile Projection, for continuous-time dynamic network data. The framework consists of three stages: estimating pairwise intensity functions, learning a projection which minimises a notion of intensity reconstruction error. Moreoever, we develop estimation theory providing tight control on the error of any estimated trajectory, indicating that the representations could even be used in quite noise-sensitive follow-on analyses.
  arXiv  Detail & Related papers  (2023-06-09T15:38:25Z)
• Reliability-Adaptive Consistency Regularization for Weakly-Supervised Point Cloud Segmentation [80.07161039753043]
  Weakly-supervised point cloud segmentation with extremely limited labels is desirable to alleviate the expensive costs of collecting densely annotated 3D points. This paper explores applying the consistency regularization that is commonly used in weakly-supervised learning, for its point cloud counterpart with multiple data-specific augmentations. We propose a novel Reliability-Adaptive Consistency Network (RAC-Net) to use both prediction confidence and model uncertainty to measure the reliability of pseudo labels.
  arXiv  Detail & Related papers  (2023-03-09T10:41:57Z)
• 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)
• Link Prediction with Contextualized Self-Supervision [63.25455976593081]
  Link prediction aims to infer the existence of a link between two nodes in a network. Traditional link prediction algorithms are hindered by three major challenges -- link sparsity, node attribute noise and network dynamics. We propose a Contextualized Self-Supervised Learning framework that fully exploits structural context prediction for link prediction.
  arXiv  Detail & Related papers  (2022-01-25T03:12:32Z)
• Stability of Neural Networks on Manifolds to Relative Perturbations [118.84154142918214]
  Graph Neural Networks (GNNs) show impressive performance in many practical scenarios. GNNs can scale well on large size graphs, but this is contradicted by the fact that existing stability bounds grow with the number of nodes.
  arXiv  Detail & Related papers  (2021-10-10T04:37:19Z)
• Training Stable Graph Neural Networks Through Constrained Learning [116.03137405192356]
  Graph Neural Networks (GNNs) rely on graph convolutions to learn features from network data. GNNs are stable to different types of perturbations of the underlying graph, a property that they inherit from graph filters. We propose a novel constrained learning approach by imposing a constraint on the stability condition of the GNN within a perturbation of choice.
  arXiv  Detail & Related papers  (2021-10-07T15:54:42Z)
• Spectral embedding for dynamic networks with stability guarantees [7.575860121202432]
  We consider the problem of embedding a dynamic network vector to obtain time-evolving representations of each node. These properties are defined formally within a generic dynamic latent position model. We show how this model can be recast as a multilayer random dot product graph.
  arXiv  Detail & Related papers  (2021-06-02T16:43:43Z)
• DynACPD Embedding Algorithm for Prediction Tasks in Dynamic Networks [6.5361928329696335]
  We present novel embedding methods for a dynamic network based on higher order tensor decompositions for tensorial representations of the dynamic network. We demonstrate the power and efficiency of our approach by comparing our algorithms' performance on the link prediction task against an array of current baseline methods.
  arXiv  Detail & Related papers  (2021-03-12T04:36:42Z)
• Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN [16.362525151483084]
  We propose a novel dynamic heterogeneous network embedding method, termed as DyHATR. It uses hierarchical attention to learn heterogeneous information and incorporates recurrent neural networks with temporal attention to capture evolutionary patterns. We benchmark our method on four real-world datasets for the task of link prediction.
  arXiv  Detail & Related papers  (2020-04-01T17:16:47Z)

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.