| Textbooks are all you need S Gunasekar, Y Zhang, J Aneja, CCT Mendes, A Del Giorno, S Gopi, ... arXiv preprint arXiv:2306.11644, 2023 | 286 | 2023 |
| Differentially private fine-tuning of language models D Yu, S Naik, A Backurs, S Gopi, HA Inan, G Kamath, J Kulkarni, YT Lee, ... arXiv preprint arXiv:2110.06500, 2021 | 238 | 2021 |
| 2-server PIR with subpolynomial communication Z Dvir, S Gopi Journal of the ACM (JACM) 63 (4), 1-15, 2016 | 181 | 2016 |
| Numerical composition of differential privacy S Gopi, YT Lee, L Wutschitz Advances in Neural Information Processing Systems 34, 11631-11642, 2021 | 131 | 2021 |
| One-bit compressed sensing: Provable support and vector recovery S Gopi, P Netrapalli, P Jain, A Nori International Conference on Machine Learning, 154-162, 2013 | 96 | 2013 |
| Phi-2: The surprising power of small language models M Javaheripi, S Bubeck, M Abdin, J Aneja, S Bubeck, CCT Mendes, ... Microsoft Research Blog, 2023 | 78 | 2023 |
| Trellis BMA: Coded trace reconstruction on IDS channels for DNA storage SR Srinivasavaradhan, S Gopi, HD Pfister, S Yekhanin 2021 IEEE International Symposium on Information Theory (ISIT), 2453-2458, 2021 | 54 | 2021 |
| Private convex optimization via exponential mechanism S Gopi, YT Lee, D Liu Conference on Learning Theory, 1948-1989, 2022 | 47 | 2022 |
| Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities S Gopi, V Guruswami, S Yekhanin IEEE Transactions on Information Theory 66 (10), 6066-6083, 2020 | 42 | 2020 |
| Competitive analysis of the top-K ranking problem X Chen, S Gopi, J Mao, J Schneider Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 40 | 2017 |
| Fast and memory efficient differentially private-sgd via jl projections Z Bu, S Gopi, J Kulkarni, YT Lee, H Shen, U Tantipongpipat Advances in Neural Information Processing Systems 34, 19680-19691, 2021 | 39 | 2021 |
| Differentially private set union S Gopi, P Gulhane, J Kulkarni, JH Shen, M Shokouhi, S Yekhanin International Conference on Machine Learning, 3627-3636, 2020 | 37 | 2020 |
| Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound S Gopi, S Kopparty, R Oliveira, N Ron-Zewi, S Saraf IEEE Transactions on Information Theory 64 (8), 5813-5831, 2018 | 37 | 2018 |
| Generic reed-solomon codes achieve list-decoding capacity J Brakensiek, S Gopi, V Makam Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1488-1501, 2023 | 28 | 2023 |
| Improved maximally recoverable LRCs using skew polynomials S Gopi, V Guruswami IEEE Transactions on Information Theory 68 (11), 7198-7214, 2022 | 25 | 2022 |
| Locally private hypothesis selection S Gopi, G Kamath, J Kulkarni, A Nikolov, ZS Wu, H Zhang Conference on Learning Theory, 1785-1816, 2020 | 24 | 2020 |
| On the number of rich lines in truly high dimensional sets Z Dvir, S Gopi arXiv preprint arXiv:1412.1060, 2014 | 19 | 2014 |
| Gaussian width bounds with applications to arithmetic progressions in random settings J Briët, S Gopi International Mathematics Research Notices 2020 (22), 8673-8696, 2020 | 18 | 2020 |
| Privacy-preserving in-context learning with differentially private few-shot generation X Tang, R Shin, HA Inan, A Manoel, F Mireshghallah, Z Lin, S Gopi, ... arXiv preprint arXiv:2309.11765, 2023 | 16 | 2023 |
| On maximally recoverable local reconstruction codes S Gopi, V Guruswami, S Yekhanin Electronic Colloquium on Computational Complexity 24, 183, 2017 | 16 | 2017 |
Sergey YekhaninMicrosoft在 microsoft.com 的电子邮件经过验证
