Cover Image

Nearly Optimal Attention Coresets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liberty, Edo, Andoni, Alexandr, Kleiner, Eldar
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
by: la Tour, Max Dupré, et al.
Published: (2024)

A Framework for Building Data Structures from Communication Protocols
by: Andoni, Alexandr, et al.
Published: (2025)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
by: Alman, Josh, et al.
Published: (2024)

On Solving Linear Systems in Sublinear Time
by: Andoni, Alexandr, et al.
Published: (2018)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)

Approximating Optimal Labelings for Temporal Connectivity
by: Carnevale, Daniele, et al.
Published: (2025)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
by: Benomar, Ziyad, et al.
Published: (2025)

Coresets for Kernel Clustering
by: Jiang, Shaofeng H. -C., et al.
Published: (2021)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
by: Bansal, Nikhil, et al.
Published: (2024)

Optimal mass estimation in the conditional sampling model
by: Adar, Tomer, et al.
Published: (2025)

On Sketching Quadratic Forms
by: Andoni, Alexandr, et al.
Published: (2015)

A basic lower bound for property testing
by: Fischer, Eldar
Published: (2024)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
by: Huang, Lingxiao, et al.
Published: (2022)

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)

Positional Attention: Expressivity and Learnability of Algorithmic Computation
by: de Luca, Artur Back, et al.
Published: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
by: Huisman, Tim, et al.
Published: (2024)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
by: Chen, Wen-Ling, et al.
Published: (2025)

Refining the Adaptivity Notion in the Huge Object Model
by: Adar, Tomer, et al.
Published: (2023)

Coreset Spectral Clustering
by: Jourdan, Ben, et al.
Published: (2025)

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

Adaptive Multi-Round Allocation with Stochastic Arrivals
by: Pan, Yuqi, et al.
Published: (2026)

Online Allocation with Unknown Shared Supply
by: Neoh, Tzeh Yuan, et al.
Published: (2026)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure
by: Ganian, Robert, et al.
Published: (2026)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
by: Nakamura, Kengo, et al.
Published: (2026)

Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)

A canonical generalization of OBDD
by: Capelli, Florent, et al.
Published: (2026)

Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
by: Tacheny, Nicolas
Published: (2026)

Online Algorithms with Unreliable Guidance
by: Dallot, Julien, et al.
Published: (2026)

Limited Perfect Monotonical Surrogates constructed using low-cost recursive linkage discovery with guaranteed output
by: Przewozniczek, M. W., et al.
Published: (2026)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
by: Almansoori, Mahmood K. M., et al.
Published: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
by: Nguyen, Hue T., et al.
Published: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
by: Ganian, Robert, et al.
Published: (2025)

Efficient Detection of Exchangeable Factors in Factor Graphs
by: Luttermann, Malte, et al.
Published: (2024)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
by: Liu, Ruipeng, et al.
Published: (2025)

Masked Matrix Multiplication for Emergent Sparsity
by: Wheatman, Brian, et al.
Published: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
by: Mitzenmacher, Michael, et al.
Published: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
by: Han, Yue, et al.
Published: (2025)

Knapsack: Connectedness, Path, and Shortest-Path
by: Dey, Palash, et al.
Published: (2023)

A Survey on the Densest Subgraph Problem and Its Variants
by: Lanciano, Tommaso, et al.
Published: (2023)