8 citations · 15 across the 4 of their papers we have counts for
7 papers
Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization
Nishant Yadav, Nicholas Monath, Rico Angell +2
Efficient k-nearest neighbor search is a fundamental task, foundational for many problems in NLP. When the similarity is measured by dot-product between dual-encoder vectors or $\e…
Stochastic Package Queries in Probabilistic Databases
Matteo Brucato, Nishant Yadav, Azza Abouzied +2
We provide methods for in-database support of decision making under uncertainty. Many important decision problems correspond to selecting a package (bag of tuples in a relational d…
Session-Aware Query Auto-completion using Extreme Multi-label Ranking
Nishant Yadav, Rajat Sen, Daniel N. Hill +2
Query auto-completion (QAC) is a fundamental feature in search engines where the task is to suggest plausible completions of a prefix typed in the search bar. Previous queries in t…
Clustering-based Inference for Biomedical Entity Linking
Rico Angell, Nicholas Monath, Sunil Mohan +2
Due to large number of entities in biomedical knowledge bases, only a small fraction of entities have corresponding labelled training data. This necessitates entity linking models…
Supervised Hierarchical Clustering with Exponential Linkage
Nishant Yadav, Ari Kobren, Nicholas Monath +1
In supervised clustering, standard techniques for learning a pairwise dissimilarity function often suffer from a discrepancy between the training and clustering objectives, leading…
Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract)
Sidharth Negi, Ameya Dubey, Amitabha Bagchi +3
Dynamic Bloom filters (DBF) were proposed by Guo et. al. in 2010 to tackle the situation where the size of the set to be stored compactly is not known in advance or can change duri…