Imagen de Portada

Improving LSH via Tensorized Random Projection

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Verma, Bhisham Dev, Pratap, Rameshwar
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster and Space Efficient Indexing for Locality Sensitive Hashing
por: Verma, Bhisham Dev, et al.
Publicado: (2025)

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

Overcomplete Tensor Decomposition via Koszul-Young Flattenings
por: Kothari, Pravesh K., et al.
Publicado: (2024)

Data-Dependent LSH for the Earth Mover's Distance
por: Jayaram, Rajesh, et al.
Publicado: (2024)

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

Improving Online Algorithms via ML Predictions
por: Kumar, Ravi, et al.
Publicado: (2024)

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

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

On the LSH Distortion of Ulam and Cayley Similarities
por: Chierichetti, Flavio, et al.
Publicado: (2026)

Online Learning in the Random Order Model
por: Bernasconi, Martino, et al.
Publicado: (2025)

Provable Quantization with Randomized Hadamard Transform
por: Feng, Ying, et al.
Publicado: (2026)

Learning Juntas under Markov Random Fields
por: Chandrasekaran, Gautam, et al.
Publicado: (2025)

Fast Tensor Completion via Approximate Richardson Iteration
por: Ghadiri, Mehrdad, et al.
Publicado: (2025)

Approximately Optimal Core Shapes for Tensor Decompositions
por: Ghadiri, Mehrdad, et al.
Publicado: (2023)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
por: Gao, Jie, et al.
Publicado: (2025)

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression
por: Chowdhury, Agniva, et al.
Publicado: (2024)

Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
por: Nguyen, Tuan-Anh, et al.
Publicado: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
por: Feng, Ying, et al.
Publicado: (2024)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
por: Chen, Hongjie, et al.
Publicado: (2024)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
por: Chandrasekaran, Gautam, et al.
Publicado: (2025)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
por: Burathep, Kunanon, et al.
Publicado: (2025)

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

Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees
por: Lebeda, Christian Janos, et al.
Publicado: (2026)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
por: Sakaue, Shinsaku, et al.
Publicado: (2026)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
por: Angelopoulos, Spyros, et al.
Publicado: (2025)

Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
por: Ghuge, Rohan, et al.
Publicado: (2025)

Improved Approximations for Hard Graph Problems using Predictions
por: Aamand, Anders, et al.
Publicado: (2025)

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
por: Gaitonde, Jason, et al.
Publicado: (2024)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
por: Blum, Avrim, et al.
Publicado: (2024)

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

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
por: Gomez-Leos, Alejandro, et al.
Publicado: (2024)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
por: Klivans, Adam R., et al.
Publicado: (2024)

A New Rejection Sampling Approach to $k$-$\mathtt{means}$++ With Improved Trade-Offs
por: Shah, Poojan, et al.
Publicado: (2025)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
por: Chen, Hongjie, et al.
Publicado: (2025)

Hierarchical Clustering via Local Search
por: Jowhari, Hossein
Publicado: (2024)

Stochastic Matching via Local Sparsification
por: Ahmadian, Sara, et al.
Publicado: (2026)

John Ellipsoids via Lazy Updates
por: Woodruff, David P., et al.
Publicado: (2025)

Faster Graph Embeddings via Coarsening
por: Fahrbach, Matthew, et al.
Publicado: (2020)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
por: Gay, William, et al.
Publicado: (2025)

Adversarial Resilience in Sequential Prediction via Abstention
por: Goel, Surbhi, et al.
Publicado: (2023)