arXiv (All)
open access
FastGraph: PCA-Subspace Binned k-Nearest-Neighbor Graph Construction for GPU Geometric Deep Learning
Dynamic graph neural networks repeatedly construct k-nearest-neighbor graphs in learned latent spaces, making GPU-accelerated graph construction an important operation in scientific point-cloud workloads. We present FastGraph, a PyTorch-integrated primitive for exact kNN graph construction in low-to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Semantic Graph Neural Network with Multi-measure Learning for Semi-supervised Classification#1401766
- Latent Flow Matching for Molecular Graph Generation#1215571
- Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization#1423862
- Geometry-Aware Operator Families for Structured Representation Learning#1117801
- Bhygnn+: unsupervised representation learning for heterophilic hypergraphs#1098749
Record · ID 1447042
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive