atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

A Greedy Approach for Budgeted Maximum Inner Product Search

NeurIPS 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Greedy-MIPS candidate screening instead of PCA-MIPS, LSH-MIPS, or Diamond-MSIPSMIPS on Yahoo-Music · Yahoo-Music, k=200, similar 200x speeduptop-5 precision: p_5=70%; none ... can achieve a p_5 > 10%Helped
Replace the original screening procedure with the improved screening procedure that avoids heap updates for already-selected candidates (ablation)Greedy-MIPS · Budgeted MIPScandidate-screening time complexity: O(Bk log k) -> O(Bk)Helped
Use a selection tree instead of a max-heap (ablation)Greedy-MIPS · Netflix and Yahoo-MusicruntimeNo clear effect
Use the original screening procedure instead of the improved screening procedure (ablation)Greedy-MIPS · Netflix and Yahoo-MusicruntimeHurt
Use a selection tree instead of a max-heap (ablation)Greedy-MIPS · Budgeted MIPSruntime: O(k) ... O(1) ... O(log k)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy