Prior-Informed Flow Matching for Graph Reconstruction
arXiv:2601. 22107v2 Announce Type: replace Abstract: We introduce \textit{Prior-Informed Flow Matching (PIFM)}, a conditional flow model for graph reconstruction.
arXiv:2602. 18084v2 Announce Type: replace Abstract: Equivariance is central to graph generative models, as it ensures the model respects the permutation symmetry of graphs.
arXiv:2601. 22107v2 Announce Type: replace Abstract: We introduce \textit{Prior-Informed Flow Matching (PIFM)}, a conditional flow model for graph reconstruction.
arXiv:2608. 12010v1 Announce Type: new Abstract: Equivariant Neural Networks (ENNs) have empowered numerous applications in scientific fields.
Equivariant Neural Networks (ENNs) have empowered numerous applications in scientific fields. Despite their remarkable capacity for representing geometric structures, ENNs suffer from degraded expressivity when processing symmetric inputs: the output representations are invariant to transformations that extend beyond the input's symmetries.
arXiv:2607. 07510v1 Announce Type: cross Abstract: Generating signals on graphs requires permutation-equivariant models that exhibit stability with respect to relative structural perturbations.
arXiv:2410. 06665v4 Announce Type: replace-cross Abstract: This paper explores the characterization of equivariant linear layers for representations of permutations and related groups.
arXiv:2608. 14373v1 Announce Type: new Abstract: The symmetries of a learning task have become an important factor in designing modern deep learning solutions.
arXiv:2605. 18106v3 Announce Type: replace-cross Abstract: A striking geometric disparity has long persisted in the practice of deep learning.
arXiv:2607. 27767v1 Announce Type: new Abstract: Graph neural networks (GNNs) can operate on large graphs but become infrastructure-sensitive at the scale of millions of nodes and typically require scalable training techniques for even larger graphs.
arXiv:2505. 13087v2 Announce Type: replace-cross Abstract: We propose a novel benchmarking methodology for graph neural networks (GNNs) based on the graph alignment problem, a combinatorial optimization task that generalizes graph isomorphism by aligning two unlabeled graphs to maximize overlapping edges.
Generating signals on graphs requires permutation-equivariant models that exhibit stability with respect to relative structural perturbations. While favorable stability properties of Graph Neural Networks (GNNs) have been well documented, it is unclear how structural errors propagate through the dynamics of continuous generative flow models that are gaining traction for graph signal generation.
arXiv:2509. 03340v4 Announce Type: replace-cross Abstract: Bifurcation phenomena in nonlinear dynamical systems often lead to multiple coexisting stable solutions, particularly in the presence of symmetry breaking.
arXiv:2505. 15441v5 Announce Type: replace-cross Abstract: Natural images exhibit strong geometric regularities: local structures, such as edges, corners, and textures, appear in many orientations and mirror configurations.