arXiv Machine Learning
Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 8
Towards Tight Bounds for Streaming Attention
arXiv:2606. 07205v1 Announce Type: cross Abstract: The attention mechanism is a cornerstone of modern transformer architectures.
arXiv Machine Learning
Aug 24
Query Efficient Structured Matrix Learning
arXiv:2507.19290v2 Announce Type: replace-cross Abstract: We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix $A$ given access to matrix-...
arXiv Machine Learning
Jun 19
Spectral DPPs via NEPv: A Scalable Continuous Relaxation of Determinantal MAP for Diversity-Aware Data Selection
arXiv:2606. 19411v1 Announce Type: new Abstract: Selecting a small, diverse, high-quality subset from a massive pool of candidates is a recurring primitive in modern machine learning -- data curation and coreset selection for training and fine-tuning large models, active-learning batch acquisition, prompt and exemplar selection for in-context learning, retrieval diversification, and experimental design.
arXiv Machine Learning
Aug 14
Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection
arXiv:2608. 12573v1 Announce Type: new Abstract: Top-k selection is a fundamental computational primitive with applications spanning databases, information retrieval, signal processing, and modern machine learning workloads, including sparse activations and attention pruning.
arXiv Machine Learning
Jul 2
Amortized Maximum Inner Product Search with Learned Support Functions
arXiv:2603. 08001v3 Announce Type: replace Abstract: Maximum inner product search (MIPS) is a crucial subroutine in machine learning, requiring the identification of a vector taken within a database (the keys) that best aligns with a given query.
arXiv Machine Learning
Jul 14
Learning Partition Trees for Nearest Neighbor Search
arXiv:2607. 09909v1 Announce Type: cross Abstract: We study nearest neighbor search from the perspective of data-driven algorithm design: given a dataset $P \subset \mathbb{R}^d$ of size $n$ and sample access to a query distribution over $\mathbb{R}^d$, the goal is to learn a data structure optimized for queries drawn from that specific distribution.