Search Results for author:
Found 8 papers, 1 papers with code
Proximity Graph Maintenance for Fast Online Nearest Neighbor Search
Given a vertex deletion request, we thoroughly investigate solutions to update the connections of the vertex.
Rate-Optimal Subspace Estimation on Random Graphs
We show that the performance of estimating the connectivity matrix $M$ depends on the sparsity of the graph.
Estimate the Implicit Likelihoods of GANs with Application to Anomaly Detection
The thriving of deep models and generative models provides approaches to model high dimensional distributions.
Möbius Transformation for Fast Inner Product Search on Graph
We present a fast search on graph algorithm for Maximum Inner Product Search (MIPS).
On Efficient Retrieval of Top Similarity Vectors
Retrieval of relevant vectors produced by representation learning critically influences the efficiency in natural language processing (NLP) tasks.
Fast Binary Functional Search on Graph
As Approximate Nearest Neighbor Search (ANNS) techniques have specifications on metric distances, efficient searching by advanced measures is still an open question.
Optimal Bipartite Network Clustering
The provable algorithm is derived from a general class of pseudo-likelihood biclustering algorithms that employ simple EM type updates.
Analysis of spectral clustering algorithms for community detection: the general bipartite setting
We consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM).
