受强制性开放获取政策约束的文章 - Aravind Gollakota了解详情
可在其他位置公开访问的文章：8 篇
Statistical-query lower bounds via functional gradients
S Goel, A Gollakota, A Klivans
Advances in Neural Information Processing Systems 33, 2147-2158, 2020
强制性开放获取政策： US National Science Foundation
Ambient diffusion: Learning clean distributions from corrupted data
G Daras, K Shah, Y Dagan, A Gollakota, A Dimakis, A Klivans
Advances in Neural Information Processing Systems 36, 288-313, 2023
强制性开放获取政策： US National Science Foundation
Hardness of noise-free learning for two-hidden-layer neural networks
S Chen, A Gollakota, A Klivans, R Meka
Advances in Neural Information Processing Systems 35, 10709-10724, 2022
强制性开放获取政策： US National Science Foundation
On the hardness of PAC-learning stabilizer states with noise
A Gollakota, D Liang
Quantum 6, 640, 2022
强制性开放获取政策： US National Science Foundation, US Department of Defense
A moment-matching approach to testable learning and a new characterization of rademacher complexity
A Gollakota, AR Klivans, PK Kothari
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1657-1670, 2023
强制性开放获取政策： US National Science Foundation
Agnostically learning single-index models using omnipredictors
A Gollakota, P Gopalan, A Klivans, K Stavropoulos
Advances in Neural Information Processing Systems 36, 14685-14704, 2023
强制性开放获取政策： US National Science Foundation
Tester-learners for halfspaces: Universal algorithms
A Gollakota, A Klivans, K Stavropoulos, A Vasilyan
Advances in Neural Information Processing Systems 36, 10145-10169, 2023
强制性开放获取政策： US National Science Foundation
Packing tree degree sequences
A Gollakota, W Hardt, I Miklós
Graphs and Combinatorics 36 (3), 779-801, 2020
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
出版信息和资助信息由计算机程序自动确定