Thwarting Adversarial Examples: An -Robust Sparse Fourier Transform M Bafna, J Murtagh, N Vyas
Advances in Neural Information Processing Systems 31, 10075-10085, 2018
61 2018 On provable copyright protection for generative models N Vyas, SM Kakade, B Barak
International Conference on Machine Learning, 35277-35299, 2023
50 2023 Faster Space-Efficient Algorithms for Subset Sum, -Sum, and Related Problems N Bansal, S Garg, J Nederlof, N Vyas
SIAM Journal on Computing 47 (5), 1755-1777, 2018
40 * 2018 Limitations of the NTK for Understanding Generalization in Deep Learning N Vyas, Y Bansal, P Nakkiran
arXiv preprint arXiv:2206.10012, 2022
23 2022 On super strong ETH N Vyas, R Williams
Journal of Artificial Intelligence Research 70, 473-495, 2021
15 2021 Lower bounds against sparse symmetric functions of ACC circuits: Expanding the reach of# SAT algorithms N Vyas, RR Williams
Theory of Computing Systems 67 (1), 149-177, 2023
13 2023 Fast Low-Space Algorithms for Subset Sum C Jin, N Vyas, R Williams
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
13 2021 Distribution-based objectives for Markov Decision Processes S Akshay, B Genest, N Vyas
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
13 2018 Complexity of Restricted Variants of Skolem and Related Problems S Akshay, N Balaji, N Vyas
LIPIcs-Leibniz International Proceedings in Informatics 83, 2017
13 2017 Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems M Dalirrooyfard, VV Williams, N Vyas, N Wein
arXiv preprint arXiv:1904.11601, 2019
12 2019 Approximation Algorithms for Min-Distance Problems M Dalirrooyfard, VV Williams, N Vyas, N Wein, Y Xu, Y Yu
arXiv preprint arXiv:1904.11606, 2019
11 2019 On Regularity of unary Probabilistic Automata S Akshay, B Genest, B Karelovic, N Vyas
STACS 2016, 2016
11 2016 Feature-learning networks are consistent across widths at realistic scales N Vyas, A Atanasov, B Bordelon, D Morwani, S Sainathan, C Pehlevan
Advances in Neural Information Processing Systems 36, 2024
9 2024 Near-Optimal Complexity Bounds for Fragments of the Skolem Problem S Akshay, N Balaji, A Murhekar, R Varma, N Vyas
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
9 2020 Efficient constructions for almost-everywhere secure computation S Jayanti, S Raghuraman, N Vyas
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
9 2020 Multi-structural games and number of quantifiers R Fagin, J Lenchner, KW Regan, N Vyas
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
8 2021 On the Number of Quantifiers as a Complexity Measure R Fagin, J Lenchner, N Vyas, R Williams
arXiv preprint arXiv:2207.00104, 2022
6 2022 Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs A Lincoln, N Vyas
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
6 2020 Optimal Fine-grained Hardness of Approximation of Linear Equations M Bafna, N Vyas
arXiv preprint arXiv:2106.13210, 2021
5 2021 On the benefits of learning to route in mixture-of-experts models N Dikkala, N Ghosh, R Meka, R Panigrahy, N Vyas, X Wang
The 2023 Conference on Empirical Methods in Natural Language Processing, 2023
4 2023