Peilin Zhong

Proc. ACM Manag. Data, 2023

PolySketchFormer: Fast Transformers via Sketches for Polynomial Kernels.

[BibT_eX]

[DOI]

Praneeth Kacham

Vahab Mirrokni

CoRR, 2023

Differentially Private Clustering in Data Streams.

[BibT_eX]

[DOI]

Alessandro Epasto

Tamalika Mukherjee

CoRR, 2023

Brief Announcement: Streaming Balanced Clustering.

[BibT_eX]

[DOI]

Hossein Esfandiari

Vahab Mirrokni

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Massively Parallel Tree Embeddings for High Dimensional Spaces.

[BibT_eX]

[DOI]

AmirMohsen Ahanchi

Alexandr Andoni

MohammadTaghi Hajiaghayi

Marina Knittel

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Near-Optimal k-Clustering in the Sliding Window Model.

[BibT_eX]

[DOI]

Samson Zhou

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

k-Means Clustering with Distance-Based Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Differentially Private Continual Releases of Streaming Frequency Moment Estimations.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Stars: Tera-Scale Graph Building for Clustering and Graph Learning.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Massively Parallel and Dynamic Algorithms for Minimum Size Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal Private and Scalable $k$-Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Stars: Tera-Scale Graph Building for Clustering and Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Massively Parallel k-Means Clustering for Perturbation Resilient Instances.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Vahab S. Mirrokni

Proceedings of the International Conference on Machine Learning, 2022

2021

New Primitives for Tackling Graph Problems and Their Applications in Parallel Computing.

[BibT_eX]

[DOI]

PhD thesis, 2021

Almost Linear Time Density Level Set Estimation via DBSCAN.

[BibT_eX]

[DOI]

Hossein Esfandiari

Vahab S. Mirrokni

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Average Case Column Subset Selection for Entrywise 𝓁1-Norm Loss.

[BibT_eX]

[DOI]

CoRR, 2020

Parallel approximate undirected shortest paths via low hop emulators.

[BibT_eX]

[DOI]

Alexandr Andoni

Clifford Stein

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Connected Components on a PRAM in Log Diameter Time.

[BibT_eX]

[DOI]

Sixue Cliff Liu

Robert E. Tarjan

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Planning with General Objective Functions: Going Beyond Total Rewards.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Enhancing Adversarial Defense by k-Winners-Take-All.

[BibT_eX]

[DOI]

Chang Xiao

Changxi Zheng

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

Streaming Balanced Clustering.

[BibT_eX]

[DOI]

Hossein Esfandiari

Vahab S. Mirrokni

CoRR, 2019

Resisting Adversarial Attacks by k-Winners-Take-All.

[BibT_eX]

[DOI]

Chang Xiao

Changxi Zheng

CoRR, 2019

Rethinking Generative Coverage: A Pointwise Guaranteed Approach.

[BibT_eX]

[DOI]

CoRR, 2019

Rethinking Generative Mode Coverage: A Pointwise Guaranteed Approach.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Average Case Column Subset Selection for Entrywise 퓁1-Norm Loss.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Towards a Zero-One Law for Column Subset Selection.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Symmetric Norm Regression via Linear Sketching.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity.

[BibT_eX]

[DOI]

Alexandr Andoni

Clifford Stein

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Relative Error Tensor Low Rank Approximation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Towards a Zero-One Law for Entrywise Low Rank Approximation.

[BibT_eX]

[DOI]

CoRR, 2018

Sensitivity Sampling Over Dynamic Geometric Data Streams with Applications to k-Clustering.

[BibT_eX]

[DOI]

Lin F. Yang

CoRR, 2018

BourGAN: Generative Networks with Metric Embeddings.

[BibT_eX]

[DOI]

Chang Xiao

Changxi Zheng

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Subspace Embedding and Linear Regression with Orlicz Norm.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Parallel Graph Connectivity in Log Diameter Rounds.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Low rank approximation with entrywise l1-norm error.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Optimal principal component analysis in distributed and streaming models.

[BibT_eX]

[DOI]

Christos Boutsidis

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Distributed low rank approximation of implicit functions of a matrix.

[BibT_eX]

[DOI]