Weekly graph technology trend reviews covering graph databases, GraphRAG, GNNs, ontology, and knowledge graphs.
GraphOmakase
Topological Neural Operator Topological Neural OperatorsWe introduce Topological Neural Operators (TNOs), a principled framework for operator learning on cell complexes that lifts neural operators (NOs) from functions on points and/or edges to topological domains. TNOs represent data as features defined on cells of varying dimension and model their interactions
GraphOmakase
AI Must Embrace Specialization via Superhuman Adaptable Intelligence AI Must Embrace Specialization via Superhuman Adaptable IntelligenceEveryone from AI executives and researchers to doomsayers, politicians, and activists is talking about Artificial General Intelligence (AGI). Yet, they often don’t seem to agree on its exact definition. One common definition of AGI
GraphOmakase
Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node ClassificationarXiv logoGitHub - transductive-sharpening/tunedGNN: Transductive Sharpening applied on top of the TunedGNN baseline.Transductive Sharpening applied on top of the TunedGNN baseline. - transductive-sharpening/tunedGNNGitHubtransductive-sharpening Keywords * Transductive Learning * Semi-supervised GNN
GraphOmakase
Learning Higher-Order Structure from Incomplete Spatiotemporal Data: Multi-Scale Hypergraph Laplacians with Neural Refinement Learning Higher-Order Structure from Incomplete Spatiotemporal Data: Multi-Scale Hypergraph Laplacians with Neural RefinementSensor networks increasingly govern modern infrastructure, yet the data they lose are rarely missing in the uniform-random patterns assumed by
GraphOmakase
Random Sets Graph Neural Networks Random-Set Graph Neural NetworksUncertainty quantification has become an important factor in understanding the data representations produced by Graph Neural Networks (GNNs). Despite their predictive capabilities being ever useful across industrial workspaces, the inherent uncertainty induced by the nature of the data is a huge
GraphOmakase
Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial Complexes Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial ComplexesWe introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a
GraphOmakase
Deep GraphRAG: A Balanced Approach to Hierarchical Retrieval and Adaptive Integration Deep GraphRAG: A Balanced Approach to Hierarchical Retrieval and Adaptive IntegrationGraph-based Retrieval-Augmented Generation (GraphRAG) frameworks face a trade-off between the comprehensiveness of global search and the efficiency of local search. Existing methods are often challenged by
GraphOmakase
Topology-Aware Representation Alignment for Semi-Supervised Vision-Language Learning Topology-Aware Representation Alignment for Semi-Supervised Vision-Language LearningVision-language models have shown strong performance, but they often generalize poorly to specialized domains. While semi-supervised vision-language learning mitigates this limitation by leveraging a small set of labeled
GraphOmakase
Learning Laplacian Forms for Graph Signal Processing via the Deformed Laplacian Learning Laplacian Forms for Graph Signal Processing via the Deformed LaplacianLearning the graph Laplacian from observed data is one of the most investigated and fundamental tasks in Graph Signal Processing (GSP). Different variants of the Laplacian, such as the
GraphOmakase
GraphFrames, a major graph analysis library update New GraphFrames release: Improved performance, new algorithms, and documentation | Sem Sinchenko posted on the topic | LinkedInOn behalf of the GraphFrames maintainers, I am happy to announce the delivery of a new release. It is a significant improvement! It improves performance and memory management:
GraphOmakase
PolyGraph Discrepancy: a classifier-based metric for graph generation PolyGraph Discrepancy: a classifier-based metric for graph generationExisting methods for evaluating graph generative models primarily rely on Maximum Mean Discrepancy (MMD) metrics based on graph descriptors. While these metrics can rank generative models, they do not provide an absolute measure
GraphOmakase
Graphs are maximally expressive for higher-order interactions Graphs are maximally expressive for higher-order interactionsWe demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in