Amir Zandieh

Orcid: 0000-0002-1294-9390

According to our database1, Amir Zandieh authored at least 23 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SubGen: Token Generation in Sublinear Time and Memory.
CoRR, 2024

2023
HyperAttention: Long-context Attention in Near-Linear Time.
CoRR, 2023

Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Near Optimal Reconstruction of Spherical Harmonic Expansions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

KDEformer: Accelerating Transformers via Kernel Density Estimation.
Proceedings of the International Conference on Machine Learning, 2023

2022
Fast Neural Kernel Embeddings for General Activations.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time.
Proceedings of the International Conference on Machine Learning, 2022

Random Gegenbauer Features for Scalable Kernel Methods.
Proceedings of the International Conference on Machine Learning, 2022

2021
Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs.
CoRR, 2021

Learning with Neural Tangent Kernels in Near Input Sparsity Time.
CoRR, 2021

Scaling Neural Tangent Kernels via Sketching and Random Features.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Fourier Sampling in Signal Processing and Numerical Linear Algebra.
PhD thesis, 2020

Oblivious Sketching of High-Degree Polynomial Kernels.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling.
Proceedings of the 37th International Conference on Machine Learning, 2020

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Oblivious Sketching of High-Degree Polynomial Kernels.
CoRR, 2019

A universal sampling method for reconstructing signals with simple Fourier transforms.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Dimension-independent Sparse Fourier Transform.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Efficiently Learning Fourier Sparse Set Functions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
An adaptive sublinear-time block sparse fourier transform.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees.
Proceedings of the 34th International Conference on Machine Learning, 2017

2014
Reconstruction of Sub-Nyquist Random Sampling for Sparse and Multi-Band Signals.
CoRR, 2014


  Loading...