2 papers
cs.DS2026
Attention via Black-Box Vector Search
Stepan Zharkov, Krish Singal, Ashwin Padaki +1
Sparse attention mechanisms estimate attention over tokens using a small subset of keys. Many existing approaches use maximum inner product search (MIPS) to retrieve the heavie…
cs.CG2023
Inapproximability of Maximum Diameter Clustering for Few Clusters
Henry Fleischmann, Kyrylo Karlov, Karthik C. S. +2
In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance be…