← Search

Yogish Sabharwal

2 accepted papers

2022

GREED: A Neural Framework for Learning Graph Distance Functions

NeurIPS 2022accept

Similarity search in graph databases is one of the most fundamental operations in graph analytics. Among various distance functions, graph and subgraph edit distances (GED and SED respectively) are two of the most popular and expressive measures. Unfortunately, exact computations for both are NP-har…

Cited by 58SourcePDFScholar
2020

PoWER-BERT: Accelerating BERT Inference via Progressive Word-vector Elimination

ICML 2020poster

We develop a novel method, called PoWER-BERT, for improving the inference time of the popular BERT model, while maintaining the accuracy. It works by: a) exploiting redundancy pertaining to word-vectors (intermediate transformer block outputs) and eliminating the redundant vectors. b) determining wh…