Image de couverture de livre

Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wolfson, Daniel, Wagner, Tal
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improving LSH via Tensorized Random Projection
par: Verma, Bhisham Dev, et autres
Publié: (2024)

SpEx: A Spectral Approach to Explainable Clustering
par: Argov, Tal, et autres
Publié: (2025)

New Bounds for Kernel Sums via Fast Spherical Embeddings
par: Wagner, Tal
Publié: (2026)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
par: Indyk, Piotr, et autres
Publié: (2025)

Learning from End User Data with Shuffled Differential Privacy over Kernel Densities
par: Wagner, Tal
Publié: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
par: Mishra, Nina, et autres
Publié: (2025)

Optimal Approximate Matrix Multiplication over Sliding Windows
par: Yao, Ziqi, et autres
Publié: (2025)

An Efficient Matrix Multiplication Algorithm for Accelerating Inference in Binary and Ternary Neural Networks
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
par: Garg, Sachin, et autres
Publié: (2025)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
par: Maity, Binita, et autres
Publié: (2024)

Data-Dependent LSH for the Earth Mover's Distance
par: Jayaram, Rajesh, et autres
Publié: (2024)

Binary Search with Distributional Predictions
par: Dinitz, Michael, et autres
Publié: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
par: Song, Zhao, et autres
Publié: (2026)

Streaming Attention Approximation via Discrepancy Theory
par: Kochetkova, Ekaterina, et autres
Publié: (2025)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
par: Hines, Christian L., et autres
Publié: (2025)

Positional Attention: Expressivity and Learnability of Algorithmic Computation
par: de Luca, Artur Back, et autres
Publié: (2024)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
par: Dereziński, Michał, et autres
Publié: (2024)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
par: Kannan, Ravindran, et autres
Publié: (2024)

An Approximation Algorithm for Graph Label Selection
par: John, Josia, et autres
Publié: (2026)

Guessing Efficiently for Constrained Subspace Approximation
par: Bhaskara, Aditya, et autres
Publié: (2025)

Approximation Algorithms for D-optimal Design
par: Singh, Mohit, et autres
Publié: (2018)

The Space Complexity of Approximating Logistic Loss
par: Dexter, Gregory, et autres
Publié: (2024)

Approximation Algorithms for Combinatorial Optimization with Predictions
par: Antoniadis, Antonios, et autres
Publié: (2024)

Learning the Positions in CountSketch
par: Li, Yi, et autres
Publié: (2023)

A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input
par: Mahpud, Bar, et autres
Publié: (2025)

Tight Differentially Private PCA via Matrix Coherence
par: d'Orsi, Tommaso, et autres
Publié: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
par: Laenen, Steinar, et autres
Publié: (2024)

Reweighted Solutions for Weighted Low Rank Approximation
par: Woodruff, David P., et autres
Publié: (2024)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
par: Li, Yi, et autres
Publié: (2024)

Incremental Approximate Single-Source Shortest Paths with Predictions
par: McCauley, Samuel, et autres
Publié: (2025)

A Simple Approximation Algorithm for Optimal Decision Tree
par: Zhuo, Zhengjia, et autres
Publié: (2025)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
par: Epasto, Alessandro, et autres
Publié: (2020)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
par: Aliakbarpour, Maryam, et autres
Publié: (2025)

A Simple Sparse Matrix Vector Multiplication Approach to Padded Convolution
par: Chaudhry, Zan
Publié: (2024)

Linear Submodular Maximization with Bandit Feedback
par: Chen, Wenjing, et autres
Publié: (2024)

High-dimensional Linear Bandits with Knapsacks
par: Ma, Wanteng, et autres
Publié: (2023)

Approximating splits for decision trees quickly in sparse data streams
par: Tatti, Nikolaj
Publié: (2026)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
par: Danait, Ved, et autres
Publié: (2025)