Ameya Velingker

According to our database, Ameya Velingker authored at least 30 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Weisfeiler-Leman at the margin: When more expressivity matters.

Billy J. Franks, Christopher Morris, Ameya Velingker, Floris Geerts

CoRR, 2024

2023

Locality-Aware Graph-Rewiring in GNNs.

Federico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein, Francesco Di Giovanni

CoRR, 2023

Affinity-Aware Graph Networks.

Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi

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

Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization.

Ameya Velingker, Maximilian Vötsch, David P. Woodruff, Samson Zhou

Proceedings of the International Conference on Machine Learning, 2023

Exphormer: Sparse Transformers for Graphs.

Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop

Proceedings of the International Conference on Machine Learning, 2023

2022

Private Robust Estimation by Stabilizing Convex Relaxations.

Pravesh Kothari, Pasin Manurangsi, Ameya Velingker

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Linear Space Streaming Lower Bounds for Approximating CSPs.

Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy

Electron. Colloquium Comput. Complex., 2021

On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy.

Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

Oblivious Sketching of High-Degree Polynomial Kernels.

Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh

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

Pure Differentially Private Summation from Anonymous Messages.

Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker

Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Private Aggregation from Fewer Anonymous Messages.

Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing.

Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, Ilya P. Razenshteyn

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

On the Power of Multiple Anonymous Messages.

Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker

IACR Cryptol. ePrint Arch., 2019

Oblivious Sketching of High-Degree Polynomial Kernels.

Michael Kapralov, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh

CoRR, 2019

Private Heavy Hitters and Range Queries in the Shuffled Model.

Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker

CoRR, 2019

Scalable and Differentially Private Distributed Aggregation in the Shuffled Model.

Badih Ghazi, Rasmus Pagh, Ameya Velingker

CoRR, 2019

A universal sampling method for reconstructing signals with simple Fourier transforms.

Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Dimension-independent Sparse Fourier Transform.

Michael Kapralov, Ameya Velingker, Amir Zandieh

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2017

(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space.

Michael Kapralov, Sanjeev Khanna, Madhu Sudan, Ameya Velingker

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees.

Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh

Proceedings of the 34th International Conference on Machine Learning, 2017

Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph.

Venkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy

Proceedings of the Approximation, 2017

2016

Bridging the Capacity Gap Between Interactive and One-Way Communication.

Bernhard Haeupler, Ameya Velingker

Electron. Colloquium Comput. Complex., 2016

On the Sensitivity Conjecture for Read-k Formulas.

Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker

Electron. Colloquium Comput. Complex., 2016

2015

Constructing Ramanujan Graphs Using Shift Lifts.

Karthekeyan Chandrasekaran, Ameya Velingker

CoRR, 2015

Approximating Nearest Neighbor Distances.

Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Communication with Partial Noiseless Feedback.

Bernhard Haeupler, Pritish Kamath, Ameya Velingker

Proceedings of the Approximation, 2015

2014

An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets.

Venkatesan Guruswami, Ameya Velingker

Electron. Colloquium Comput. Complex., 2014

Limitations on Testable Affine-Invariant Codes in the High-Rate Regime.

Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang

Electron. Colloquium Comput. Complex., 2014

2013

A fast algorithm for well-spaced points and approximate delaunay graphs.

Gary L. Miller, Donald R. Sheehy, Ameya Velingker

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes.

Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker

Electron. Colloquium Comput. Complex., 2012