Folgen
Nikhil Vyas
Nikhil Vyas
OpenAI
Bestätigte E-Mail-Adresse bei openai.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On provable copyright protection for generative models
N Vyas, SM Kakade, B Barak
International Conference on Machine Learning, 35277-35299, 2023
1162023
Thwarting Adversarial Examples: An -Robust Sparse Fourier Transform
M Bafna, J Murtagh, N Vyas
Advances in Neural Information Processing Systems 31, 10075-10085, 2018
672018
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
44*2018
Limitations of the NTK for Understanding Generalization in Deep Learning
N Vyas, Y Bansal, P Nakkiran
arXiv preprint arXiv:2206.10012, 2022
33*2022
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, 1036-1060, 2023
322023
SOAP: Improving and Stabilizing Shampoo using Adam
N Vyas, D Morwani, R Zhao, I Shapira, D Brandfonbrener, L Janson, ...
arXiv preprint arXiv:2409.11321, 2024
212024
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
202021
Distinguishing the Knowable from the Unknowable with Language Models
G Ahdritz, T Qin, N Vyas, B Barak, BL Edelman
arXiv preprint arXiv:2402.03563, 2024
192024
On super strong ETH
N Vyas, R Williams
Journal of Artificial Intelligence Research 70, 473-495, 2021
192021
On the benefits of learning to route in mixture-of-experts models
N Dikkala, N Ghosh, R Meka, R Panigrahy, N Vyas, X Wang
Proceedings of the 2023 Conference on Empirical Methods in Natural Language …, 2023
182023
Deconstructing What Makes a Good Optimizer for Autoregressive Language Models
R Zhao, D Morwani, D Brandfonbrener, N Vyas, SM Kakade
The Thirteenth International Conference on Learning Representations, 2025
17*2025
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
162018
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
142023
Complexity of Restricted Variants of Skolem and Related Problems
S Akshay, N Balaji, N Vyas
LIPIcs-Leibniz International Proceedings in Informatics 83, 2017
142017
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
M Dalirrooyfard, VV Williams, N Vyas, N Wein
arXiv preprint arXiv:1904.11601, 2019
132019
Approximation Algorithms for Min-Distance Problems
M Dalirrooyfard, VV Williams, N Vyas, N Wein, Y Xu, Y Yu
arXiv preprint arXiv:1904.11606, 2019
122019
Multi-structural games and number of quantifiers
R Fagin, J Lenchner, KW Regan, N Vyas
Logical Methods in Computer Science 21, 2025
112025
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
112020
A New Perspective on Shampoo's Preconditioner
D Morwani, I Shapira, N Vyas, E Malach, S Kakade, L Janson
arXiv preprint arXiv:2406.17748, 2024
102024
Efficient constructions for almost-everywhere secure computation
S Jayanti, S Raghuraman, N Vyas
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
102020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20