Nikhil Vyas
Massachusetts Institute of Technology
H-index: 11
North America-United States
Top articles of Nikhil Vyas
Feature-learning networks are consistent across widths at realistic scales
Advances in Neural Information Processing Systems
2024/2/13
Distinguishing the Knowable from the Unknowable with Language Models
arXiv preprint arXiv:2402.03563
2024/2/5
On the benefits of learning to route in mixture-of-experts models
2023/12/1
On Privileged and Convergent Bases in Neural Network Representations
arXiv preprint arXiv:2307.12941
2023/7/24
Nikhil Vyas
H-Index: 5
Yamini Bansal
H-Index: 3
On provable copyright protection for generative models
2023/7/3
Lower bounds against sparse symmetric functions of ACC circuits: Expanding the reach of# SAT algorithms
Theory of Computing Systems
2023/2
Nikhil Vyas
H-Index: 5
On oracles and algorithmic methods for proving lower bounds
2023
Nikhil Vyas
H-Index: 5
Ryan Williams
H-Index: 9
On the Number of Quantifiers as a Complexity Measure
arXiv preprint arXiv:2207.00104
2022/6/30
Nikhil Vyas
H-Index: 5
Ryan Williams
H-Index: 9
Limitations of the NTK for Understanding Generalization in Deep Learning
arXiv preprint arXiv:2206.10012
2022/6/20
Multi-structural games and number of quantifiers
2021/6/29
Nikhil Vyas
H-Index: 5
Optimal Fine-grained Hardness of Approximation of Linear Equations
arXiv preprint arXiv:2106.13210
2021/6/24
Mitali Bafna
H-Index: 4
Nikhil Vyas
H-Index: 5
On super strong ETH
Journal of Artificial Intelligence Research
2021/1/27
Nikhil Vyas
H-Index: 5
Ryan Williams
H-Index: 9
Fast Low-Space Algorithms for Subset Sum
2021
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
2020
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs
2020
Andrea Lincoln
H-Index: 7
Nikhil Vyas
H-Index: 5
Efficient constructions for almost-everywhere secure computation
2020
Siddhartha Jayanti
H-Index: 6
Nikhil Vyas
H-Index: 5