Search Results for author:
Found 5 papers, 0 papers with code
Cluster Tree for Nearest Neighbor Search
In addition, we show theoretically and empirically that ClusterTree finds partitions which are superior to those found by RP trees in preserving the cluster structure of the input dataset.
Impact-driven Exploration with Contrastive Unsupervised Representations
That is, we train the embedding with respect to cosine similarity, where we define two observations to be similar if the agent can reach one observation from the other within a few steps, and define impact in terms of this similarity measure.
Diffusion-based Deep Active Learning
To alleviate the load of data annotation, active deep learning aims to select a minimal set of training points to be labelled which yields maximal model accuracy.
Active Community Detection with Maximal Expected Model Change
We present a novel active learning algorithm for community detection on networks.
Linear Time Clustering for High Dimensional Mixtures of Gaussian Clouds
Consequently, the expected overall running time of the algorithm is linear in $n$ and quasi-linear in $p$ at $o(\ln{p})O(np)$, and the sample complexity is independent of $p$.
