Gaussian Sheaf Neural Networks derive a sheaf Laplacian for Gaussian node features on graphs to preserve their geometric structure during message passing.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5verdicts
UNVERDICTED 5representative citing papers
A Bayesian hyperbolic latent space model with an inferred temperature parameter outperforms fixed-temperature and Euclidean alternatives in network reconstruction on simulated and real data.
Renyi differential privacy for manifold-valued data is characterized via dimension-free Harnack inequalities and governed by Ricci curvature, with heat diffusion and Langevin mechanisms plus application to private Frechet mean estimation.
An efficient algorithm recovers phylogenetic trees from Θ(n) noisy quartets under random classification noise, matching the information-theoretic lower bound and achieving near-optimal quartet distance.
Triplet constraints realizable in D-dimensional Euclidean space cannot be preserved above 50% accuracy by any embedding of dimension at most cD for constant c<1, with UGC-hardness preventing better polynomial-time solutions in any dimension.
citing papers explorer
-
Gaussian Sheaf Neural Networks
Gaussian Sheaf Neural Networks derive a sheaf Laplacian for Gaussian node features on graphs to preserve their geometric structure during message passing.
-
Hyperbolic Latent Space Models for Network Embedding: Model Specification and Bayesian Inference
A Bayesian hyperbolic latent space model with an inferred temperature parameter outperforms fixed-temperature and Euclidean alternatives in network reconstruction on simulated and real data.
-
Geometric Renyi Differential Privacy: Ricci Curvature Characterized by Heat Diffusion Mechanisms
Renyi differential privacy for manifold-valued data is characterized via dimension-free Harnack inequalities and governed by Ricci curvature, with heat diffusion and Langevin mechanisms plus application to private Frechet mean estimation.
-
Optimal Phylogenetic Reconstruction from Sampled Quartets
An efficient algorithm recovers phylogenetic trees from Θ(n) noisy quartets under random classification noise, matching the information-theoretic lower bound and achieving near-optimal quartet distance.
-
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Triplet constraints realizable in D-dimensional Euclidean space cannot be preserved above 50% accuracy by any embedding of dimension at most cD for constant c<1, with UGC-hardness preventing better polynomial-time solutions in any dimension.