default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir Zandieh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Insu Han, Rajesh Jayaram, Amin Karbasi, Vahab Mirrokni, David P. Woodruff, Amir Zandieh
:
HyperAttention: Long-context Attention in Near-Linear Time. ICLR 2024- [i20]Amir Zandieh, Insu Han, Vahab Mirrokni, Amin Karbasi:
SubGen: Token Generation in Sublinear Time and Memory. CoRR abs/2402.06082 (2024) - [i19]Amir Zandieh, Majid Daliri, Insu Han:
QJL: 1-Bit Quantized JL Transform for KV Cache Quantization with Zero Overhead. CoRR abs/2406.03482 (2024) - 2023
- [c16]Amir Zandieh, Insu Han, Majid Daliri, Amin Karbasi:
KDEformer: Accelerating Transformers via Kernel Density Estimation. ICML 2023: 40605-40623 - [c15]Amir Zandieh, Insu Han, Haim Avron:
Near Optimal Reconstruction of Spherical Harmonic Expansions. NeurIPS 2023 - [c14]Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh:
Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. SODA 2023: 4768-4845 - [i18]Amir Zandieh, Insu Han, Majid Daliri, Amin Karbasi:
KDEformer: Accelerating Transformers via Kernel Density Estimation. CoRR abs/2302.02451 (2023) - [i17]Insu Han, Rajesh Jayaram, Amin Karbasi, Vahab Mirrokni, David P. Woodruff, Amir Zandieh:
HyperAttention: Long-context Attention in Near-Linear Time. CoRR abs/2310.05869 (2023) - 2022
- [c13]Insu Han, Amir Zandieh, Haim Avron:
Random Gegenbauer Features for Scalable Kernel Methods. ICML 2022: 8330-8358 - [c12]David P. Woodruff, Amir Zandieh:
Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time. ICML 2022: 23933-23964 - [c11]Insu Han, Amir Zandieh, Jaehoon Lee, Roman Novak, Lechao Xiao, Amin Karbasi:
Fast Neural Kernel Embeddings for General Activations. NeurIPS 2022 - [i16]Insu Han, Amir Zandieh, Haim Avron:
Random Gegenbauer Features for Scalable Kernel Methods. CoRR abs/2202.03474 (2022) - [i15]David P. Woodruff, Amir Zandieh:
Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time. CoRR abs/2202.04515 (2022) - [i14]Amir Zandieh, Insu Han, Haim Avron:
Near Optimal Reconstruction of Spherical Harmonic Expansions. CoRR abs/2202.12995 (2022) - [i13]Insu Han, Amir Zandieh, Jaehoon Lee, Roman Novak, Lechao Xiao, Amin Karbasi:
Fast Neural Kernel Embeddings for General Activations. CoRR abs/2209.04121 (2022) - 2021
- [c10]Amir Zandieh, Insu Han, Haim Avron, Neta Shoham, Chaewon Kim, Jinwoo Shin:
Scaling Neural Tangent Kernels via Sketching and Random Features. NeurIPS 2021: 1062-1073 - [i12]Amir Zandieh:
Learning with Neural Tangent Kernels in Near Input Sparsity Time. CoRR abs/2104.00415 (2021) - [i11]Amir Zandieh, Insu Han, Haim Avron, Neta Shoham, Chaewon Kim, Jinwoo Shin:
Scaling Neural Tangent Kernels via Sketching and Random Features. CoRR abs/2106.07880 (2021) - [i10]Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh:
Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs. CoRR abs/2107.07347 (2021) - 2020
- [b1]Amir Zandieh:
Fourier Sampling in Signal Processing and Numerical Linear Algebra. EPFL, Switzerland, 2020 - [c9]Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, Ilya P. Razenshteyn:
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. AISTATS 2020: 4088-4097 - [c8]David P. Woodruff, Amir Zandieh:
Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling. ICML 2020: 10324-10333 - [c7]Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh:
Oblivious Sketching of High-Degree Polynomial Kernels. SODA 2020: 141-160 - [i9]Michael Kapralov, Navid Nouri, Ilya P. Razenshteyn, Ameya Velingker, Amir Zandieh:
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. CoRR abs/2003.09756 (2020) - [i8]David P. Woodruff, Amir Zandieh:
Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling. CoRR abs/2007.03927 (2020)
2010 – 2019
- 2019
- [c6]Andisheh Amrollahi, Amir Zandieh, Michael Kapralov, Andreas Krause:
Efficiently Learning Fourier Sparse Set Functions. NeurIPS 2019: 15094-15103 - [c5]Michael Kapralov, Ameya Velingker, Amir Zandieh:
Dimension-independent Sparse Fourier Transform. SODA 2019: 2709-2728 - [c4]Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh:
A universal sampling method for reconstructing signals with simple Fourier transforms. STOC 2019: 1051-1063 - [i7]Michael Kapralov, Ameya Velingker, Amir Zandieh:
Dimension-independent Sparse Fourier Transform. CoRR abs/1902.10633 (2019) - [i6]Michael Kapralov, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh:
Oblivious Sketching of High-Degree Polynomial Kernels. CoRR abs/1909.01410 (2019) - 2018
- [c3]Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson:
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. ICML 2018: 3826-3835 - [i5]Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh:
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. CoRR abs/1804.09893 (2018) - [i4]Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aida Mousavifar, Ola Svensson:
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. CoRR abs/1808.01842 (2018) - [i3]Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh:
A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms. CoRR abs/1812.08723 (2018) - 2017
- [c2]Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh:
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. ICML 2017: 253-262 - [c1]Volkan Cevher, Michael Kapralov, Jonathan Scarlett, Amir Zandieh:
An adaptive sublinear-time block sparse fourier transform. STOC 2017: 702-715 - [i2]Volkan Cevher, Michael Kapralov, Jonathan Scarlett, Amir Zandieh:
An Adaptive Sublinear-Time Block Sparse Fourier Transform. CoRR abs/1702.01286 (2017) - 2014
- [i1]Amir Zandieh, Alireza Zareian, Masoumeh Azghani, Farokh Marvasti:
Reconstruction of Sub-Nyquist Random Sampling for Sparse and Multi-Band Signals. CoRR abs/1411.6587 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
