| Arithmetic circuits: A chasm at depth 3 A Gupta, P Kamath, N Kayal, R Saptharishi SIAM Journal on Computing 45 (3), 1064-1079, 2016 | 186* | 2016 |
| Approaching the chasm at depth four A Gupta, P Kamath, N Kayal, R Saptharishi Conference on Computational Complexity (CCC), 2013, 65-73, 2013 | 139 | 2013 |
| Does Invariant Risk Minimization Capture Invariance? P Kamath, A Tangella, D Sutherland, N Srebro International Conference on Artificial Intelligence and Statistics, 4069-4077, 2021 | 117 | 2021 |
| Bayesian inference of temporal task specifications from demonstrations A Shah, P Kamath, JA Shah, S Li Advances in Neural Information Processing Systems 31, 3804-3813, 2018 | 88 | 2018 |
| Monotone circuit lower bounds from resolution A Garg, M Göös, P Kamath, D Sokolov Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 66 | 2018 |
| Quantifying the benefit of using differentiable learning over tangent kernels E Malach, P Kamath, E Abbe, N Srebro International Conference on Machine Learning, 7379-7389, 2021 | 47 | 2021 |
| Adventures in monotone complexity and TFNP M Göös, P Kamath, R Robere, D Sokolov 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019 | 45 | 2019 |
| Decidability of non-interactive simulation of joint distributions B Ghazi, P Kamath, M Sudan 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 38 | 2016 |
| Approximate is good enough: Probabilistic variants of dimensional and margin complexity P Kamath, O Montasser, N Srebro Conference on Learning Theory, 2236-2262, 2020 | 34 | 2020 |
| Improved bounds for universal one-bit compressive sensing J Acharya, A Bhattacharyya, P Kamath Information Theory (ISIT), 2017 IEEE International Symposium on, 2353-2357, 2017 | 32 | 2017 |
| Do More Negative Samples Necessarily Hurt In Contrastive Learning? P Awasthi, N Dikkala, P Kamath 39th International Conference on Machine Learning 162, 1101-1116, 2022 | 31 | 2022 |
| Query-to-Communication Lifting for PNP M Göös, P Kamath, T Pitassi, T Watson computational complexity 28, 113-144, 2019 | 30 | 2019 |
| Connect the Dots: Tighter Discrete Approximations of Privacy Loss Distributions V Doroshenko, B Ghazi, P Kamath, R Kumar, M Pasin Privacy Enhancing Technologies Symposium 2022 (4), 552-570, 2022 | 29 | 2022 |
| Understanding the Eluder Dimension G Li, P Kamath, DJ Foster, N Srebro Advances in Neural Information Processing Systems, 0 | 25* | |
| Communication with partial noiseless feedback B Haeupler, P Kamath, A Velingker Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 24 | 2015 |
| On the power of differentiable learning versus PAC and SQ learning E Abbe, P Kamath, E Malach, C Sandon, N Srebro Advances in Neural Information Processing Systems 34, 24340-24351, 2021 | 20 | 2021 |
| Optimality of Correlated Sampling Strategies M Bavarian, B Ghazi, E Haramaty, P Kamath, RL Rivest, M Sudan Theory of Computing 16 (1), 1-18, 2020 | 19* | 2020 |
| Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange S Guo, P Kamath, A Rosen, K Sotiraki IACR International Conference on Public-Key Cryptography, 374-395, 2020 | 19 | 2020 |
| Dimension Reduction for Polynomials over Gaussian Space and Applications B Ghazi, P Kamath, R Prasad 33rd Computational Complexity Conference (CCC 2018) 102, 28:1--28:37, 2018 | 16 | 2018 |
| On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem M Göös, P Kamath, K Sotiraki, M Zampetakis 35th Computational Complexity Conference (CCC 2020) 169, 19:1--19:42, 2020 | 15 | 2020 |
Badih GhaziGoogle在 google.com 的电子邮件经过验证
