DeepAI AI Chat
Log In Sign Up

Scaling Active Search using Linear Similarity Functions

by   Sibi Venkatesan, et al.
Carnegie Mellon University

Active Search has become an increasingly useful tool in information retrieval problems where the goal is to discover as many target elements as possible using only limited label queries. With the advent of big data, there is a growing emphasis on the scalability of such techniques to handle very large and very complex datasets. In this paper, we consider the problem of Active Search where we are given a similarity function between data points. We look at an algorithm introduced by Wang et al. [2013] for Active Search over graphs and propose crucial modifications which allow it to scale significantly. Their approach selects points by minimizing an energy function over the graph induced by the similarity function on the data. Our modifications require the similarity function to be a dot-product between feature vectors of data points, equivalent to having a linear kernel for the adjacency matrix. With this, we are able to scale tremendously: for n data points, the original algorithm runs in O(n^2) time per iteration while ours runs in only O(nr + r^2) given r-dimensional features. We also describe a simple alternate approach using a weighted-neighbor predictor which also scales well. In our experiments, we show that our method is competitive with existing semi-supervised approaches. We also briefly discuss conditions under which our algorithm performs well.


page 1

page 2

page 3

page 4


Similarity Search Over Graphs Using Localized Spectral Analysis

This paper provides a new similarity detection algorithm. Given an input...

Twin Neural Network Regression is a Semi-Supervised Regression Algorithm

Twin neural network regression (TNNR) is a semi-supervised regression al...

Online Active Regression

Active regression considers a linear regression problem where the learne...

Active Semi-Supervised Learning Using Sampling Theory for Graph Signals

We consider the problem of offline, pool-based active semi-supervised le...

Dynamic Similarity Search on Integer Sketches

Similarity-preserving hashing is a core technique for fast similarity se...

Fitting a Graph to One-Dimensional Data

Given n data points in R^d, an appropriate edge-weighted graph connectin...

Criteria Sliders: Learning Continuous Database Criteria via Interactive Ranking

Large databases are often organized by hand-labeled metadata, or criteri...

Code Repositories


simple linearized active search

view repo