Pith. sign in

REVIEW

HUGE: Huge Unsupervised Graph Embeddings with TPUs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.14490 v1 pith:AEIRPYDV submitted 2023-07-26 cs.LG cs.DCcs.SI

classification cs.LGcs.DCcs.SI
keywords graphembeddinggraphsnodesrepresentationbillionscontinuousdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graphs are a representation of structured data that captures the relationships between sets of objects. With the ubiquity of available network data, there is increasing industrial and academic need to quickly analyze graphs with billions of nodes and trillions of edges. A common first step for network understanding is Graph Embedding, the process of creating a continuous representation of nodes in a graph. A continuous representation is often more amenable, especially at scale, for solving downstream machine learning tasks such as classification, link prediction, and clustering. A high-performance graph embedding architecture leveraging Tensor Processing Units (TPUs) with configurable amounts of high-bandwidth memory is presented that simplifies the graph embedding problem and can scale to graphs with billions of nodes and trillions of edges. We verify the embedding space quality on real and synthetic large-scale datasets.

Discussion (0). Continue with ORCID to comment.

Pith tools