Maximum Inner Product Search

Given a new query qq, MIPS targets at retrieving the datum having the largest inner product with qq from the database AA. Formally, the MIPS problem is formulated as below: p=arg⁡max⁡a∈Aa⊤qp = \arg \max \limits_{a \in A} a \top q

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 6 of 6 reductions

Other relevant algorithms

Insuffient Data to display table