Research map / Learning theory and algorithms / Prediction and decision losses

Amortized Maximum Inner Product Search with Learned Support Functions

ICML 2026 · Learning theory and algorithms › Prediction and decision losses · approach: Approximate nearest neighbor indexing

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.

Closest papers by meaning

• A Greedy Approach for Budgeted Maximum Inner Product Search (NeurIPS 2017 · similarity 0.91)
• Faster Maximum Inner Product Search in High Dimensions (ICML 2024 · similarity 0.90)
• Query-Aware Quantization for Maximum Inner Product Search (AAAI 2023 · similarity 0.89)
• Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model (ICLR 2025 · similarity 0.84)
• Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search (NeurIPS 2025 · similarity 0.83)
• Learning-Augmented Streaming Algorithms for Approximating Boolean Max-CSPs (NeurIPS 2026 · similarity 0.83)