Cover Image

New Bounds for Kernel Sums via Fast Spherical Embeddings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wagner, Tal
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning from End User Data with Shuffled Differential Privacy over Kernel Densities
by: Wagner, Tal
Published: (2025)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
by: Indyk, Piotr, et al.
Published: (2025)

SpEx: A Spectral Approach to Explainable Clustering
by: Argov, Tal, et al.
Published: (2025)

Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
by: Wolfson, Daniel, et al.
Published: (2026)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
by: Mishra, Nina, et al.
Published: (2025)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
by: Pham, Ninh, et al.
Published: (2025)

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
by: Chen, Hongjie, et al.
Published: (2024)

Faster Graph Embeddings via Coarsening
by: Fahrbach, Matthew, et al.
Published: (2020)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
by: Garg, Sachin, et al.
Published: (2025)

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
by: Drexler, Lukas, et al.
Published: (2023)

Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams
by: Bakshi, Ainesh, et al.
Published: (2023)

Optimal Kernel Orchestration for Tensor Programs with Korch
by: Hu, Muyan, et al.
Published: (2024)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
by: Chakraborty, Somnath, et al.
Published: (2020)

Dynamic Similarity Graph Construction with Kernel Density Estimation
by: Laenen, Steinar, et al.
Published: (2025)

Revisiting Forest Proximities via Sparse Leaf-Incidence Kernels
by: Aumon, Adrien, et al.
Published: (2026)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
by: Danait, Ved, et al.
Published: (2025)

Mistake-Bounded Language Generation
by: Kleinberg, Jon, et al.
Published: (2026)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
by: Alman, Josh, et al.
Published: (2025)

Robust Sparse Mean Estimation via Sum of Squares
by: Diakonikolas, Ilias, et al.
Published: (2022)

Better Bounds for the Distributed Experts Problem
by: Woodruff, David P., et al.
Published: (2026)

Finite Sample Bounds for Learning with Score Matching
by: Smedira, Devin, et al.
Published: (2026)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
by: Croquevielle, Luis Alberto, et al.
Published: (2026)

Tight Bounds for Learning Polyhedra with a Margin
by: Patel, Shyamal, et al.
Published: (2026)

Improved Bounds for Online Facility Location with Predictions
by: Fotakis, Dimitris, et al.
Published: (2021)

Sharper Bounds for Chebyshev Moment Matching, with Applications
by: Musco, Cameron, et al.
Published: (2024)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
by: Woodruff, David P., et al.
Published: (2023)

Fast, robust approximate message passing
by: Ivkov, Misha, et al.
Published: (2024)

Fast and Simple Densest Subgraph with Predictions
by: Bui, Thai, et al.
Published: (2025)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
by: Diakonikolas, Ilias, et al.
Published: (2026)

A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
by: Rapoport, Emma, et al.
Published: (2025)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
by: Xue, Jinghui, et al.
Published: (2024)

Fast and Efficient Matching Algorithm with Deadline Instances
by: Song, Zhao, et al.
Published: (2023)

Fast online node labeling with graph subsampling
by: Huang, Yushen, et al.
Published: (2025)

Towards Optimal Differentially Private Regret Bounds in Linear MDPs
by: Sahu, Sharan
Published: (2025)

Fast-MWEM: Private Data Release in Sublinear Time
by: Haris, Themistoklis, et al.
Published: (2026)

Accelerating Matroid Optimization through Fast Imprecise Oracles
by: Eberle, Franziska, et al.
Published: (2024)

A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature
by: Gu, Xiang, et al.
Published: (2026)

Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
by: Arvanitakis, Dionysis, et al.
Published: (2026)